Solving Multi-Compartments Vehicle Routing Problems by Genetic Search
碩士 === 南台科技大學 === 工業管理研究所 === 95 === In this study, we consider the multi-compartments vehicle routing problem. In addition to the classical capacity and time-window constraints, this problem also has compartment, compatibility, and assignment constraints. It is not only an NP-hard problem in strong...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2006
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/68793523230578669393 |