A Lagrangian Relaxation Based Heuristic for Vehicle Routing Problem
碩士 === 國立交通大學 === 運輸科技與管理學系 === 93 === Vehicle routing problem can be modeled by integer programming. However, as the problem size grows, the performance of the solution algorithms tend to unsatisfactory. According to the literature, set covering problem (SCP) is a good way to model many routing o...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2005
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/96299291130802296821 |