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

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 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.

This is a preview of subscription content, log in to check access.

References

  1. [1]

    Li J, Feng Y, Yu Y, et al., Research on the statistics of hazardous chemical accidents in China during the “twelfth five-year” period and recommendations, Journal of Wuhan University of Technology, 2016, 38(5): 543–547.

    Google Scholar 

  2. [2]

    Hu H, Li J, and Li X, A credibilistic goal programming model for inventory routing problem with hazardous materials, Soft Computing, 2018, 22(17): 5803–5816.

    MATH  Google Scholar 

  3. [3]

    Jaillet P, Bard J F, Huang L, et al., Delivery cost approximations for inventory routing problems in a rolling horizon framework, Transportation Science, 2001, 36(3): 292–300.

    MATH  Google Scholar 

  4. [4]

    Vidovic M, Popovic D, and Ratkovic B, Mixed integer and heuristics model for the inventory routing problem in fuel delivery, International Journal of Production Economics, 2014, 147: 593–604.

    Google Scholar 

  5. [5]

    Bell W, Dalberto L, Fisher M, et al., Improving the distribution of industrial gases with an on-line computerized routing and scheduling optimizer, Interfaces, 1983, 13: 4–23.

    Google Scholar 

  6. [6]

    Daganzo C F, Supplying a single location from heterogeneous sources, Transportation Research Part B: Methodological, 1985, 19(5): 409–419.

    MathSciNet  Google Scholar 

  7. [7]

    Chien T W, Balakrishnan A, and Wong R T, An integrated inventory allocation and vehicle routing problem, Transportation Science, 1989, 23(2): 67–76.

    MathSciNet  MATH  Google Scholar 

  8. [8]

    Zhao Q H, Chen S, and Zang C X, Model and algorithm for inventory/routing decision in a three-echelon logistics system, European Journal of Operational Research, 2008, 191(3): 623–635.

    MathSciNet  MATH  Google Scholar 

  9. [9]

    Coelho L C and Laporte G, A branch-and-cut algorithm for the multi-product multi-vehicle inventory-routing problem, International Journal of Production Research, 2013, 51(23–24): 7156–7169.

    Google Scholar 

  10. [10]

    Li K, Chen B, Sivakumar, A I, et al., An inventory-routing problem with the objective of travel time minimization, European Journal of Operational Research, 2014, 236(3): 936–945.

    MathSciNet  MATH  Google Scholar 

  11. [11]

    Viswanathan S and Mathur K, Integrating routing and inventory decisions in one-warehouse multiretailer multiproduct distribution systems, Management Science, 1997, 43(3): 294–312.

    MATH  Google Scholar 

  12. [12]

    Zhao Q H, Wang S Y, and Lai K K, A partition approach to the inventory/routing problem, European Journal of Operational Research, 2007, 177(2): 786–802.

    MATH  Google Scholar 

  13. [13]

    Cheng-Hong F U, Optimization on stochastic inventory-routing problem in multi-cycle two-echelon system, Computer Engineering and Applications, 2010, 46(9): 198–201.

    Google Scholar 

  14. [14]

    Huang S H and Lin P C, A modified ant colony optimization algorithm for multi-item inventory routing problems with demand uncertainty, Transportation Research Part E: Logistics and Transportation Review, 2010, 46(5): 598–611.

    MathSciNet  Google Scholar 

  15. [15]

    Moin N H, Salhi S, and Aziz N A B, An efficient hybrid genetic algorithm for the multi-product multi-period inventory routing problem, International Journal of Production Economics, 2011, 133(1): 334–343.

    Google Scholar 

  16. [16]

    Al-E-Hashem S M J M and Rekik Y, Multi-product multi-period inventory routing problem with a transshipment option: A green approach, International Journal of Production Economics, 2014, 157: 80–88.

    Google Scholar 

  17. [17]

    Rold´an R F, Basagoiti R, and Coelho L C, Robustness of inventory replenishment and customer selection policies for the dynamic and stochastic inventory-routing problem, Computers and Operations Research, 2016, 74: 14–20.

    MathSciNet  MATH  Google Scholar 

  18. [18]

    Rahimi M, Baboli A, and Rekik Y, Multi-objective inventory routing problem: A stochastic model to consider profit, service level and green criteria, Transportation Research Part E: Logistics and Transportation Review, 2017, 101: 59–83.

    Google Scholar 

  19. [19]

    Wei M, Yu L, and Li X, Credibilistic location-routing model for hazardous materials transportation, International Journal of Intelligent Systems, 2015, 30(1): 23–39.

    Google Scholar 

  20. [20]

    Wei M, Li X, and Yu L, Time-dependent fuzzy random location-scheduling programming for hazardous materials transportation, Transportation Research Part C: Emerging Technologies, 2015, 57: 146–165.

    Google Scholar 

  21. [21]

    Du J, Yu L, and Li X, Fuzzy multi-objective chance-constrained programming model for hazardous materials transportation, International Journal of General Systems, 2016, 45(3): 286–310.

    MathSciNet  MATH  Google Scholar 

  22. [22]

    Du J, Li X, Yu L, et al., Multi-depot vehicle routing problem for hazardous materials transportation: A fuzzy bilevel programming, Information Sciences, 2017, 399: 201–218.

    Google Scholar 

  23. [23]

    Hu H, Guo S, Ma H, et al., A credibilistic mixed integer programming model for time-dependent hazardous materials vehicle routing problem, Journal of Uncertain Systems, 2017, 11(3): 163–175.

    Google Scholar 

  24. [24]

    Batta R and Chiu S S, Optimal obnoxious paths on a network: Transportation of hazardous materials, Operations Research, 1988, 36(1): 84–92.

    Google Scholar 

  25. [25]

    Revelle C, Cohon J, and Shobrys D, Simultaneous siting and routing in the disposal of hazardous wastes, Transportation Science, 1991, 25(2): 138–145.

    Google Scholar 

  26. [26]

    Haimes Y Y, Lasdon L S, and Wismer D A, On a bicriterion formulation of the problems of integrated system identification and system optimization, Systems Man and Cybernetics IEEE Transactions on, 1971, SMC-1(3): 296–297.

    MathSciNet  MATH  Google Scholar 

  27. [27]

    Coelho L C, Cordeau J F, and Laporte G, The inventory-routing problem with transshipment, Computers and Operations Research, 2012, 39(11): 2537–2548.

    MathSciNet  MATH  Google Scholar 

  28. [28]

    Xu Y and Cui J, Multitask n-vehicle exploration problem: Complexity and algorithm, Journal of Systems Science and Complexity, 2012, 25(6): 1080–1092.

    MathSciNet  MATH  Google Scholar 

  29. [29]

    Zhang X and Waller S T, Mixed-vehicular aggregated transportation network design considering en-route recharge service provision for electric vehicles, Journal of Systems Science and Complexity, 2018, 31(5): 1329–1349.

    MathSciNet  Google Scholar 

  30. [30]

    Padberg M and Rinaldi G, A branch-and-cut approach to a traveling salesman problem with side constraints, Management Science, 1989, 35(11): 1393–1412.

    MathSciNet  MATH  Google Scholar 

  31. [31]

    Marinakis Y and Marinaki M, A hybrid genetic-particle swarm optimization algorithm for the vehicle routing problem, Expert Systems with Applications, 2010, 37(2): 1446–1455.

    MATH  Google Scholar 

  32. [32]

    Zhou Y, Runtime analysis of an ant colony optimization algorithm for tsp instances, IEEE Transactions on Evolutionary Computation, 2009, 13(5): 1083–1092.

    Google Scholar 

Download references

Author information

Affiliations

Authors

Corresponding author

Correspondence to Xiang Li.

Additional information

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.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Hu, H., Li, J., Li, X. et al. Modeling and Solving a Multi-Period Inventory Fulfilling and Routing Problem for Hazardous Materials. J Syst Sci Complex 33, 760–782 (2020). https://doi.org/10.1007/s11424-019-8176-2

Download citation

Keywords

  • Genetic algorithm
  • integer programming model
  • limited production capacity
  • multi-period inventory routing problem