Speeding up the passenger assignment problem in transit planning by the direct link network representation

DOI10.1016/J.COR.2024.106647MaRDI QIDQ6568464zbMATH OpenFDO

Authors Dilay Aktaş, Evert Vermeir, Pieter Vansteenwegen

Publication date 8 July 2024

Published in Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

line planning problemchange and go networkpassenger assignment problemtrain service network

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• scientific article; zbMATH DE number 5117501 (Why is no real title available?)
• scientific article; zbMATH DE number 3664728 (Why is no real title available?)
• A metaheuristic approach to the urban transit routing problem
• A note on two problems in connexion with graphs
• A review of urban transportation network design problems
• A survey on robustness in railway planning
• Integrating network design and frequency setting in public transportation networks: a survey
• Integrating routing decisions in public transportation problems
• Line planning in public transportation: models and methods
• Line planning with minimal traveling time
• Line planning with user-optimal route choice
• Solving urban transit route design problem using selection hyper-heuristics
• The grid based approach, a fast local evaluation technique for line planning

This page was built for publication: Speeding up the passenger assignment problem in transit planning by the direct link network representation

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