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

International Journal of Applied Metaheuristic Computing(2014)

引用 1|浏览3
暂无评分
摘要
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.
更多
查看译文
关键词
Dial-A-Ride Problem, Genetic Algorithm, Scheduling Method, Tabu Search, Variable Neighborhood Search
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要