Bike network design problem with a path-size logit-based equilibrium constraint: Formulation, global optimization, and matheuristic
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.
- Record URL:
- Record URL:
-
Availability:
- Find a library where document is available. Order URL: http://worldcat.org/issn/13665545
-
Supplemental Notes:
- © 2019 Haoxiang Liu et al. Published by Elsevier Ltd. Abstract reprinted with permission of Elsevier.
-
Authors:
- Liu, Haoxiang
- 0000-0002-6130-2454
- Szeto, W Y
- 0000-0001-7059-3532
- Long, Jiancheng
- 0000-0002-2256-622X
- Publication Date: 2019-7
Language
- English
Media Info
- Media Type: Web
- Features: Figures; References; Tables;
- Pagination: pp 284-307
-
Serial:
- Transportation Research Part E: Logistics and Transportation Review
- Volume: 127
- Issue Number: 0
- Publisher: Elsevier
- ISSN: 1366-5545
- Serial URL: http://www.sciencedirect.com/science/journal/13665545
Subject/Index Terms
- TRT Terms: Bicycling; Bikeways; Cyclists; Logits; Mixed integer programming; Optimization; Route choice
- Uncontrolled Terms: Network design problem
- Subject Areas: Pedestrians and Bicyclists; Planning and Forecasting;
Filing Info
- Accession Number: 01709710
- Record Type: Publication
- Files: TRIS
- Created Date: Jul 1 2019 9:20AM