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

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

Ali Lemouari, Oualid Guemri
Copyright: © 2014 |Volume: 5 |Issue: 2 |Pages: 21
ISSN: 1947-8283|EISSN: 1947-8291|EISBN13: 9781466652620|DOI: 10.4018/ijamc.2014040101
Cite Article Cite Article

MLA

Lemouari, Ali, and Oualid Guemri. "A Two-Phase Scheduling Method Combined to the Tabu Search for the DARP." IJAMC vol.5, no.2 2014: pp.1-21. http://doi.org/10.4018/ijamc.2014040101

APA

Lemouari, A. & Guemri, O. (2014). A Two-Phase Scheduling Method Combined to the Tabu Search for the DARP. International Journal of Applied Metaheuristic Computing (IJAMC), 5(2), 1-21. http://doi.org/10.4018/ijamc.2014040101

Chicago

Lemouari, Ali, and Oualid Guemri. "A Two-Phase Scheduling Method Combined to the Tabu Search for the DARP," International Journal of Applied Metaheuristic Computing (IJAMC) 5, no.2: 1-21. http://doi.org/10.4018/ijamc.2014040101

Export Reference

Mendeley
Favorite Full-Issue Download

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.