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/ |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|
成为第一个发表评论!