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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

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


    Contributors:
    Moon, Ilkyeong (author) / Salhi, Said (author) / Feng, Xuehao (author)

    Published in:

    Publication date :

    2020-01-01


    Size :

    28 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    Unknown




    The Multi-Compartment Vehicle Routing Problem with Flexible Compartment Sizes

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




    Multi-Trip Vehicle Routing Problem Based on Fuel Consumption Reduction

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


    A Multi-Compartment Vehicle Routing Problem with Loading and Unloading Costs

    Hübner, Alexander / Ostermeier, Manuel | British Library Online Contents | 2019