A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
This study proposes a genetic algorithm to solve the biobjective vehicle routing problem with time windows simultaneously considering total distance and distance balance of active vehicle fleet. A new complex chromosome is used to present the active vehicle route. Through tournament selection, one-point crossover, and migrating mutation operator, the solution of the problem is solved. In experiment on Solomon's benchmark problems, considering the total distance and distance balance, the resultsdoi:10.1155/2013/325686 fatcat:ffaqfutnzfg7hhs632plk27qca