危险货物多式联运路径优化问题的多目标优化算法  

Multi-objective optimized algorithm for routing optimization problem in intermodal transportation of hazardous materials

作　　者：黄丽霞[1] 帅斌[1] 

机构地区：[1]西南交通大学交通运输与物流学院,四川成都610031

出　　处：《中国安全生产科学技术》2014年第9期10-16,共7页Journal of Safety Science and Technology

基　　金：国家自然科学基金项目(71173177)

摘　　要：为了更为有效地规划与管理危险货物运输,研究在多式联运危险货物时的路径优化问题,同时囊括双目标、多批货物以及货物的送达时间要求和路段的容量限制。以运输和转运过程中的总成本和总风险最小为目标,构建了双目标0-1线性规划模型。集成路径搜索算法和非支配排序规则,设计了基于帕累托分析的多目标优化算法,以获得原问题的非劣路径。算例结果表明,该算法可有效地获得实际问题的一组具有竞争性的非劣解,且相比于单式运输,多式联运危险货物有望同时降低总成本和总风险。To more effectively plan and manage the hazardous materials transportation, the routing optimization problem arising in intermodal transportation of hazardous materials was investigated, which simultaneously incorporated bi-criteria, multi-commodity, delivery time requirement of commodity, and capacity limitation of road segment. The problem was formulated as a bi-criteria binary linear programming model to minimize the total cost and the total risk in the transportation and transfer processes. A muhi-objective algorithm based on Pareto analysis was designed with the integration of path finding algorithms and non-dominated sorting principle. Computational results showed that the proposed algorithm can effectively determine a set of competitive non-dominated solutions for the practical problem, and compared with the uni-modal transportation, the inter-modal transportation of hazardous materials can hopefully decrease the total cost and the total risk simultaneously.

关 键 词：综合交通运输 多式联运路径优化 多目标规划 危险货物 帕累托分析 

分 类 号：X951[环境科学与工程—安全科学]