Decomposition approach to solve dial-a-ride problems using ant Computing and Constraint Programming

Broderick Crawford; Carlos Castro; Eric Monfroy; Claudio Cubillos

doi:10.1007/978-3-540-75555-5_43

Decomposition approach to solve dial-a-ride problems using ant Computing and Constraint Programming

Broderick Crawford, Carlos Castro, Eric Monfroy, Claudio Cubillos

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

3 Scopus citations

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.

Original language	English
Title of host publication	Advances in Brain, Vision, and Artificial Intelligence - Second International Symposium, BVAI 2007, Proceedings
Pages	448-457
Number of pages	10
DOIs	https://doi.org/10.1007/978-3-540-75555-5_43
State	Published - 2007
Externally published	Yes
Event	2nd International Symposium on Brain, Vision, and Artificial Intelligence, BVAI 2007 - Naples, Italy Duration: 10 Oct 2007 → 12 Oct 2007

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4729 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	2nd International Symposium on Brain, Vision, and Artificial Intelligence, BVAI 2007
Country/Territory	Italy
City	Naples
Period	10/10/07 → 12/10/07

Keywords

Ant colony optimization
Constraint programming
Dial-a-ride problem

Access to Document

10.1007/978-3-540-75555-5_43

Cite this

Crawford, B., Castro, C., Monfroy, E., & Cubillos, C. (2007). Decomposition approach to solve dial-a-ride problems using ant Computing and Constraint Programming. In Advances in Brain, Vision, and Artificial Intelligence - Second International Symposium, BVAI 2007, Proceedings (pp. 448-457). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4729 LNCS). https://doi.org/10.1007/978-3-540-75555-5_43

Crawford, Broderick ; Castro, Carlos ; Monfroy, Eric et al. / Decomposition approach to solve dial-a-ride problems using ant Computing and Constraint Programming. Advances in Brain, Vision, and Artificial Intelligence - Second International Symposium, BVAI 2007, Proceedings. 2007. pp. 448-457 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@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",

}

Crawford, B, Castro, C, Monfroy, E & Cubillos, C 2007, Decomposition approach to solve dial-a-ride problems using ant Computing and Constraint Programming. in Advances in Brain, Vision, and Artificial Intelligence - Second International Symposium, BVAI 2007, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4729 LNCS, pp. 448-457, 2nd International Symposium on Brain, Vision, and Artificial Intelligence, BVAI 2007, Naples, Italy, 10/10/07. https://doi.org/10.1007/978-3-540-75555-5_43

Decomposition approach to solve dial-a-ride problems using ant Computing and Constraint Programming. / Crawford, Broderick; Castro, Carlos; Monfroy, Eric et al.

Advances in Brain, Vision, and Artificial Intelligence - Second International Symposium, BVAI 2007, Proceedings. 2007. p. 448-457 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4729 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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

Y2 - 10 October 2007 through 12 October 2007

ER -

Crawford B, Castro C, Monfroy E, Cubillos C. Decomposition approach to solve dial-a-ride problems using ant Computing and Constraint Programming. In Advances in Brain, Vision, and Artificial Intelligence - Second International Symposium, BVAI 2007, Proceedings. 2007. p. 448-457. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-540-75555-5_43

Decomposition approach to solve dial-a-ride problems using ant Computing and Constraint Programming

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this