Title: 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

Addresses: 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

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.

Keywords: hazardous materials; transport routing; multi-objective TSP; travelling salesman problem; genetic algorithms.

DOI: 10.1504/IJCSM.2013.055214

International Journal of Computing Science and Mathematics, 2013 Vol.4 No.2, pp.131 - 139

Received: 25 Apr 2013
Accepted: 29 Apr 2013
Published online: 10 May 2014 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article