期刊
EXPERT SYSTEMS WITH APPLICATIONS
卷 37, 期 2, 页码 1620-1627出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.eswa.2009.06.047
关键词
Capacitated vehicle routing problem; Iterated local search; Variable neighborhood descent; Perturbation
类别
资金
- National Basic Research Program (973 program) of China [2006CB7055000]
The capacitated vehicle routing problem (CVRP) aims to determine the minimum total cost routes for a fleet of homogeneous vehicles to serve a set of customers A wide spectrum of applications outlines the relevance of this problem. in this paper, a hybrid heuristic method IVND with variable neighborhood descent based on multi operator optimization is proposed for solving the CVRP A perturbation strategy has been designed by cross-exchange operator to help optimization escape from local minima The performance of our algorithm has been tested on 34 CVRP benchmark problems and it shows that the proposed IVND performs well and is quite competitive with other state-of-the-art heuristics. Additionally, the proposed IVND is flexible and problem dependent, as well as easy to implement. (C) 2009 Elsevier Ltd. All rights reserved
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据