Vehicle routing multi-objective optimisation for hazardous materials transportation based on adaptive double populations genetic algorithm
by Changxi Ma; Ruichun He; Chengming Zhu; Xinfeng Yang; Fuquan Pan
International Journal of Innovative Computing and Applications (IJICA), Vol. 8, No. 4, 2017

Abstract: Aiming at hazardous materials transportation (HMT), vehicle routing optimisation models for single vehicle and multiple vehicle are proposed respectively, and the adaptive double populations genetic algorithm are constructed. Firstly, the goal functions of models are minimising the total risk, cost and the running time of hazardous materials vehicle. Then, the load constraint, max-risk constraint and time window constraint are considered. Finally, natural number is used for coding, double populations mechanism and adaptive weighted fitness allocation mechanism are adopted to calculate unit fitness, partial matched-crossover method is adopted for crossover operation, and the inversion mutation operator is adopted for mutation operation. Case study shows the model and algorithm are feasible, the vehicle routing strategy can provide direct reference for hazardous materials transportation decision-making departments and it is an effective way for prevention of hazardous materials transportation accidents.

Online publication date: Mon, 27-Nov-2017

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 Innovative Computing and Applications (IJICA):
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 subs@inderscience.com