## Abstract We consider a common variant of the vehicle routing problem in which a vehicle fleet delivers products stored at a central depot to satisfy customer orders. Each vehicle has a fixed capacity, and each order uses a fixed portion of vehicle capacity. The routing decision involves determin
β¦ LIBER β¦
A Lagrangean relaxation heuristic for vehicle routing
β Scribed by William R. Stewart Jr.; Bruce L. Golden
- Publisher
- Elsevier Science
- Year
- 1984
- Tongue
- English
- Weight
- 345 KB
- Volume
- 15
- Category
- Article
- ISSN
- 0377-2217
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A generalized assignment heuristic for v
β
Marshall L. Fisher; Ramchandran Jaikumar
π
Article
π
1981
π
John Wiley and Sons
π
English
β 742 KB
A practical heuristic for a large scale
β
Anirudh Raghavendra; T.S. Krishnakumar; R. Muralidhar; D. Sarvanan; B.G. Raghave
π
Article
π
1992
π
Elsevier Science
π
English
β 472 KB
Lagrangean decomposition/relaxation for
β
Babacar Thiongane
π
Article
π
2011
π
John Wiley and Sons
π
English
β 220 KB
A tabu search heuristic for the multi-de
β
Jacques Renaud; Gilbert Laporte; Fayez F. Boctor
π
Article
π
1996
π
Elsevier Science
π
English
β 605 KB
A tabu search heuristic for periodic and
β
Cordeau, Jean-FranοΏ½ois; Gendreau, Michel; Laporte, Gilbert
π
Article
π
1997
π
John Wiley and Sons
π
English
β 142 KB
π 1 views
We propose a tabu search heuristic capable of solving three well-known routing problems: the periodic vehicle routing problem, the periodic traveling salesman problem, and the multi-depot vehicle routing problem. Computational experiments carried out on instances taken from the literature indicate t
A branch-and-regret heuristic for stocha
β
Lars Magnus Hvattum; Arne LΓΈkketangen; Gilbert Laporte
π
Article
π
2007
π
John Wiley and Sons
π
English
β 184 KB