This paper investigates a capacitated lane reservation problem in a transportation network. The problem is to decide the task paths and select lanes to be reserved in a capacitated network to ensure that each commodity can be transported from its source to destination within a given travel time, meanwhile the lane's capacity is not violated. Its objective is to minimize the total impact of all reserved lanes on other normal lanes. To solve this problem, two integer linear programming models are formulated. The complexity of the problem is proved to be NP-hard. Then an algorithm based on a cut-and-solve idea is proposed to obtain optimal solutions. To evaluate the performance of our proposed algorithm, numerical experiments of randomly generated instances are conducted. Computational results show our algorithm significantly outperforms a well-known optimization software package CPLEX.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    The capacitated lane reservation problem in transportation network


    Contributors:
    Yunfei Fang, (author) / Mammar, S. (author) / Feng Chu, (author) / Che, A. (author)


    Publication date :

    2011-05-01


    Size :

    1159484 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Optimal Lane Reservation in Transportation Network

    Fang, YunFei / Chu, Feng / Mammar, Saïd et al. | IEEE | 2012



    Bilevel Optimization for the Hazmat Transportation Problem with Lane Reservation

    Shengzhong Zhang / Qianqian Hui / Xue Bai et al. | DOAJ | 2020

    Free access

    A bus lane reservation problem in urban bus transit network

    Wu, Peng / Chu, Feng / Che, Ada et al. | IEEE | 2014