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: | , |
---|---|
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!
|