Optimizing delivery time in multi-objective vehicle routing problems with time windows

Authors:
Abel Garcia-Najera;John A. Bullinaria
Affiliations:
School of Computer Science, University of Birmingham, Birmingham, United Kingdom;School of Computer Science, University of Birmingham, Birmingham, United Kingdom
Venue:
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part II
Year:
2010

Citing 10
Cited 0

Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
A new optimization algorithm for the vehicle routing problem with time windows

Operations Research
Evolutionary Algorithms for the Vehicle Routing Problem with Time Windows

Journal of Heuristics
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results

Evolutionary Computation
Multi-Objective Genetic Algorithms for Vehicle Routing Problem with Time Windows

Applied Intelligence
A Hybrid Multiobjective Evolutionary Algorithm for Solving Vehicle Routing Problem with Time Windows

Computational Optimization and Applications
Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms

Transportation Science
Vehicle Routing Problem with Time Windows, Part II: Metaheuristics

Transportation Science
Preserving population diversity for the multi-objective vehicle routing problem with time windows

Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
A fast and elitist multiobjective genetic algorithm: NSGA-II

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.01

Visualization

Abstract

The Vehicle Routing Problem with Time Windows involves finding the lowest-cost set of routes to deliver goods to customers, which have service time windows, using a homogeneous fleet of vehicles with limited capacity. In this paper, we propose and analyze the performance of an improved multi-objective evolutionary algorithm, that simultaneously minimizes the number of routes, the total travel distance, and the delivery time. Empirical results indicate that the simultaneous minimization of all three objectives leads the algorithm to find similar or better results than any combination of only two objectives. These results, although not the best in all respects, are better in some aspects than all previously published approaches, and fully multi-objective comparisons show clear improvement over the popular NSGA-II algorithm.