A concurrent evolutionary approach for rich combinatorial optimization

Authors:
Teodor Gabriel Crainic;Gloria Cerasela Crisan;Michel Gendreau;Nadia Lahrichi;Walter Rei
Affiliations:
U.Q.A.M., Montreal, PQ, Canada;U.Q.A.M., Montreal, PQ, Canada;Université de Montréal, Montreal, PQ, Canada;U.Q.A.M., Montreal, PQ, Canada;U.Q.A.M., Montreal, PQ, Canada
Venue:
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
Year:
2009

Citing 5
Cited 1

The vehicle routing problem

The vehicle routing problem
Routing vehicles in the real world: applications in the solid waste, beverage, food, dairy, and newspaper industries

The vehicle routing problem
Parallel Metaheuristics: A New Class of Algorithms

Parallel Metaheuristics: A New Class of Algorithms
An exact algorithm for multi depot and multi period vehicle scheduling problem

ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
Tackling electrosmog in completely configured 3G networks by parallel cooperative meta-heuristics

IEEE Wireless Communications

Spatial, temporal, and hybrid decompositions for large-scale vehicle routing with time windows

CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a meta-heuristic method based on the concurrent evolution of heterogeneous populations, decomposition/recomposition principles and specialized operators to address multi-attribute, rich, combinatorial optimization problems. We illustrate the method through an application to a rich Vehicle Routing Problem that considers duration and capacity constraints as well as time windows, multiple periods and multiple depots.