Modeling and Solving a Multi-Period Inventory Fulfilling and Routing Problem for Hazardous Materials
- PDF / 497,654 Bytes
- 23 Pages / 595.276 x 841.89 pts (A4) Page_size
- 48 Downloads / 170 Views
Modeling and Solving a Multi-Period Inventory Fulfilling and Routing Problem for Hazardous Materials∗ HU Hao · LI Jian · LI Xiang · SHANG Changjing
DOI: 10.1007/s11424-019-8176-2 Received: 15 June 2018 / Revised: 7 November 2018 c The Editorial Office of JSSC & Springer-Verlag GmbH Germany 2019 Abstract 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 loadingdependent 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 multiperiod joint decision-making can significantly increase the overall profit of the supply chain as compared HU Hao School of Economics and Management, Shijiazhuang Tiedao University, Shijiazhuang 050000, China; College of Information Science and Technology, Beijing University of Chemical Technology, Beijing 100029, China. Email: [email protected]. LI Jian Research Base of Beijing Modern Manufacturing Development, College of Economics and Management, Beijing University of Technology, Beijing 100124, China. Email: [email protected]. LI Xiang (Corresponding author) College of Economics and Management, Beijing University of Chemical Technology, Beijing 100029, China; Department of Computer Science, Institute of Mathematics, Physics and Computer Science, Aberystwyth University, Aberystwyth SY23 3DB, UK. Email: [email protected]. SHANG Changjing Department of Computer Science, Institute of Mathematics, Physics and Computer Science, Aberystwyth University, Aberystwyth SY23 3DB, UK. Email:[email protected]. ∗ This research was supported by the National Natural Science Foundation of China under Grant Nos. 71571010, 71722007, a Fundamental Research Funds for the Central Universities under Grant No. XK1802-5, a Ser Cymru II COFUND Research Fellowship, UK, and a Great Wall Scholar Training Program of Beijing Municipality under Grant No. CIT&TCD20180305. This paper was recommended for publication by Editor WANG Shouyang.
2
HU HAO, et al.
to the use of single period decision repeatedly, while effectively reducing its risk. Keywords Genetic algorithm, integer programming model, limited production capacity, multi-period inventory routing problem.
1
Data Loading...
