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

Broderick Crawford, Carlos Castro, Eric Monfroy, Claudio Cubillos

Resultado de la investigación: Capítulo del libro/informe/acta de congresoContribución a la conferenciarevisión exhaustiva

3 Citas (Scopus)

Resumen

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.

Idioma originalInglés
Título de la publicación alojadaAdvances in Brain, Vision, and Artificial Intelligence - Second International Symposium, BVAI 2007, Proceedings
Páginas448-457
Número de páginas10
DOI
EstadoPublicada - 2007
Publicado de forma externa
Evento2nd International Symposium on Brain, Vision, and Artificial Intelligence, BVAI 2007 - Naples, Italia
Duración: 10 oct. 200712 oct. 2007

Serie de la publicación

NombreLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volumen4729 LNCS
ISSN (versión impresa)0302-9743
ISSN (versión digital)1611-3349

Conferencia

Conferencia2nd International Symposium on Brain, Vision, and Artificial Intelligence, BVAI 2007
País/TerritorioItalia
CiudadNaples
Período10/10/0712/10/07

Huella

Profundice en los temas de investigación de 'Decomposition approach to solve dial-a-ride problems using ant Computing and Constraint Programming'. En conjunto forman una huella única.

Citar esto