https://scholars.lib.ntu.edu.tw/handle/123456789/612266
標題: | Novel Ant Colony Optimization Methods for Simplifying Solution Construction in Vehicle Routing Problems | 作者: | Wang X. TSAN MING CHOI Liu H. Yue X. |
關鍵字: | Ant colony optimization (ACO); feasible solutions; paths; saving algorithm; vehicle routing problem (VRP) | 公開日期: | 2016 | 出版社: | Institute of Electrical and Electronics Engineers Inc. | 卷: | 17 | 期: | 11 | 起(迄)頁: | 3132-3141 | 來源出版物: | IEEE Transactions on Intelligent Transportation Systems | 摘要: | As a novel evolutionary searching technique, ant colony optimization (ACO) has gained wide research attention and can be used as a tool for optimizing an array of mathematical functions. In transportation systems, when ACO is applied to solve the vehicle routing problem (VRP), the path of each ant is only "part" of a feasible solution. In other words, multiple ants' paths may constitute one feasible solution. Previous works mainly focus on the algorithm itself, such as revising the pheromone updating scheme and combining ACO with other optimization methods. However, this body of literature ignores the important procedure of constructing feasible solutions with those "parts". To overcome this problem, this paper presents a novel ACO algorithm (called AMR) to solve the VRP. The proposed algorithm allows ants to go in and out the depots more than once until they have visited all customers, which simplifies the procedure of constructing feasible solutions. To further enhance AMR, we propose two extensions (AMR-SA and AMR-SA-II) by integrating AMR with other saving algorithms. The computational results for standard benchmark problems are reported and compared with those from other ACO methods. Experimental results indicate that the proposed algorithms outperform the existing ACO algorithms. ? 2016 IEEE. |
URI: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-84994504382&doi=10.1109%2fTITS.2016.2542264&partnerID=40&md5=55b2f52f5cbc06352da77d187cbc3bb2 https://scholars.lib.ntu.edu.tw/handle/123456789/612266 |
DOI: | 10.1109/TITS.2016.2542264 | SDG/關鍵字: | Artificial intelligence; Functions; Optimization; Vehicle routing; Vehicles; Ant Colony Optimization (ACO); Feasible solution; paths; Saving algorithm; Vehicle routing problem; Ant colony optimization |
顯示於: | 工商管理學系 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。