Multi-objective location-routing model for hazardous material logistics with traffic restriction constraint in inter-city roads

被引:79
作者
Hu, Hao [1 ]
Li, Xiang [2 ,3 ]
Zhang, Yuanyuan [2 ]
Shang, Changjing [3 ]
Zhang, Sicheng [2 ]
机构
[1] Beijing Univ Chem Technol, Coll Informat Sci & Technol, Beijing 100029, Peoples R China
[2] Beijing Inst Chem Technol, Coll Econ & Management, Beijing 100029, Peoples R China
[3] Aberystwyth Univ, Dept Comp Sci, Aberystwyth, Dyfed, Wales
基金
中国国家自然科学基金;
关键词
Hazardous material logistics; Location-routing model; Traffic restriction constraint; Adaptive weight genetic algorithms; TRAVELING SALESMAN PROBLEM; GENETIC ALGORITHM; FACILITY LOCATION; TRANSPORT RISK; NETWORK;
D O I
10.1016/j.cie.2018.10.044
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Effective solutions to the hazardous material location and routing problem are of practical significance, for both logistics companies and government departments. However, most existing hazardous material location and routing studies lack certain practicabilities in dealing with real-life problems. In this paper, we present a novel multi-objective optimization method for finding the optimal routes in hazardous material logistics under the constraint of traffic restrictions in inter-city roads. In addition, to move the solution method closer to practical application, we propose to consider multiple paths between every possible origin-destination pair. The resulting multi-objective location-routing model is able to jointly address the important aspects of risk, cost, and customer satisfaction in hazardous material logistics management. A single genetic algorithm and an adaptive weight genetic algorithm are proposed to solve the proposed model respectively, whose chromosomes contain two types of genes, representing warehouses and transportation routes respectively. A real-world case study is provided to illustrate the efficacy of the proposed model and its associated solution method.
引用
收藏
页码:861 / 876
页数:16
相关论文
共 42 条
[21]   AN OPTIMAL SOLUTION METHOD FOR LARGE-SCALE MULTIPLE TRAVELING SALESMEN PROBLEMS [J].
GAVISH, B ;
SRIKANTH, K .
OPERATIONS RESEARCH, 1986, 34 (05) :698-717
[22]   Recent advances in hybrid evolutionary algorithms for multiobjective manufacturing scheduling [J].
Gen, Mitsuo ;
Zhang, Wenqiang ;
Lin, Lin ;
Yun, YoungSu .
COMPUTERS & INDUSTRIAL ENGINEERING, 2017, 112 :616-633
[23]  
Gen MitsuoRunwei Cheng Lin Lin., 2008, NETWORK MODELS OPTIM
[24]   Hybrid genetic algorithm for multi-time period production/distribution planning [J].
Gen, MS ;
Syarif, A .
COMPUTERS & INDUSTRIAL ENGINEERING, 2005, 48 (04) :799-809
[25]   Facility location and reliable route planning in hazardous material transportation [J].
Helander, ME ;
Melachrinoudis, E .
TRANSPORTATION SCIENCE, 1997, 31 (03) :216-226
[26]  
Hu H., 2017, J. Uncertain Syst., V11, P163
[27]   A credibilistic goal programming model for inventory routing problem with hazardous materials [J].
Hu, Hao ;
Li, Jian ;
Li, Xiang .
SOFT COMPUTING, 2018, 22 (17) :5803-5816
[28]   Solving the multi-objective Vehicle Routing Problem with Soft Time Windows with the help of bees [J].
Iqbal, Sumaiya ;
Kaykobad, M. ;
Rahman, M. Sohel .
SWARM AND EVOLUTIONARY COMPUTATION, 2015, 24 :50-64
[29]   Designing a road network for hazardous materials transportation [J].
Kara, BY ;
Verter, V .
TRANSPORTATION SCIENCE, 2004, 38 (02) :188-196
[30]   THE TRAVELING SALESMAN PROBLEM - AN OVERVIEW OF EXACT AND APPROXIMATE ALGORITHMS [J].
LAPORTE, G .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1992, 59 (02) :231-247