线状需求下的长江航道危险品应急中心选址优化  

Location Optimization on Emergency Centers of Dangerous-goods in Waterway of the Yangtze River Based on Route-like Demand

作　　者：计明军[1] 宋婷婷[1] 宋佳[1] 杨永志[1] 王清斌[1] JI Ming-jun SONG Ting-ting SONG Jia YANG Yong-zhi WANG Qing-bin(Transportation Management College, Dalian Maritime University, Dalian 116026, China)

机构地区：[1]大连海事大学交通运输管理学院,辽宁大连116026

出　　处：《运筹与管理》2016年第5期68-74,共7页Operations Research and Management Science

基　　金：国家社科基金重大项目(14ZDB131);国家自然科学基金(71072081)

摘　　要：本文分析了长江航道危险品船舶对应急中心救援服务的线状需求特征,基于点状需求的设施选址模型,构建了全覆盖下的最小成本选址模型,实现了线状需求特性与最小成本的最优结合。将点状需求的设施选址研究延伸到线状需求的设施选址研究领域。并且针对模型设计了确定性规划算法和遗传算法。最后以长江航道为具体算例,对比了确定性规划算法和遗传算法对模型进行求解的效率及精度。实例表明,本文建立的基于线状需求的应急中心选址模型是符合实际的,确定性规划算法相对于遗传算法可以在更短时间内求得较稳定的最优解;遗传算法运行时间相对较长,且结果稳定性较差。This paper analyzes the characteristics of route-like demand for emergency rescue service center indangerous-goods shipping in waterway of the Yangtze river, and builds a location model with the minimum costunder complete coverage according to the location model based on point-like demand, implements optimal combi-nation of the route-like demand characteristics and the minimum cost, extends the location research field from thelocation research on the basis of point-like demand to route-like demand. What＇ s more, deterministic program-ming algorithm and genetic algorithm are developed to solve the problem. Finally, the Yangtze river waterway ischosen as an example to compare the effectiveness and efficiency of the above algorithms. The instance showsthat the emergency center location model based on route-like demand is consistent with the reality. Compared togenetic algorithm, the deterministic planning algorithm can generate a stable optimal solution in a short time;Genetic algorithm incurs too much running time, and the stability of the results is not robust.

关 键 词：交通运输 选址问题 确定性规划算法 遗传算法 长江航道 线状需求 

分 类 号：F252.3[经济管理—国民经济]