Set partitioning based heuristics for interactive routing
- 1 June 1981
- Vol. 11 (2) , 125-143
- https://doi.org/10.1002/net.3230110206
Abstract
The set partitioning model is used as the basis for an interactive approach for solving a broad class of routing problems. A pricing mechanism is developed which can be used with a variety of methods in generating improving solutions. A version of the approach for delivery problems has been implemented via a colorgraphics display. The human aided optimization procedure was tested on the standard 50‐point, 75‐point, and 100‐point test problems of Eilon, Watson‐Gandy, and Christofides [6]. In the case of the first two test problems, the procedure was able to generate the best known solutions. In the 100‐point problem, a better solution was generated than the current best known solution.Keywords
This publication has 5 references indexed in Scilit:
- Technical Note—An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side ConditionsOperations Research, 1977
- Set Partitioning: A surveySIAM Review, 1976
- Scheduling of Vehicles from a Central Depot to a Number of Delivery PointsOperations Research, 1964
- On an Integer Program for a Delivery ProblemOperations Research, 1964
- A Model for the Optimal Programming of Railway Freight Train MovementsManagement Science, 1956