The location-routing problem with multi-compartment and multi-trip is an extension to the standard location-routing problem. In this problem, depots are used to deliver different products using heterogeneous vehicles with several compartments. Each compartment has a limited capacity and is dedicated to a single type of product. The problem is formulated as a mixed integer program. A constructive heuristic and a hybrid genetic algorithm (HGA) are proposed. Numerical experiments show that both heuristics can efficiently determine the optimal solutions on small size instances. For larger ones, the HGA outperforms the constructive heuristic with relatively more computational time. Managerial insights have been obtained from sensitivity analyses which would be helpful to improve the performance of the supply network.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    The location-routing problem with multi-compartment and multi-trip: formulation and heuristic approaches


    Beteiligte:
    Moon, Ilkyeong (Autor:in) / Salhi, Said (Autor:in) / Feng, Xuehao (Autor:in)

    Erschienen in:

    Erscheinungsdatum :

    2020-01-01


    Format / Umfang :

    28 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Unbekannt




    The Multi-Compartment Vehicle Routing Problem with Flexible Compartment Sizes

    Henke, Tino / Speranza, M. Grazia / Wäscher, Gerhard | DataCite | 2014


    Location and Multi-Compartment Capacitated Vehicle Routing Problem for Blood Banking System

    Göçmen, Elifcan / Erol, Rızvan | BASE | 2018

    Freier Zugriff


    Multi-Trip Vehicle Routing Problem Based on Fuel Consumption Reduction

    Peng, Yong / Peng, Jing / Li, Hongbo | ASCE | 2010


    Multi-depot multi-trip vehicle routing problem with time windows and release dates

    Zhen, Lu / Ma, Chengle / Wang, Kai et al. | Elsevier | 2020