Highlights We introduce a novel bike network design model for planning segregated bike paths. A mixed integer nonlinear nonconvex model is proposed for the design problem. The model captures cyclists’ route choice behavior with a path size logit constraint. The model is reformulated and linearized to an MILP to obtain a global optimum. A new matheuristic is proposed by incorporating a surrogate-model-based algorithm.

    Abstract This study focuses on the optimal network design problem of bike paths, which are on or adjacent to roadways but are physically separated from motorized traffic within the existing urban network. The problem seeks to maximize the total route utilities of cyclists and capture their actual route choice behavior using a path-size logit model. A mixed-integer nonlinear nonconvex model is developed for the problem and is reformulated and linearized into a mixed-integer linear program. The program is solved with a global optimization method and a matheuristic. Results are provided to illustrate the performance of these methods and the model properties.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Bike network design problem with a path-size logit-based equilibrium constraint: Formulation, global optimization, and matheuristic


    Contributors:


    Publication date :

    2019-05-12


    Size :

    24 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    A matheuristic for the liner shipping network design problem

    Brouer, Berit Dangaard / Desaulniers, Guy / Pisinger, David | Elsevier | 2014


    A matheuristic for the liner shipping network design problem

    Brouer, Berit Dangaard | Online Contents | 2014