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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Set partitioning based heuristics for interactive routing


    Additional title:

    Heuristiken auf Satzzerlegungsbasis fuer die interaktive Leitwegfindung


    Contributors:
    Cullen, F.H. (author) / Jarvis, J.J. (author) / Ratliff, H.D. (author)

    Published in:

    Networks ; 11 , 2 ; 125-143


    Publication date :

    1981


    Size :

    19 Seiten, 8 Quellen



    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English






    Heuristics for the periodic capacitated arc routing problem

    Chu, Feng / Labadi, Nacima / Prins, Christian | Tema Archive | 2005


    Interactive Routing

    DE ROCHA ROSARIO DANIEL / STIEHL KURT R / ALLEN MATTHEW J et al. | European Patent Office | 2024

    Free access

    Efficient Insertion Heuristics for Vehicle Routing and Scheduling Problems

    Campbell, A. M. / Savelsbergh, M. | British Library Online Contents | 2004