In *Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)*, volume 4729 LNCS, pages 448-457, 2007.

doi abstract bibtex

doi abstract bibtex

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. © 2007 Springer-Verlag Berlin Heidelberg.

@inproceedings{10.1007/978-3-540-75555-5_43, 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. © 2007 Springer-Verlag Berlin Heidelberg.", year = "2007", title = "Decomposition approach to solve dial-a-ride problems using ant Computing and Constraint Programming", volume = "4729 LNCS", pages = "448-457", doi = "10.1007/978-3-540-75555-5\_43", booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)" }

Downloads: 0