A Two-Phase Scheduling Method Combined to the Tabu Search for the DARP
International Journal of Applied Metaheuristic Computing · 2014
DOI: 10.4018/ijamc.2014040101 ↗Kurz gefasst
Fachartikel in der Zeitschrift International Journal of Applied Metaheuristic Computing, 2014. Verfasst von Ali Lemouari und 1 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 38 Literaturangaben.
Abstract (Originalsprache)
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.
Zitieren
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. https://doi.org/10.4018/ijamc.2014040101
Vancouver
Lemouari A, Guemri O. A Two-Phase Scheduling Method Combined to the Tabu Search for the DARP. International Journal of Applied Metaheuristic Computing. 2014. doi:10.4018/ijamc.2014040101
BibTeX
@article{Lemouari2014,
author = {Lemouari, Ali and Guemri, Oualid},
title = {A Two-Phase Scheduling Method Combined to the Tabu Search for the DARP},
journal = {International Journal of Applied Metaheuristic Computing},
year = {2014},
doi = {10.4018/ijamc.2014040101}
}
EUVIMED