@inproceedings{bee269415ac046c69fd4df155959ce0c,
title = "Decomposition approach to solve dial-a-ride problems using ant Computing and Constraint Programming",
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 problem in two phases: Clustering and Chaining. 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.",
keywords = "Ant colony optimization, Constraint programming, Dial-a-ride problem",
author = "Broderick Crawford and Carlos Castro and Eric Monfroy and Claudio Cubillos",
year = "2007",
doi = "10.1007/978-3-540-75555-5_43",
language = "English",
isbn = "3540755543",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "448--457",
booktitle = "Advances in Brain, Vision, and Artificial Intelligence - Second International Symposium, BVAI 2007, Proceedings",
note = "null ; Conference date: 10-10-2007 Through 12-10-2007",
}