An effective genetic algorithm for the fleet size and mix vehicle routing problems

Abstract

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.Genetic algorithm Single parent crossover Local search Fleet size and mix vehicle routing problem