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

DOI10.1016/J.APM.2015.05.008MaRDI QIDQ2285990zbMATH OpenOpenAlexFDO

Authors 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

first train timetablingsimulated annealing algorithmsubway networktransfer waiting time

Mathematics Subject Classification ID

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

Recommendations

• A simulated annealing approach to the railroad freight transportation design problem
• A simulated annealing approach for the train design optimization problem
• Integrating traffic routing optimization and train formation plan using simulated annealing algorithm
• A simulated annealing approach for the multi-periodic rail-car fleet sizing problem
• NETWORK-BASED SIMULATION APPROACH FOR SCHEDULING TRAINS ON RAIL NETWORKS
• A branch and bound algorithm for scheduling trains in a railway network

Cites work

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

Cited in

(11)

• A simulated annealing approach for the multi-periodic rail-car fleet sizing problem
• 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
• An innovative flower pollination algorithm for continuous optimization problem
• 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
• Transfer-oriented dispatching optimization of rail transit network
• Application of improved meta-heuristic algorithms for green preservation technology management to optimize dynamical investments and replenishment strategies
• First train timetabling and passenger transfer routing problems in urban rail transit networks
• Mathematical modelling and an effective algorithm for unidirectional loop layout problem with fixed loading and unloading points

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

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