A fast algorithm for near cost optimal line plans

DOI10.1007/S001860300332MaRDI QIDQ1762670zbMATH OpenOpenAlexFDO

Authors Thomas Lindner, Marco E. Lübbecke, Michael R. Bussieck

Publication date 11 February 2005

Published in Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL https://depositonce.tu-berlin.de/handle/11303/15484

zbMATH Keywords

Integer programmingCutting planesNonlinear integer programmingLine planningPublic transport

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30) Integer programming (90C10) Transportation, logistics and supply chain management (90B06)

Recommendations

• Cost optimal allocation of rail passenger lines
• Models for line planning in public transport
• Optimal lines for railway systems
• Line planning with user-optimal route choice
• scientific article; zbMATH DE number 5117501

Cited in

(18)

• The Steiner connectivity problem
• Construction Line Algorithms for the Connection Location-Allocation Problem
• How to optimize train stops under diverse passenger demand: a new line planning method for large-scale high-speed rail networks
• Urban public transit network optimization with flexible demand
• Line planning on tree networks with applications to the Quito Trolebús system
• Non-pool-based line planning on graphs of bounded treewidth
• The line planning routing game
• An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem
• Cost-minimal public transport planning
• Line planning in public transportation: models and methods
• Line planning with user-optimal route choice
• A configuration model for the line planning problem
• Optimal line planning in the parametric city
• An extended formulation for the line planning problem
• Column generation approach to line planning with various halting patterns - application to the Korean high-speed railway
• Integrating train service route design with passenger flow allocation for an urban rail transit line
• Train stop scheduling problem: an exact approach using valid inequalities and polar duality
• The grid based approach, a fast local evaluation technique for line planning

Describes a project that uses

Uses Software

• GAMS
• DICOPT

This page was built for publication: A fast algorithm for near cost optimal line plans

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1762670)