Multi-thread integrative cooperative optimization for rich combinatorial problems

Authors:
Teodor Gabriel Crainic;Gloria Cerasela Crisan;Michel Gendreau;Nadia Lahrichi;Walter Rei
Affiliations:
École des sciences de la gestion, U.Q.A.M., Département de management et technologie, Canada;École des sciences de la gestion, U.Q.A.M., Département de management et technologie, Canada;Université de Montréal, Département d'informatique et de recherche opérationnelle, Canada;École des sciences de la gestion, U.Q.A.M., Département de management et technologie, Canada;École des sciences de la gestion, U.Q.A.M., Département de management et technologie, Canada
Venue:
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
Year:
2009

Citing 0
Cited 3

A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems

Operations Research
A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows

Computers and Operations Research
Parallel ACO with a Ring Neighborhood for Dynamic TSP

Journal of Information Technology Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Addressing multi-attribute, “rich” combinatorial optimization problems in a comprehensive manner presents significant methodological and computational challenges. In this paper, we present an integrative multi-thread cooperative optimization framework that can simultaneously deal with multiple dimensions of a rich problem. We present the basic concepts and detail the design and operating principles of the methodology. We illustrate the framework on a rich combinatorial problem, an extended version of the vehicle routing problem with the duration and capacity constraints as well as time windows, multiple periods and multiple depots.