The author demonstrates that a heuristic which uses the space-filling curve introduces the possibility of using set partitioning in the general case of the vehicle routing problem. Up to now, set partitioning was used when the feasible routes were obtainable in well-defined applications. These routes either came predefined or were easily discernible. With this heuristic, a random field of nodes can be visited, with the feasible routes being generated in a reasonable amount of time.


    Zugriff

    Zugriff über TIB

    Verfügbarkeit in meiner Bibliothek prüfen


    Exportieren, teilen und zitieren



    Titel :

    Using space-filling curve to generate the feasible routes for the set partitioning problem


    Weitere Titelangaben:

    Anwendung der Raumerfuellungskurve zur Generierung moeglicher Wege fuer die Mengenunterteilung


    Beteiligte:


    Erscheinungsdatum :

    1988


    Format / Umfang :

    6 Seiten, 6 Quellen


    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Print


    Sprache :

    Englisch




    Studies Claim Space Tourism Feasible

    British Library Online Contents | 1997


    Partitioning sensor based data to generate driving pattern map

    PANDURANGARAO ANIL KUMAR | Europäisches Patentamt | 2023

    Freier Zugriff

    PARTITIONING SENSOR BASED DATA TO GENERATE DRIVING PATTERN MAP

    PANDURANGARAO ANIL KUMAR | Europäisches Patentamt | 2023

    Freier Zugriff

    Partitioning sensor based data to generate driving pattern map

    PANDURANGARAO ANIL KUMAR | Europäisches Patentamt | 2022

    Freier Zugriff

    PARTITIONING SENSOR BASED DATA TO GENERATE DRIVING PATTERN MAP

    PANDURANGARAO ANIL | Europäisches Patentamt | 2018

    Freier Zugriff