Ant colony system for optimizing vehicle routing problem with time windows (VRPTW)
- Authors
- Tan, Xuan; Zhuo, Xiaolan; Zhang, Jun
- Issue Date
- Aug-2006
- Publisher
- Springer Verlag
- Citation
- Computational Intelligence and Bioinformatics International Conference on Intelligent Computing, ICIC 2006, Kunming, China, August 16-19, 2006, Proceedings, Part III, v.4115 , pp 33 - 38
- Pages
- 6
- Indexed
- SCI
SCOPUS
- Journal Title
- Computational Intelligence and Bioinformatics International Conference on Intelligent Computing, ICIC 2006, Kunming, China, August 16-19, 2006, Proceedings, Part III
- Volume
- 4115
- Start Page
- 33
- End Page
- 38
- URI
- https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/117823
- DOI
- 10.1007/11816102_4
- Abstract
- Research on the optimization of Vehicle Routing Problem with Time Windows (VRPTW) is a significant investigation area of ant colony system (ACS). This paper proposes an enhanced ACS, which embeds the sequential insertion heuristic method, to solve VRPTW. The main idea is to organize two respective ant colonies to successively achieve a multiple objective minimization. Experiments on a series of benchmark problems demonstrate the excellent performance of ACS when compared with other optimization methods. © Springer-Verlag Berlin Heidelberg 2006.
- Files in This Item
-
Go to Link
- Appears in
Collections - COLLEGE OF ENGINEERING SCIENCES > SCHOOL OF ELECTRICAL ENGINEERING > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.