A simulated annealing algorithm for first train transfer problem in urban railway networks

DOI10.1016/j.apm.2015.05.008zbMath1443.90038OpenAlexW609247325MaRDI QIDQ2285990

Liujiang Kang, Xiaoning Zhu

Publication date: 9 January 2020

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2015.05.008

zbMATH Keywords

simulated annealing algorithmfirst train timetablingsubway networktransfer waiting time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Mathematical modeling or simulation for problems pertaining to operations research and mathematical programming (90-10)

Related Items (7)

An innovative flower pollination algorithm for continuous optimization problem ⋮ Application of improved meta-heuristic algorithms for green preservation technology management to optimize dynamical investments and replenishment strategies ⋮ Mathematical analysis and an exact solution combined with preprocessing method for resynchronizing of bus timetable problem ⋮ Synchronizing last trains of urban rail transit system to better serve passengers from late night trains of high-speed railway lines ⋮ Strategic timetable scheduling for last trains in urban railway transit networks ⋮ Timetable coordination of first trains in urban railway network: a case study of Beijing ⋮ Modeling formulation and a new heuristic for the railroad blocking problem

Cites Work

• Unnamed Item
• Unnamed Item
• A Green train scheduling model and fuzzy multi-objective optimization algorithm
• Timetabling optimization of a mixed double- and single-tracked railway network
• Solving railroad blocking problem using ant colony optimization algorithm
• Railway track allocation: Models and methods
• Non-cyclic train timetabling and comparability graphs
• Scheduling trains as a blocking parallel-machine job shop scheduling problem
• A procedure to adjust transit trip departure times through minimizing the maximum headway
• A branch and bound algorithm for scheduling trains in a railway network
• A disjunctive graph model and framework for constructing new train schedules
• A Lagrangian heuristic algorithm for a real-world train timetabling problem
• Bicriteria train scheduling for high-speed passenger railroad planning applications
• Modeling and Solving the Train Timetabling Problem
• A Model, Algorithms and Strategy for Train Pathing

This page was built for publication: A simulated annealing algorithm for first train transfer problem in urban railway networks