AbstractWe study a variation of the packing-delivery problem, which involves K distinct products, a single capacitated truck, and a fixed sequence of customer locations to be visited. We show that the non-split version of the problem is strongly polynomial solvable. For the split delivery case, we analyze the conditions of optimality and propose a local optimization algorithm with a computational complexity of O(n3log(n)). Based on 14,000 randomly generated test problems, a consistent performance improvement achieved by the proposed local optimization algorithm over that by the optimal non-split packing-delivery schedules is observed.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    On the multi-product packing-delivery problem with a fixed route


    Beteiligte:
    Liu, Shuguang (Autor:in) / Lei, Lei (Autor:in) / Park, Sunju (Autor:in)


    Erscheinungsdatum :

    2006-10-28


    Format / Umfang :

    11 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch






    Delivery vehicles for en route food product preparation

    GOLDBERG JOSHUA GOULED / GARDEN ALEXANDER JOHN / GOEL VAIBHAV et al. | Europäisches Patentamt | 2024

    Freier Zugriff

    EN ROUTE PRODUCT DELIVERY BY UNMANNED AERIAL VEHICLES

    MULHALL ALAN / BALZER ANDREAS / WOULFE MUIRIS | Europäisches Patentamt | 2019

    Freier Zugriff

    DELIVERY VEHICLES FOR EN ROUTE FOOD PRODUCT PREPARATION

    GOLDBERG JOSHUA GOULED / GARDEN ALEXANDER JOHN / GOEL VAIBHAV et al. | Europäisches Patentamt | 2021

    Freier Zugriff