Abstract
Setting up a bikeway network has been recognized as one of the most effective measures to motivate cycling. In fact, a highly connected, exclusive bikeway network that covers all demand sources can be an attractive and time-saving measure, but it requires very high setup costs. The planner often needs to have a trade-off between demand coverage and travel time under a given construction cost. This paper introduces a novel bikeway design problem which determines an optimal bikeway network that covers all potential cycling demand sources with minimal total travel time and under budget constraints. In the context of designing a bike sharing system, the resultant node set of the bikeway network can be interpreted as the locations of the shared bike stations which can cover all cycling demands. A two-stage solution method, by combining the genetic algorithm and a novel elimination heuristic, is proposed to solve the problem by firstly determining the subset of nodes (selected nodes) that can cover all the demand sources and then designing the bikeway network that connects all selected nodes within a given budget. Numerical studies illustrate the advantages of elimination heuristics in solving the proposed problem and the effect of the budget towards the solution fitness with or without a solution. Case studies of two proposed new towns in Hong Kong are provided to illustrate the applicability and effectiveness of the method in bikeway design. This optimization model can be applied to bike-sharing system design problems which aims to cover all demand sources by providing bike stations that are also well connected with exclusive bikeways subject to budget constraints.
Highlights
Cycling has been receiving attention in the past decade due to its associated benefits, including improving public health, reducing greenhouse gas emissions, alleviating traffic congestion, and increasing the catchment area of public transportation [1]
We propose a two-stage solution method based on the genetic algorithm and an elimination heuristic which determines the selected node set that covers all demand sources and the bikeway layout respectively; 3
This study proposes a new bikeway network design problem that minimizes the total system travel time between a set of selected nodes under a budget constraint, in which all potential demands must be covered by the selected nodes and all selected nodes must be interconnected
Summary
Cycling has been receiving attention in the past decade due to its associated benefits, including improving public health, reducing greenhouse gas emissions, alleviating traffic congestion, and increasing the catchment area of public transportation [1]. This study, proposes a new bikeway design problem that minimizes the total system travel time between the selected nodes under both the budget and demand coverage constraints. Sustainability 2019, 11, 6531 weight, and the latter aims for a set of minimal cost routes between the origin(s) and the destination(s) In other words, the former guarantees a minimal overall construction cost while the latter provides minimal travel costs between the O-D pairs, but none of them can provide an intermediate solution, which is a network with minimal total travel time under a given budget, especially in the case with a selected set of nodes.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
