A Two-Phase Scheduling Method Combined to the Tabu Search for the DARP

Ali Lemouari and Oualid Guemri
Additional contact information
Ali Lemouari: University of Jijel, Jijel, Algeria
Oualid Guemri: University of Jijel, Jijel, Algeria

International Journal of Applied Metaheuristic Computing (IJAMC), 2014, vol. 5, issue 2, 1-21

Abstract: The dial-a-ride problem (DARP), is a variant of the pickup and delivery problem (PDP), consists of designing vehicle routes of n customers transportation requests. The problem arises in many transportation applications, like door-to-door transportation services for elderly and disabled people or in services for patients. This paper consider a static multivehicle DARP, which the objective is to minimize a combined costs of total travel distance, total duration, passengers waiting time, the excess ride time of customers, and the early arrival time while respecting maximum route duration limit, the maximum costumer ride time limit, the capacity and the time window constraint. The authors propose a two-phase scheduling method combined to the tabu search heuristic, for the static multivehicle DARP. Their experimentation report best results for Cordeau Benchmark test problem, compared to reported results.

Date: 2014
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 018/ijamc.2014040101 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:igg:jamc00:v:5:y:2014:i:2:p:1-21

Access Statistics for this article

International Journal of Applied Metaheuristic Computing (IJAMC) is currently edited by Peng-Yeng Yin

More articles in International Journal of Applied Metaheuristic Computing (IJAMC) from IGI Global
Bibliographic data for series maintained by Journal Editor ().