Study on multi-objective travelling salesman problem for hazardous materials transportation based on improved genetic algorithm

  • Authors:
  • Ruichun He;Changxi Ma;Yinzhen Li;Aixia Diao

  • Affiliations:
  • School of Traffic and Transportation, Lanzhou Jiaotong University, Lanzhou, 730070, China;School of Traffic and Transportation, Lanzhou Jiaotong University, Lanzhou, 730070, China;School of Traffic and Transportation, Lanzhou Jiaotong University, Lanzhou, 730070, China;School of Traffic and Transportation, Lanzhou Jiaotong University, Lanzhou, 730070, China

  • Venue:
  • International Journal of Computing Science and Mathematics
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

When selecting an optimal route for hazardous materials transportation, many factors are needed to be considered. Through minimising transportation risk and operation distance, multi-objective travelling salesman problem MO-TSP model for hazardous materials transportation route is established. The natural chromosome encoding is used to encode and the roulette and optimal saving strategy are combined for selection, the order crossover is used for crossover operation to improve the traditional genetic algorithm. Then the improved genetic algorithm is used to solve MO-TSP model of hazardous materials transportation route. Finally, the correctness and effectiveness of the model and algorithm are verified with a case. This approach can help decision-makers determine reasonable transportation route for the hazardous materials transportation.