Solving Dial-a-Ride Problems with a Low-Level Hybridization of Ants and Constraint Programming

Authors:
Broderick Crawford;Carlos Castro;Eric Monfroy
Affiliations:
Pontificia Universidad Católica de Valparaíso, Chile and Universidad Técnica Federico Santa María, Valparaíso, Chile;Universidad Técnica Federico Santa María, Valparaíso, Chile;Universidad Técnica Federico Santa María, Valparaíso, Chile and LINA, Université de Nantes, France
Venue:
IWINAC '07 Proceedings of the 2nd international work-conference on Nature Inspired Problem-Solving Methods in Knowledge Engineering: Interplay Between Natural and Artificial Computation, Part II
Year:
2007

Citing 15
Cited 0

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

Operations Research
Ant algorithms for discrete optimization

Artificial Life
Backjump-based backtracking for constraint satisfaction problems

Artificial Intelligence
Constraint Handling in Genetic Algorithms: The Set Partitioning Problem

Journal of Heuristics
The Query Clustering Problem: A Set Partitioning Approach

IEEE Transactions on Knowledge and Data Engineering
An Island Model Based Ant System with Lookahead for the Shortest Supersequence Problem

PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
An Ant-Based Framework for Very Strongly Constrained Problems

ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
A Set-Partitioning-Based Heuristic for the Vehicle Routing Problem

INFORMS Journal on Computing
Ant Colony Optimization

Ant Colony Optimization
A Two-Phase Genetic and Set Partitioning Approach for the Vehicle Routing Problem with Time Windows

HIS '04 Proceedings of the Fourth International Conference on Hybrid Intelligent Systems
Ant Colony Optimization and Swarm Intelligence: 5th International Workshop, ANTS 2006, Brussels, Belgium, September 4-7, 2006, Proceedings (Lecture Notes in Computer Science)

Ant Colony Optimization and Swarm Intelligence: 5th International Workshop, ANTS 2006, Brussels, Belgium, September 4-7, 2006, Proceedings (Lecture Notes in Computer Science)
Principles of Constraint Programming

Principles of Constraint Programming
A unified view on hybrid metaheuristics

HM'06 Proceedings of the Third international conference on Hybrid Metaheuristics
Integrating lookahead and post processing procedures with ACO for solving set partitioning and covering problems

ICAISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Soft Computing
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is about Set Partitioning formulation and resolution for a particular case of VRP, the Dial-a-ride Problem. Set Partitioning has demonstrated to be useful modeling this problem and others very visible and economically significant problems. But the main disadvantage of this model is the need to explicitly generate a large set of possibilities to obtain good solutions. Additionally, in many cases a prohibitive time is needed to find the exact solution. Nowadays, many efficient metaheuristic methods have been developed to make possible a good solution in a reasonable amount of time. In this work we try to solve it with Low-level Hybridizations of Ant Colony Optimization and Constraint Programming techniques helping the construction phase of the ants. Computational results solving some benchmark instances are presented showing the advantages of using this kind of hybridization.