The Study of Lower Bound of Capacitated Arc Routing Problem
碩士 === 國立交通大學 === 運輸工程與管理系 === 87 === The Capacitated Arc Routing Problem (CARP) is a commonly seen problem in logistic. CARP finds a set of routes that serve each service edge exactly once while satisfying the capacity constraint.CARP was proved to be a NP-Hard problem. Thus, is difficul...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
1999
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/37183606308000649687 |