Two-phase heuristic for capacitated vehicle routing problem
文献类型：会议论文
| 作者 | Shen H(申海); Zhu YL(朱云龙) ; Jin L(金莉); Zou WP(邹文平)
|
| 出版日期 | 2010 |
| 会议名称 | 2010 2nd World Congress on Nature and Biologically Inspired Computing, NaBIC 2010 |
| 会议日期 | December 15-17, 2010 |
| 会议地点 | Kitakyushu, Japan |
| 关键词 | Computational complexity Encoding (symbols) Global optimization Optimization Routing algorithms Vehicles |
| 页码 | 534-539 |
| 中文摘要 | Vehicle Routing Problem (VRP) is a NP-complete problem and has important practical value. The Capacitated Vehicle Routing Problem (CVRP) constrained by the capacity of a vehicle is the extension of VRP. In this paper, a two-phase heuristic to address CVRP is proposed. The proposed heuristic has two stages. First, search feasible solution in the global scope using GA. Second, employ local search method to seeking the c1ose-to-optimal solution in local scope. Through combining the global optimization ability of GA with the probability sudden jumping of local search algorithm, two-phase heuristic can solve the CVRP effectively. Furthermore, a set of well-known benchmarks were utilized to verify the performance of the proposed heuristic. The experimental results show that the best-so-far solution of the most of the test instances can be found. |
| 收录类别 | EI |
| 产权排序 | 1 |
| 会议录 | Proceedings - 2010 2nd World Congress on Nature and Biologically Inspired Computing, NaBIC 2010
 |
| 会议录出版者 | IEEE Computer Society |
| 会议录出版地 | Piscataway, NJ |
| 语种 | 英语 |
| ISBN号 | 978-1-4244-7376-2 |
| 源URL | [http://ir.sia.cn/handle/173321/8428]  |
| 专题 | 沈阳自动化研究所_工业信息学研究室 |
| 推荐引用方式 GB/T 7714 | Shen H,Zhu YL,Jin L,et al. Two-phase heuristic for capacitated vehicle routing problem[C]. 见:2010 2nd World Congress on Nature and Biologically Inspired Computing, NaBIC 2010. Kitakyushu, Japan. December 15-17, 2010. |
入库方式： OAI收割
来源：沈阳自动化研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。