Study on multi-objective travelling salesman problem for hazardous materials transportation based on improved genetic algorithm
by Ruichun He; Changxi Ma; Yinzhen Li; Aixia Diao
International Journal of Computing Science and Mathematics (IJCSM), Vol. 4, No. 2, 2013

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.

Online publication date: Sat, 10-May-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computing Science and Mathematics (IJCSM):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email