A Simulated Annealing Heuristic for the Path Cover Problem with Time Windows
碩士 === 國立臺灣科技大學 === 工業管理系 === 105 === This research presents an extension of the Vehicle vehicle Routing routing Problem problem with Time time Wwindows (VRPTW), namely,called the path covering problem with time windows (PCPTW). In order to be more applicable in a real-world setting, this research p...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2017
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/94c928 |