A comparison of techniques for solving the fleet size and mix vehicle routing problem
- 1 December 1984
- journal article
- research article
- Published by Springer Nature in OR Spectrum
- Vol. 6 (4) , 207-216
- https://doi.org/10.1007/bf01720070
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A Lagrangean relaxation heuristic for vehicle routingEuropean Journal of Operational Research, 1984
- The fleet size and mix vehicle routing problemComputers & Operations Research, 1984
- Routing and scheduling of vehicles and crewsComputers & Operations Research, 1983
- A generalized assignment heuristic for vehicle routingNetworks, 1981
- Approximate Traveling Salesman AlgorithmsOperations Research, 1980
- Implementing vehicle routing algorithmsNetworks, 1977
- A branch and bound algorithm for the generalized assignment problemMathematical Programming, 1975
- Scheduling of Vehicles from a Central Depot to a Number of Delivery PointsOperations Research, 1964