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: | Chai, Jin Sian, Johar, Farhana |
---|---|
格式: | 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/ |
标签: |
添加标签
没有标签, 成为第一个标记此记录!
|
相似书籍
-
Ant colony optimization algorithm for distance-constrained capacitated vehicle routing problem
由: Johar, Farhana, et al.
出版: (2018) -
Generating an initial solution for capacitated vehicle routing problem by using sequential insertion algorithm
由: Tan, Chai Fei, et al.
出版: (2015) -
Ant colony algorithm for capacitated vehicle routing problem
由: Johar, Farhana, et al.
出版: (2018) -
Ant system with heuristics for capacitated vehicle routing problem
由: Tan, Wen Fang
出版: (2013) -
Distance based sweep nearest algorithm to solve capacitated vehicle routing problem
由: Akhand, M. A. H, et al.
出版: (2016)