Page - 113 - in Algorithms for Scheduling Problems
Image of the Page - 113 -
Text of the Page - 113 -
Algorithms 2018,11, 55
3. Lamorgese, L.; Mannino, C.; Pacciarelli, D.; Törnquist Krasemann, J. Train Dispatching. InHandbook
of Optimization in the Railway Industry, International Series in Operations Research & Management Science;
Borndörfer, R., Klug, T., Lamorgese, L.,Mannino, C., Reuther,M., Schlechte, T., Eds.; Springer: Cham,
Switzerland,2018;Volume268. [CrossRef]
4. Cacchiani, V.; Huisman,D.; Kidd,M.; Kroon, L.; Toth, P.; Veelenturf, L.; Wagenaar, J. An overviewof
recoverymodelsandalgorithmsfor real-timerailwayrescheduling.Transp. Res. BMethodol. 2010,63, 15–37.
[CrossRef]
5. Fang,W.; Yang, S.; Yao, X.ASurvey onProblemModels andSolutionApproaches toRescheduling in
RailwayNetworks. IEEETrans. Intell. Trans. Syst. 2015,16, 2997–3016. [CrossRef]
6. Josyula, S.; Törnquist Krasemann, J. Passenger-oriented Railway Traffic Re-scheduling: A Review of
AlternativeStrategiesutilizingPassengerFlowData. InProceedingsof the7th InternationalConferenceon
RailwayOperationsModellingandAnalysis,Lille,France,4–7April2017.
7. Szpigel,B.Optimal trainschedulingonasingle trackrailway.Oper. Res. 1973,72, 343–352.
8. D’Ariano,A.;Pacciarelli,D.;Pranzo,M.Abranchandboundalgorithmforschedulingtrains inarailway
network.Eur. J.Oper. Res. 2017,183, 643–657. [CrossRef]
9. Khosravi,B.;Bennell, J.A.;Potts,C.N.TrainSchedulingandReschedulingintheUKwithaModifiedShifting
BottleneckProcedure. InProceedingsof the12thWorkshoponAlgorithmicApproaches forTransportation
Modelling,Optimization,andSystems2012,Ljubljana,Slovenia,13September2012;pp.120–131.
10. Liu, S.; Kozan, E. Scheduling trains as a blocking parallel-machine job shop scheduling problem.
Comput.Oper. Res. 2009,36, 2840–2852. [CrossRef]
11. Mascis,A.;Pacciarelli,D. Job-shopschedulingwithblockingandno-wait constraints.Eur. J.Oper. Res. 2002,
143, 498–517. [CrossRef]
12. Oliveira,E.; Smith,B.M.AJob-ShopSchedulingModel for theSingle-TrackRailwaySchedulingProblem;Research
ReportSeries21;SchoolofComputing,UniversityofLeeds: Leeds,UK,2000.
13. Törnquist, J.; Persson, J.A.N-trackedrailwaytrafficre-schedulingduringdisturbances.Transp. Res. Part
BMethodol. 2007,41, 342–362. [CrossRef]
14. Pellegrini,P.;Douchet,G.;Marliere,G.;Rodriguez, J.Real-timetrainroutingandscheduling throughmixed
integer linearprogramming:Heuristicapproach. InProceedingsof the2013InternationalConferenceon
IndustrialEngineeringandSystemsManagement (IESM),Rabat,Morocco,28–30October2013.
15. Xu,Y.; Jia,B.;Ghiasib,A.;Li,X.Trainroutingandtimetablingproblemforheterogeneous train trafficwith
switchableschedulingrules.Transp. Res. PartCEmerg. Technol. 2017,84, 196–218. [CrossRef]
16. Corman,F.;D’Ariano,A.;Pacciarelli,D.;Pranzo,M.Centralizedversusdistributedsystemstoreschedule
trains in twodispatchingareas.PublicTrans. Plan.Oper. 2010,2, 219–247. [CrossRef]
17. Corman,F.;D’Ariano,A.;Pacciarelli,D.;Pranzo,M.Optimal inter-areacoordinationof trainrescheduling
decisions.Trans. Res. PartE2012,48, 71–88.
18. Corman, F.; Pacciarelli, D.; D’Ariano,A.; Samá,M. ReschedulingRailwayTraffic Taking intoAccount
MinimizationofPassengers’Discomfort. InProceedingsof the InternationalConferenceonComputational
Logistics, ICCL2015,Delft,TheNetherlands,23–25September2015;pp.602–616.
19. Lamorgese,L.;Mannino,C.AnExactDecompositionApproachfortheReal-TimeTrainDispatchingProblem.
Oper. Res. 2015,63, 48–64. [CrossRef]
20. Meng, L.; Zhou, X. Simultaneous train rerouting and rescheduling on anN-track network: Amodel
reformulationwithnetwork-basedcumulativeflowvariables.Trans. Res. PartBMethodol. 2014,67, 208–234.
[CrossRef]
21. Tormo, J.; Panou, K.; Tzierpoulos, P. Evaluation and Comparative Analysis of Railway Perturbation
ManagementMethods. InProceedingsof theConférenceMondialesur laRechercheDans lesTransports
(13thWCTR),RiodeJaneiro,Brazil, 15–18 July2013.
22. Rodriguez, J. An incremental decision algorithm for railway traffic optimisation in a complex station.
Eleventh. InProceedingsof the InternationalConferenceonComputerSystemDesignandOperation in the
RailwayandOtherTransitSystems(COMPRAIL08),Toledo,Spain,15–17September2008;pp.495–504.
23. Bettinelli,A.; Santini,A.;Vigo,D.Areal-timeconflict solutionalgorithmfor the trainreschedulingproblem.
Trans. Res. PartBMethodol. 2017,106, 237–265. [CrossRef]
24. Samà,M.;D’Ariano,A.;Corman,F.;Pacciarelli,D.Avariableneighbourhoodsearchfor fast trainscheduling
androutingduringdisturbedrailwaytrafficsituations.Comput.Oper. Res. 2017,78, 480–499. [CrossRef]
113
back to the
book Algorithms for Scheduling Problems"
Algorithms for Scheduling Problems
- Title
- Algorithms for Scheduling Problems
- Authors
- Frank Werner
- Larysa Burtseva
- Yuri Sotskov
- Editor
- MDPI
- Location
- Basel
- Date
- 2018
- Language
- English
- License
- CC BY 4.0
- ISBN
- 978-3-03897-120-7
- Size
- 17.0 x 24.4 cm
- Pages
- 212
- Keywords
- Scheduling Problems in Logistics, Transport, Timetabling, Sports, Healthcare, Engineering, Energy Management
- Categories
- Informatik
- Technik