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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Set partitioning based heuristics for interactive routing


    Weitere Titelangaben:

    Heuristiken auf Satzzerlegungsbasis fuer die interaktive Leitwegfindung


    Beteiligte:
    Cullen, F.H. (Autor:in) / Jarvis, J.J. (Autor:in) / Ratliff, H.D. (Autor:in)

    Erschienen in:

    Networks ; 11 , 2 ; 125-143


    Erscheinungsdatum :

    1981


    Format / Umfang :

    19 Seiten, 8 Quellen



    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Print


    Sprache :

    Englisch






    Heuristics for the periodic capacitated arc routing problem

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


    Efficient Insertion Heuristics for Vehicle Routing and Scheduling Problems

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