Hybrid large neighborhood search for the bus rapid transit route design problem
From MaRDI portal
Publication:296775
DOI10.1016/j.ejor.2014.04.005zbMath1338.90067OpenAlexW2014662516MaRDI QIDQ296775
Publication date: 23 June 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2014.04.005
decomposition approachlarge neighborhood searchbus rapid transit route designhybrid metaheuristicpublic transportation
Related Items (4)
Integrated approach to network design and frequency setting problem in railway rapid transit systems ⋮ Hybridizations of evolutionary algorithms with large neighborhood search ⋮ A comparative analysis of two matheuristics by means of merged local optima networks ⋮ Integrated timetabling and vehicle scheduling with balanced departure times
Cites Work
- Bi-objective bimodal urban road network design using hybrid metaheuristics
- Hybrid column generation and large neighborhood search for the dial-a-ride problem
- Line planning in public transportation: models and methods
- A note on branch-and-cut-and-price
- Optimal lines for railway systems
- Cost optimal allocation of rail passenger lines
- Optimization methods for the planning of rapid transit systems
- Record breaking optimization results using the ruin and recreate principle
- A Direct Connection Approach to Integrated Line Planning and Passenger Routing
- A Doubly Dynamic Schedule-based Assignment Model for Transit Networks
- Line planning on tree networks with applications to the Quito Trolebús system
- Integrating Routing Decisions in Network Problems
- A heuristic for the location of a rapid transit line
- Locating stations on rapid transit lines
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Hybrid large neighborhood search for the bus rapid transit route design problem
