Applying Stochastic Algorithms to a Locomotive Scheduling Problem

DOI10.1057/JORS.1989.23MaRDI QIDQ3807866zbMATH OpenOpenAlexFDO

Authors

Publication date 1989

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/jors.1989.23

zbMATH Keywords

heuristicslocomotive schedulingrailway networkssimulated annealingstochastic algorithms

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Stochastic optimization model of locomotive assignment to freight trains
• Locomotive scheduling problem
• Algorithm of effective transportation work for cargo traffic
• Production of locomotive rosters for a multi-class single-locomotive problem
• A simulated annealing approach for the train design optimization problem

Cited in

(11)

• Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge
• Locomotive assignment with heterogeneous consists at CN North America
• A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems
• Pseudo-analysis and its application in railway routing
• Speeding up the Hungarian algorithm
• A problem of scheduling operations at a locomotive maintenance depot
• A simulated annealing approach for the train design optimization problem
• Algorithm and Software Development to Allocate Locomotives for Transportation of Freight Trains
• The locomotive assignment problem: a survey on optimization models
• Stochastic optimization model of locomotive assignment to freight trains
• Simulated annealing: A tool for operational research

This page was built for publication: Applying Stochastic Algorithms to a Locomotive Scheduling Problem

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