Two exact algorithms for the distance‐constrained vehicle routing problem
- 1 March 1984
- Vol. 14 (1) , 161-172
- https://doi.org/10.1002/net.3230140113
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Classification in vehicle routing and schedulingNetworks, 1981
- A generalized assignment heuristic for vehicle routingNetworks, 1981
- State‐space relaxation procedures for the computation of bounds to routing problemsNetworks, 1981
- A Cutting Planes Algorithm for the m-Salesmen ProblemJournal of the Operational Research Society, 1980
- An approach for solving a class of transportation scheduling problemsEuropean Journal of Operational Research, 1979
- Implementing vehicle routing algorithmsNetworks, 1977
- A Sequential Route-building Algorithm Employing a Generalised Savings CriterionJournal of the Operational Research Society, 1976
- An Algorithm for the Vehicle-dispatching ProblemJournal of the Operational Research Society, 1969
- Direct search algorithms for truck-dispatching problemsTransportation Research, 1969
- Bases for Vehicle Fleet SchedulingJournal of the Operational Research Society, 1967