Idioma:

A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem

Berbeglia, Gerardo ; Cordeau, Jean-Francois ; Laporte, Gilbert

INFORMS journal on computing, 2012-06, Vol.24 (3), p.343-355 [Periódico revisado por pares]

Texto completo disponível

Citações Citado por

Título:
A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem
Autor: Berbeglia, Gerardo ; Cordeau, Jean-Francois ; Laporte, Gilbert
Assuntos: Algorithms ; constraint programming ; dial-a-ride problem ; dynamic ; Heuristic ; Heuristic programming ; Real time ; scheduling ; Search theory ; Studies ; tabu search
É parte de: INFORMS journal on computing, 2012-06, Vol.24 (3), p.343-355
Descrição: This paper introduces a hybrid algorithm for the dynamic dial-a-ride problem in which service requests arrive in real time. The hybrid algorithm combines an exact constraint programming algorithm and a tabu search heuristic. An important component of the tabu search heuristic consists of three scheduling procedures that are executed sequentially. Experiments show that the constraint programming algorithm is sometimes able to accept or reject incoming requests, and that the hybrid method outperforms each of the two algorithms when they are executed alone.
Editor: Linthicum: INFORMS
Idioma: Inglês

Voltar para lista de resultados