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

Hao Hu, Jian Li, Xiang Li, Changjing Shang

Research output: Contribution to journalArticlepeer-review

8 Citations (SciVal)
111 Downloads (Pure)


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.
Original languageEnglish
Pages (from-to)760-782
Number of pages23
JournalJournal of Systems Science and Complexity
Issue number3
Early online date31 Dec 2019
Publication statusPublished - 01 Jun 2020


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


Dive into the research topics of 'Modeling and Solving a Multi-Period Inventory Fulfilling and Routing Problem for Hazardous Materials'. Together they form a unique fingerprint.

Cite this