Comments on “An improved model for vehicle routing problem with time constraint based on genetic algorithm” [Comput. Ind. Eng. 42 (2002) 361–369]

https://doi.org/10.1016/j.cie.2010.06.005Get rights and content

Abstract

An improved model for vehicle routing problem proposed by Heung-Suk Hwang (2002) was recently published in Computer & Industrial Engineering Journal to solve the time constraint vehicle routing problem based on improved genetic algorithm. In this work, comments are given to the published paper of Heung-Suk Hwang (2002). And they centralize on the example of improved mutation operator and the problem formulation. The suggested modifications are also provided in this work.

Section snippets

Examples of Improved mutation operator

In Section 2.2 of Heung-Suk Hwang (2002), examples of reciprocal exchange mutation and inversion mutation are listed as follows:

  • Reciprocal exchange mutation:

Selects two positions at random and then swaps the genes on these positions. For instance, from the P1 we select two positions, 4 and 8 and interchanging 4 and 8 will alter a certain number of genes from one parent to produce offspring.P1=(123456789)O1=(123456789)

  • Inversion mutation:

Find out two cutting points within a chromosome at random

Conclusions

The examples of improved mutations and problem formulation in Heung-Suk Hwang (2002) are commented in this work. And modifications are provided too.

Reference (1)

Cited by (0)

View full text