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 |
---|---|
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2015
|
Subjects: | |
Online Access: | http://eprints.utm.my/id/eprint/61596/1/FarhanaJohar2015_AFarthestInsertionHeuristicAlgorithmfortheDistance-Constrained.pdf http://eprints.utm.my/id/eprint/61596/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Ant colony optimization algorithm for distance-constrained capacitated vehicle routing problem
by: Johar, Farhana, et al.
Published: (2018) -
Generating an initial solution for capacitated vehicle routing problem by using sequential insertion algorithm
by: Tan, Chai Fei, et al.
Published: (2015) -
Ant colony algorithm for capacitated vehicle routing problem
by: Johar, Farhana, et al.
Published: (2018) -
Ant system with heuristics for capacitated vehicle routing problem
by: Tan, Wen Fang
Published: (2013) -
Distance based sweep nearest algorithm to solve capacitated vehicle routing problem
by: Akhand, M. A. H, et al.
Published: (2016)