In this paper, we investigate a new variant of the multi-commodity network flow problem, taking into consideration multiple transport lines and time windows. This variant arises in a city logistics environment, more specifically in a long-haul passenger transport system that is also used to transport urban freight. We propose two mixed integer programming models for two objective functions: minimization of network operational costs and minimization of travel times. Since the problems under study are NP-hard, we propose three size reduction heuristics. In order to assess the performance of the proposed algorithms, we carried out computational experiments on a set of synthetic problem instances. We use the relative percentage deviation as performance criterion. For the cost objective function, a LP-and-Fix algorithm outperforms other methods in most tested instances, but for the travel time, a hybrid method (size reduction with LP-and-Fix algorithm) is, in general, better than other approaches.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Variable fixing heuristics for the capacitated multicommodity network flow problem with multiple transport lines, a heterogeneous fleet and time windows



    Published in:

    Transportation Letters ; 14 , 2 ; 84-93


    Publication date :

    2022-02-07


    Size :

    10 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    Unknown





    Heuristics for the periodic capacitated arc routing problem

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


    Split-Delivery Capacitated Arc-Routing Problem With Time Windows

    Lai, Qidong / Zhang, Zizhen / Yu, Mingzhu et al. | IEEE | 2022


    The congested multicommodity network design problem

    Paraskevopoulos, Dimitris C. / Gürel, Sinan / Bektaş, Tolga | Elsevier | 2015