Evaluating a Sequential Vehicle Routing Algorithm
- 1 June 1977
- journal article
- research article
- Published by Taylor & Francis in A I I E Transactions
- Vol. 9 (2) , 204-208
- https://doi.org/10.1080/05695557708975144
Abstract
The Clarke-Wright algorithm is a heuristic algorithm which has been implemented frequently and successfully to solve large-scale vehicle routing problems. In this paper, we focus on evaluating the accuracy of the Clarke-Wright procedure in its sequential form. We present examples of pathological behavior and suggest algorithm modifications to help overcome these problems.Keywords
This publication has 8 references indexed in Scilit:
- Approaches to the Cutting Stock ProblemA I I E Transactions, 1976
- A Sequential Route-building Algorithm Employing a Generalised Savings CriterionJournal of the Operational Research Society, 1976
- Transportation Routing Problem—A SurveyA I I E Transactions, 1974
- Relative Performance of Some Sequential Methods of Planning Multiple Delivery JourneysJournal of the Operational Research Society, 1972
- A Computational Modification to the Savings Method of Vehicle SchedulingJournal of the Operational Research Society, 1970
- An Algorithm for the Vehicle-dispatching ProblemJournal of the Operational Research Society, 1969
- An Appraisal of Some Shortest-Path AlgorithmsOperations Research, 1969
- Scheduling of Vehicles from a Central Depot to a Number of Delivery PointsOperations Research, 1964