The set of 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 (1971). 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.
Set partitioning based heuristics for interactive routing
Heuristiken auf Satzzerlegungsbasis fuer die interaktive Leitwegfindung
Networks ; 11 , 2 ; 125-143
1981
19 Seiten, 8 Quellen
Aufsatz (Zeitschrift)
Englisch
Heuristics for the periodic capacitated arc routing problem
Tema Archiv | 2005
|Efficient Insertion Heuristics for Vehicle Routing and Scheduling Problems
British Library Online Contents | 2004
|Efficient Insertion Heuristics for Vehicle Routing and Scheduling Problems
Online Contents | 2004
|