期刊
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES
卷 14, 期 3, 页码 157-174出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.trc.2006.03.002
关键词
vehicle dispatching; real-time; tabu search; neighborhood; ejection chains; parallel computing
This paper proposes neighborhood search heuristics to optimize the planned routes of vehicles in a context where new requests, with a pick-up and a delivery location, occur in real-time. Within this framework, new solutions are explored through a neighborhood structure based on ejection chains. Numerical results show the benefits of these procedures in a real-time context. The impact of a master slave parallelization scheme, using an increasing number of processors, is also investigated. (c) 2006 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据