The Bicycle Network Improvement Problem
Jisoon Lim, Kevin Dalmeijer, Subhrajit Guhathakurta, Pascal Van, Hentenryck

TL;DR
This paper introduces the Bicycle Network Improvement Problem (BNIP), a mixed-integer linear programming model that optimizes road improvements to enhance bicycle safety and increase ridership within a given budget, demonstrated through a case study in Atlanta.
Contribution
It formulates BNIP as a scalable optimization model using Benders decomposition, incorporating practical aspects like sequential improvements and cost variations.
Findings
Benders decomposition effectively solves large BNIP instances.
Network improvements can significantly boost bicycle ridership.
The case study demonstrates practical application in Atlanta.
Abstract
Using a bicycle for commuting is still uncommon in US cities, although it brings many benefits to both the cyclists and to society as a whole. Cycling has the potential to reduce traffic congestion and emissions, increase mobility, and improve public health. To convince people to commute by bike, the infrastructure plays an important role, since safety is one of the primary concerns of potential cyclists. This paper presents a method to find the best way to improve the safety of a bicycle network for a given budget and maximize the number of riders that could now choose bicycles for their commuting needs. This optimization problem is formalized as the Bicycle Network Improvement Problem (BNIP): it selects which roads to improve for a set of traveler origin-destination pairs, taking both safety and travel distance into account. The BNIP is modeled as a mixed-integer linear program that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
