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

BRODERICK CRAWFORD LABRIN, Carlos Castro, Eric Monfroy, Claudio Cubillos

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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 languageEnglish
Title of host publicationAdvances in Brain, Vision, and Artificial Intelligence - Second International Symposium, BVAI 2007, Proceedings
Pages448-457
Number of pages10
DOIs
StatePublished - 1 Dec 2007
Event2nd International Symposium on Brain, Vision, and Artificial Intelligence, BVAI 2007 - Naples, Italy
Duration: 10 Oct 200712 Oct 2007

Publication series

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

Conference

Conference2nd International Symposium on Brain, Vision, and Artificial Intelligence, BVAI 2007
CountryItaly
CityNaples
Period10/10/0712/10/07

Keywords

  • Ant colony optimization
  • Constraint programming
  • Dial-a-ride problem

Fingerprint Dive into the research topics of 'Decomposition approach to solve dial-a-ride problems using ant Computing and Constraint Programming'. Together they form a unique fingerprint.

Cite this