Decomposition approach to solve dial-a-ride problems using ant computing and constraint programming

Authors:
Broderick Crawford;Carlos Castro;Eric Monfroy;Claudio Cubillos
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;Pontificia Universidad Católica de Valparaíso, Chile
Venue:
BVAI'07 Proceedings of the 2nd international conference on Advances in brain, vision and artificial intelligence
Year:
2007

Citing 11
Cited 0

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
Principles of Constraint Programming

Principles of Constraint Programming
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem

Operations Research
A hybrid ant algorithm for the airline crew pairing problem

MICAI'06 Proceedings of the 5th Mexican international conference on Artificial Intelligence
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

In this paper we solve the Dial-A-Ride Problem (DARP). The main objective of the DARP is to minimize operation costs for renting pieces of work from the transportation service providers. The resolution approach considered in this work, starting from a network formulation of the DARP, decomposes the problemin two phases: Clustering andChaining. We model both phases like a Set Partitioning Problem (SPP) and solve them with an interesting sinergy between two different optimization methods: Ant Computing and Constraint Programming.