Improving the search of near-optimal solution of vehicle routine problems with parallelable modified algorithms
碩士 === 國立中山大學 === 應用數學系研究所 === 105 === We consider finding the near-optimized solution of logistic''s vehicle routing problem includes grouping of customers and travelling salesman problem. We try to balance the number of customers for each vehicle. According to k-mean...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2017
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/ar6nws |