TY - GEN
T1 - Decomposition approach to solve dial-a-ride problems using ant Computing and Constraint Programming
AU - Crawford, Broderick
AU - Castro, Carlos
AU - Monfroy, Eric
AU - Cubillos, Claudio
PY - 2007
Y1 - 2007
N2 - 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.
AB - 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.
KW - Ant colony optimization
KW - Constraint programming
KW - Dial-a-ride problem
UR - http://www.scopus.com/inward/record.url?scp=49949104447&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-75555-5_43
DO - 10.1007/978-3-540-75555-5_43
M3 - Conference contribution
AN - SCOPUS:49949104447
SN - 3540755543
SN - 9783540755548
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 448
EP - 457
BT - Advances in Brain, Vision, and Artificial Intelligence - Second International Symposium, BVAI 2007, Proceedings
T2 - 2nd International Symposium on Brain, Vision, and Artificial Intelligence, BVAI 2007
Y2 - 10 October 2007 through 12 October 2007
ER -