Multiple Trajectory Search for Multi-objective Vehicle Routing Problem with Time Windows
碩士 === 國立中興大學 === 資訊科學與工程學系所 === 100 === The vehicle routing problem with time windows is an NP-hard problem. When the scale of the problem is large, it is very difficult to find the optimal solution within limited time. Therefore, meta-heuristic algorithms are good candidate for solving this proble...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2012
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/51180220788643637561 |