A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem

Authors:
Abdellah El Fallahi;Christian Prins;Roberto Wolfler Calvo
Affiliations:
Institut Charles Delaunay, FRE CNRS 2848, Université de Technologie de Troyes, 12 Rue Marie Curie, BP 2060, 10010 Troyes, France;Institut Charles Delaunay, FRE CNRS 2848, Université de Technologie de Troyes, 12 Rue Marie Curie, BP 2060, 10010 Troyes, France;Institut Charles Delaunay, FRE CNRS 2848, Université de Technologie de Troyes, 12 Rue Marie Curie, BP 2060, 10010 Troyes, France
Venue:
Computers and Operations Research
Year:
2008

Citing 8
Cited 21

A study of permutation crossover operators on the traveling salesman problem

Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem

Annals of Operations Research - Special issue on Tabu search
A tabu search heuristic for the vehicle routing problem

Management Science
Memetic algorithms: a short introduction

New ideas in optimization
The vehicle routing problem

The vehicle routing problem
Tabu Search

Tabu Search
Solution of the Cumulative Assignment Problem With a Well-Structured TabuSearch Method

Journal of Heuristics
Context-Independent Scatter and Tabu Search for Permutation Problems

INFORMS Journal on Computing

Computing single source shortest paths using single-objective fitness

Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
Novel Memetic Algorithm for Protein Structure Prediction

AI '09 Proceedings of the 22nd Australasian Joint Conference on Advances in Artificial Intelligence
A guided local search procedure for the multi-compartment capacitated arc routing problem

Computers and Operations Research
A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands

Computers and Operations Research
Edge-based representation beats vertex-based representation in shortest path problems

Proceedings of the 12th annual conference on Genetic and evolutionary computation
Efficient frameworks for greedy split and new depth first search split procedures for routing problems

Computers and Operations Research
A GRASP with evolutionary path relinking for the truck and trailer routing problem

Computers and Operations Research
A new geometric shape-based genetic clustering algorithm for the multi-depot vehicle routing problem

Expert Systems with Applications: An International Journal
Constructive Heuristics for the Multicompartment Vehicle Routing Problem with Stochastic Demands

Transportation Science
Vehicle routing with compartments: applications, modelling and heuristics

OR Spectrum
Improved packing and routing of vehicles with compartments

EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part I
Development of a maritime transportation planning support system for car carriers based on genetic algorithm

Applied Intelligence
Variable Neighborhood Search heuristic for the Inventory Routing Problem in fuel delivery

Expert Systems with Applications: An International Journal
Parallel memetic structures

Information Sciences: an International Journal
Statistical analysis of distance-based path relinking for the capacitated vehicle routing problem

Computers and Operations Research
Survey of Green Vehicle Routing Problem: Past and future trends

Expert Systems with Applications: An International Journal
An ant colony algorithm for the multi-compartment vehicle routing problem

Applied Soft Computing
Region based memetic algorithm for real-parameter optimisation

Information Sciences: an International Journal
Experience with a framework for developing heuristics for solving rich vehicle routing problems

Journal of Heuristics
A hybrid genetic algorithm for the multi-depot open vehicle routing problem

OR Spectrum
A memetic algorithm for the capacitated m-ring-star problem

Applied Intelligence

Quantified Score

Hi-index	0.01

Visualization

Abstract

A generalization of the traditional vehicle routing problem (VRP) is studied in this paper. Each customer may order several products, the vehicles are identical and have several compartments, each compartment being dedicated to one product. The demand of each customer for a product must be entirely delivered by one single vehicle. However, the different products required by a customer may be brought by several vehicles. Two algorithms to solve this problem are proposed: a memetic algorithm with a post-optimization phase based on path relinking, and a tabu search method. These algorithms are evaluated by adding compartments to classical VRP instances.