An Ant Colony Algorithm for the Capacitated Vehicle Routing |
| |
| Institution: | 1. School of Information Science and Engineering, Wuhan University of Science and Technology, Wuhan 430081, China;2. School of Mechanical Engineering, University of Shanghai for Science and Technology, Shanghai 200093, China;3. School of Mechanical Science and Engineering, Huazhong University of Science and Technology, Wuhan 430074, China |
| |
| Abstract: | The Vehicle Routing Problem (VRP) requires the determination of an optimal set of routes for a set of vehicles to serve a set of customers. We deal here with the Capacitated Vehicle Routing Problem (CVRP) where there is a maximum weight or volume that each vehicle can load. We developed an Ant Colony algorithm (ACO) for the CVRP based on the metaheuristic technique introduced by Colorni, Dorigo and Maniezzo. We present preliminary results that show that ant algorithms are competitive with other metaheuristics for solving CVRP. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
