期刊
COMPUTERS & INDUSTRIAL ENGINEERING
卷 57, 期 1, 页码 277-286出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2008.11.028
关键词
Multiple depot vehicle scheduling; Iterated local search; Constraints satisfaction
资金
- French Ministry for Research and Education through a CIFRE [176/2004]
The multiple depot vehicle scheduling problem (MDVSP) is a well-known and important problem arising in public transport. Although many solution approaches have been published in the literature, algorithms using metaheuristics appeared only very recently (large neighborhood search and Tabu search). In this paper, we introduce an iterated local search algorithm for the MDVSP, incorporating a neighborhood schema called block moves, based on the notion of ejection chains. Using a set of benchmark instances, we show empirically that the proposed algorithm performs better than the best metaheuristics implemented so far and obtains high quality results within short computational times. (C) 2009 Published by Elsevier Ltd.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据