Hybrid large neighborhood search for the bus rapid transit route design problem

DOI10.1016/J.EJOR.2014.04.005MaRDI QIDQ296775zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

large neighborhood searchbus rapid transit route designdecomposition approachhybrid metaheuristicpublic transportation

Mathematics Subject Classification ID

Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)

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

Cites work

• scientific article; zbMATH DE number 1006366 (Why is no real title available?)
• A Doubly Dynamic Schedule-based Assignment Model for Transit Networks
• A direct connection approach to integrated line planning and passenger routing
• A heuristic for the location of a rapid transit line
• A note on branch-and-cut-and-price
• Bi-objective bimodal urban road network design using hybrid metaheuristics
• Cost optimal allocation of rail passenger lines
• Handbooks in operations Research \& management science: Transportation
• Hybrid column generation and large neighborhood search for the dial-a-ride problem
• Integrating routing decisions in network problems
• Line planning in public transportation: models and methods
• Line planning on tree networks with applications to the Quito Trolebús system
• Locating stations on rapid transit lines
• Models for line planning in public transport
• Optimal lines for railway systems
• Optimization methods for the planning of rapid transit systems
• Record breaking optimization results using the ruin and recreate principle

Cited in

(7)

• 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
• Hybridizations of evolutionary algorithms with large neighborhood 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)