A hybrid PSO algorithm for the CVRP problem
碩士 === 大同大學 === 資訊經營學系(所) === 99 === The Capacitated Vehicle Routing Problem (CVRP) has been studied over five decades. The goal of CVRP is to minimize the total distance of the routes under the constraints of vehicles’ capacity. Because CVRP is one kind of NP-hard problems, a number of meta-heurist...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Published: |
2011
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/86233600381321172926 |