A farthest insertion heuristic algorithm for the distance-constrained capacitated vehicle routing problem
The vehicle routing problem (YRP) under distance and capacity constraints involves the design of a set of delivery routes which originate and terminate at a central depot after satisfying the customer demands . Each customer must be served exactly once and by one vehicle, where vehicle capacity and...
Saved in:
| Main Authors: | , |
|---|---|
| 格式: | Conference or Workshop Item |
| 語言: | English |
| 出版: |
2015
|
| 主題: | |
| 在線閱讀: | http://eprints.utm.my/id/eprint/61596/1/FarhanaJohar2015_AFarthestInsertionHeuristicAlgorithmfortheDistance-Constrained.pdf http://eprints.utm.my/id/eprint/61596/ |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|