Author
Listed:
- Albuquerque, J.
- Gomes, M.C.
- Olivé, J.M.
- Andrade, A.R.
Abstract
This work introduces a new single-level mixed-integer linear programming framework for the Transit Network Design and Frequency Setting Problem that successfully integrates discrete choice models into a linear formulation. The model aims to capture demand by taking into consideration the travellers’ preferences and activates or deactivates routes at a certain frequency accordingly, from a given pool of possible routes. This work was applied both to an illustrative example and to a case study of the existing bus and Bus Rapid Transit network in an area of the Barcelona Metropolitan Area, comprising 9 lines and 319 origin-destination pairs. For each origin-destination pair, each possible itinerary within the network is pre-computed and is compared against the best itinerary of each of the competing modes of transport, which are obtained using Google Maps. For each itinerary in the network, it is computed its probability of being chosen, based on its utility, using a multinomial logit model, that takes into consideration the access, waiting and travel times, cost, and number of transfers. The coefficients were calibrated using a Stated Preferences Survey. The goal is to maximise the total network demand by tuning the active routes and frequencies, activating the itineraries with the highest probability of being chosen, allocating most or a pre-determined percentage of the demand to them, constrained by number and capacities of buses. The formulation allows for different assumptions on traveller assignment and coverage. The models are solved with exact methods within reasonable computational time and low optimality gaps.
Suggested Citation
Albuquerque, J. & Gomes, M.C. & Olivé, J.M. & Andrade, A.R., 2026.
"Transit network design and frequency setting with elastic demand: a mixed-integer linear programming approach,"
Transportation Research Part A: Policy and Practice, Elsevier, vol. 212(C).
Handle:
RePEc:eee:transa:v:212:y:2026:i:c:s0965856426002971
DOI: 10.1016/j.tra.2026.105156
Download full text from publisher
As the access to this document is restricted, you may want to
for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:transa:v:212:y:2026:i:c:s0965856426002971. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/547/description#description .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.