Bi-objective Optimization for the Vehicle Routing Problem with Time Windows: Using Route Similarity to Enhance Performance

Authors:
Abel Garcia-Najera;John A. Bullinaria
Affiliations:
School of Computer Science, University of Birmingham, Birmingham, United Kingdom B15 2TT;School of Computer Science, University of Birmingham, Birmingham, United Kingdom B15 2TT
Venue:
EMO '09 Proceedings of the 5th International Conference on Evolutionary Multi-Criterion Optimization
Year:
2009

Citing 12
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
The vehicle routing problem

The vehicle routing problem
A Diversity-Controlling Adaptive Genetic Algorithm for the Vehicle Routing Problem with Time Windows

ICTAI '03 Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence
On the influence of GVR in vehicle routing

Proceedings of the 2003 ACM symposium on Applied computing
A cooperative parallel meta-heuristic for the vehicle routing problem with time windows

Computers and Operations Research
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
Distance measures based on the edit distance for permutation-type representations

Journal of Heuristics
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
A fast and elitist multiobjective genetic algorithm: NSGA-II

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Vehicle Routing Problem with Time Windows is a complex combinatorial optimization problem which can be seen as a fusion of two well known sub-problems: the Travelling Salesman Problem and the Bin Packing Problem. Its main objective is to find the lowest-cost set of routes to deliver demand, using identical vehicles with limited capacity, to customers with fixed service time windows. In this paper, we consider the minimization of the number of routes and the total cost simultaneously. Although previous evolutionary studies have considered this problem, none of them has focused on the similarity of solutions in the population. We propose a method to measure route similarity and incorporate it into an evolutionary algorithm to solve the bi-objective VRPTW. We have applied this algorithm to a publicly available set of benchmark instances, resulting in solutions that are competitive or better than others previously published.