Hybrid large neighborhood search for the bus rapid transit route design problem
From MaRDI portal
Publication:296775
DOI10.1016/J.EJOR.2014.04.005zbMATH Open1338.90067OpenAlexW2014662516MaRDI QIDQ296775FDOQ296775
Authors: V. Schmid 
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
Recommendations
- Urban rapid transit network design: accelerated Benders decomposition
- A route set construction algorithm for the transit network design problem
- Search strategies for the feeder bus network design problem
- A simultaneous bus route design and frequency setting problem for Tin Shui Wai, Hong Kong
- A tabu search based heuristic method for the transit route network design problem
large neighborhood searchbus rapid transit route designdecomposition approachhybrid metaheuristicpublic transportation
Cites Work
- Optimization methods for the planning of rapid transit systems
- Bi-objective bimodal urban road network design using hybrid metaheuristics
- Handbooks in operations Research \& management science: Transportation
- A Doubly Dynamic Schedule-based Assignment Model for Transit Networks
- Optimal lines for railway systems
- Cost optimal allocation of rail passenger lines
- Record breaking optimization results using the ruin and recreate principle
- A direct connection approach to integrated line planning and passenger routing
- Hybrid column generation and large neighborhood search for the dial-a-ride problem
- Models for line planning in public transport
- Title not available (Why is that?)
- Line planning in public transportation: models and methods
- 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
- A note on branch-and-cut-and-price
Cited In (7)
- Hybridizations of evolutionary algorithms with large neighborhood search
- An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem
- A comparative analysis of two matheuristics by means of merged local optima networks
- Optimisation of transportation service network using \(\kappa\)-node large neighbourhood search
- Integrated timetabling and vehicle scheduling with balanced departure times
- Integrated approach to network design and frequency setting problem in railway rapid transit systems
- The static on‐demand bus routing problem: large neighborhood search for a dial‐a‐ride problem with bus station assignment
This page was built for publication: Hybrid large neighborhood search for the bus rapid transit route design problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q296775)
