An effective genetic algorithm for the fleet size and mix vehicle routing problems
This paper studies the fleet size and mix vehicle routing problem (FSMVRP), in which the fleet is heterogeneous and its composition to be determined. We design and implement a genetic algorithm (GA) based heuristic. On a set of twenty benchmark problems it reaches the best-known solution 14 times and finds one new best solution. It also provides a competitive performance in terms of average solution.
Year of publication: |
2009
|
---|---|
Authors: | Liu, Shuguang ; Huang, Weilai ; Ma, Huiming |
Published in: |
Transportation Research Part E: Logistics and Transportation Review. - Elsevier, ISSN 1366-5545. - Vol. 45.2009, 3, p. 434-445
|
Publisher: |
Elsevier |
Keywords: | Genetic algorithm Single parent crossover Local search Fleet size and mix vehicle routing problem |
Saved in:
Saved in favorites
Similar items by person
-
An effective genetic algorithm for the fleet size and mix vehicle routing problems
Liu, Shuguang, (2009)
-
An effective genetic algorithm for the fleet size and mix vehicle routing problems
Liu, Shuguang, (2009)
-
An effective genetic algorithm for the fleet size and mix vehicle routing problems
Liu, Shuguang, (2009)
- More ...