A procedure to adjust transit trip departure times through minimizing the maximum headway

DOI10.1016/0305-0548(91)90019-NzbMath0744.90028MaRDI QIDQ1186920

Avishai (Avi) Ceder

Publication date: 28 June 1992

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

zbMATH Keywords

directed networkminimax headway problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (5)

Variable and adaptive neighbourhood search algorithms for rail rapid transit timetabling problem ⋮ Discrete optimization in public rail transport ⋮ A simulated annealing algorithm for first train transfer problem in urban railway networks ⋮ Strategic timetable scheduling for last trains in urban railway transit networks ⋮ Global optimization for bus line timetable setting problem

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• Computer-aided transit scheduling. Proceedings of the fourth international workshop on computer-aided scheduling of public transport, held in Hamburg, FRG, 28th -- 31st July 1987

This page was built for publication: A procedure to adjust transit trip departure times through minimizing the maximum headway