The Research of the Solution of Multi-Vehicle Routing Problems with Time Windows
碩士 === 元智大學 === 工業工程研究所 === 86 === The vehicle routing problem (VRP) is a kind of NP-Hard problem.It takes a lot of operational time to find optimal solutions of VRP. All known algorithms for solving these problems require a number of computations which grow exponent...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Online Access: | http://ndltd.ncl.edu.tw/handle/10889980946296104243 |