A Discrete BFO Algorithm for Capacitated Vehicle Routing Problems
碩士 === 大同大學 === 資訊經營學系(所) === 100 === Vehicle routing problems (VRP) becomes more and more important in modern logistics management. The goal of capacitated vehicle routing problems (CVRP) is to minimize the total distance of the routes under the constraints of vehicle’s capacity, in order to save c...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2012
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/07773083773105189164 |