Research Article
Hybrid Genetic Algorithms for the Asymmetric Distance-Constrained Vehicle Routing Problem
| Input: A chromosome. | | Output: New chromosome. | | fortodo | | fortodo | | If swapping cities αi and αj reduces the distance of the chromosome and does not violate distance constraint, then swap them | | end for | | end for | | Return the new chromosome |
|