Improved Ant Colony Optimization Algorithm for vehicle routing problem with time windows
碩士 === 大同大學 === 資訊經營學系(所) === 101 === Vehicle routing problems with time window (VRPTW) is a combinatorial optimization problem. The goal of Vehicle routing problems with time window is to minimize the total distance of the routes under the constraints of vehicle’s capacity and customer’s time windo...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2013
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/23604193606492595887 |