Schedule synchronization for public transit networks

DOI10.1007/BF01721163zbMath0658.90034OpenAlexW1983517707MaRDI QIDQ1111918

Wolfgang Domschke

Publication date: 1989

Published in: OR Spektrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01721163

zbMATH Keywords

heuristicssimulated annealingbranch-and-boundcommunication routesimprovement algorithmsregret-methodstransfer stationswaiting times of passengers

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Deterministic network models in operations research (90B10)

Related Items (14)

Algorithm for the discrete Weber's problem with an accuracy estimate ⋮ Discrete optimization in public rail transport ⋮ A STOCHASTIC TIMETABLE OPTIMIZATION MODEL IN SUBWAY SYSTEMS ⋮ A genetic algorithm approach to periodic railway synchronization ⋮ Metaheuristics: A bibliography ⋮ Public transport for smart cities: recent innovations and future challenges ⋮ Locating facilities which interact: Some solvable cases ⋮ Synchronizing last trains of urban rail transit system to better serve passengers from late night trains of high-speed railway lines ⋮ Schedule optimization under fuzzy constraints of vehicle capacity ⋮ Operations Research in passenger railway transportation ⋮ Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search ⋮ Strategic timetable scheduling for last trains in urban railway transit networks ⋮ Models for the schedule optimization problem at a public transit terminal ⋮ A polynomially solvable class of quadratic semi-assignment problems

Cites Work

• A thermodynamically motivated simulation procedure for combinatorial optimization problems
• A railway scheduling problem

This page was built for publication: Schedule synchronization for public transit networks