The Vehicle Routing Problem with Backhauls: A Multi-objective Evolutionary Approach
In the Vehicle Routing Problem with Backhauls there are linehaul customers, who demand products, and backhaul customers, who supply products, and there is a fleet of vehicles available for servicing customers. The problem consists in finding a set of routes with the minimum cost, such that all customers are serviced. A generalization of this problem considers the collection from the backhaul customers optional. If the number of vehicles, the cost, and the uncollected demand are assumed to be equally important objectives, the problem can be tackled as a multi-objective optimization problem. In this paper, we solve these as multi-objective problems with an adapted previously proposed evolutionary algorithm and evaluate its performance with proper tools.
KeywordsMulti-objective optimization vehicle routing problem
Unable to display preview. Download preview PDF.
- 4.Franks, J.: A (Terse) Introduction to Lebesgue Integration. AMS (2009)Google Scholar
- 6.Garcia-Najera, A.: Preserving population diversity for the multi-objective vehicle routing problem with time windows. In: Rothlauf, F. (ed.) Genetic and Evolutionary Computation Conference 2009, pp. 2689–2692. ACM (2009)Google Scholar