Modeling and Solving a Multi-Period Inventory Fulfilling and Routing Problem for Hazardous Materials

被引:8
作者
Hu, Hao [1 ,2 ]
Li, Jian [3 ]
Li, Xiang [4 ,5 ]
Shang, Changjing [5 ]
机构
[1] Shijiazhuang Tiedao Univ, Sch Econ & Management, Shijiazhuang 050000, Hebei, Peoples R China
[2] Beijing Univ Chem Technol, Coll Informat Sci & Technol, Beijing 100029, Peoples R China
[3] Beijing Univ Technol, Coll Econ & Management, Res Base Beijing Modern Mfg Dev, Beijing 100124, Peoples R China
[4] Beijing Univ Chem Technol, Coll Econ & Management, Beijing 100029, Peoples R China
[5] Aberystwyth Univ, Inst Math Phys & Comp Sci, Dept Comp Sci, Aberystwyth SY23 3DB, Dyfed, Wales
基金
中国国家自然科学基金;
关键词
Genetic algorithm; integer programming model; limited production capacity; multi-period inventory routing problem; PROGRAMMING-MODEL; TRANSPORTATION; ALGORITHM; LOCATION; NETWORK;
D O I
10.1007/s11424-019-8176-2
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Any potential damage may be severe once an accident occurs involving hazardous materials. It is therefore important to consider the risk factor concerning hazardous material supply chains, in order to make the best inventory routing decisions. This paper addresses the problem of hazardous material multi-period inventory routing with the assumption of a limited production capacity of a given manufacturer. The goal is to achieve the manufacturer's production plan, the retailer's supply schedule and the transportation routes within a fixed period. As the distribution of hazardous materials over a certain period is essentially a multiple travelling salesmen problem, the authors formulate a loading-dependent risk model for multiple-vehicle transportation and present an integer programming model to maximize the supply chain profit. An improved genetic algorithm considering two dimensions of chromosomes that cover the aforementioned period and supply quantity is devised to handle the integer programming model. Numerical experiments carried out demonstrate that using the proposed multi-period joint decision-making can significantly increase the overall profit of the supply chain as compared to the use of single period decision repeatedly, while effectively reducing its risk.
引用
收藏
页码:760 / 782
页数:23
相关论文
共 32 条
[1]   Multi-product multi-period Inventory Routing Problem with a transshipment option: A green approach [J].
Al-e-Hashem, S. M. J. Mirzapour ;
Rekik, Yacine .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2014, 157 :80-88
[2]   OPTIMAL OBNOXIOUS PATHS ON A NETWORK - TRANSPORTATION OF HAZARDOUS MATERIALS [J].
BATTA, R ;
CHIU, SS .
OPERATIONS RESEARCH, 1988, 36 (01) :84-92
[3]   IMPROVING THE DISTRIBUTION OF INDUSTRIAL GASES WITH AN ONLINE COMPUTERIZED ROUTING AND SCHEDULING OPTIMIZER [J].
BELL, WJ ;
DALBERTO, LM ;
FISHER, ML ;
GREENFIELD, AJ ;
JAIKUMAR, R ;
KEDIA, P ;
MACK, RG ;
PRUTZMAN, PJ .
INTERFACES, 1983, 13 (06) :4-23
[4]   AN INTEGRATED INVENTORY ALLOCATION AND VEHICLE-ROUTING PROBLEM [J].
CHIEN, TW ;
BALAKRISHNAN, A ;
WONG, RT .
TRANSPORTATION SCIENCE, 1989, 23 (02) :67-76
[5]   A branch-and-cut algorithm for the multi-product multi-vehicle inventory-routing problem [J].
Coelho, Leandro C. ;
Laporte, Gilbert .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2013, 51 (23-24) :7156-7169
[6]   The inventory-routing problem with transshipment [J].
Coelho, Leandro C. ;
Cordeau, Jean-Francois ;
Laporte, Gilbert .
COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (11) :2537-2548
[7]   SUPPLYING A SINGLE LOCATION FROM HETEROGENEOUS SOURCES [J].
DAGANZO, CF .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1985, 19 (05) :409-419
[8]   Multi-depot vehicle routing problem for hazardous materials transportation: A fuzzy bilevel programming [J].
Du, Jiaoman ;
Li, Xiang ;
Yu, Lean ;
Dan, Ralescu ;
Zhou, Jiandong .
INFORMATION SCIENCES, 2017, 399 :201-218
[9]   Fuzzy multi-objective chance-constrained programming model for hazardous materials transportation [J].
Du, Jiaoman ;
Yu, Lean ;
Li, Xiang .
INTERNATIONAL JOURNAL OF GENERAL SYSTEMS, 2016, 45 (03) :286-310
[10]  
Fu Cheng-hong, 2010, Computer Engineering and Applications, V46, P198, DOI 10.3778/j.issn.1002-8331.2010.09.056