A review of passenger-oriented railway rescheduling approaches

Sharma, Bishal; Pellegrini, Paola; Rodriguez, Joaquin; Chaudhary, Neeraj

doi:10.1186/s12544-023-00587-0

European Transport Research Review

An Open Access Journal

Table 3 Summary for approaches for rescheduling in conventional railways

From: A review of passenger-oriented railway rescheduling approaches

Paper	Capacity	Type	Scope	Rescheduling measures	Rescheduling models	Passenger details	Objective function minimized	Solution approach
Schöbel [7]		P	MA	RT + RO	MIP	S	TPD	E (Branch and bound)
Heilporn et al. [8]		P	MA	RT + RO	MIP	S	TPD	E (Branch and cut) and H (constraint generation)
Schachtebeck et al. [9]	RC	P	MA	RT + RO	IP	S	TPD + NMC	H (FSFS, FRFS,EARLYFIX)
Schöbel [10]	TC	P	MA	RT + RO	IP	S	TPD + NMC	H (FSFS and B & B-OS)
Dollevoet et al. [11]		P	MA	RT + RO	IP	S	ATP	E (Dijkstra algorithm)
Dollevoet and Huisman [12]		P	MA	RT + RO	IP	S	TPD	H (Three sets of heuristics)
Dollevoet et al. [13]	TC + SC	P	MA	RT + RO	IP	S	TPD + NTC	H (Iterative heuristics)
Kanai et al. [14]	TC	P	MA	RT + RO	MIP	S	PI	M (Tabu search algorithm)
Sato et al. [30]	TC + SC	P	MI	RT + RO + RR	MIP	S	PI	E and H (Exact and heuristics methods)
Tanaka et al. [16]	TC + TSC	P	MA	RT + RO	O	D	PI	E (Dijkstra algorithm)
Norio et al. [15]	TC + SC	P	MA	RT + RO + RR + AS + E + C + RSR	O	I	PI	M(Simulated Modelling) and PERT
Zhu and Goverde [17]	TC + SC	D	MA	RT + RO + AS + SS + ST + C	MIP	S	TDP	E (Gurobi Solver)
Zhu and Goverde [18]	TC + SC	D	MA	RT + RO + AS + SS + ST + C	MIP	D	GTT	M (Adapted fix-and-optimize algorithm)
Binder et al. [19]	TC + SC + TSC	D	MA	RT + RO + RR + C + E	IP	D	PI + OC + TTT	E (Commercial solver)
Binder et al. [20]	TC + SC + TSC	D	MA	RT + RO + RR + C + E + SS	O	S	PI + OC + TTT	M (Adaptive large neighbourhood search)
Hong et al. [21]	TC + TSC	D	MA	RT + RO + RR + AS	MIP	D	NSP + TTT	E (Commercial solver)
Kroon et al. [22]	TC + TSC	D	MA	RT + RO + RSR	IP	D	GTT + RSR	H (Iterative heuristics) and simulation
Vennlenturf et al. [23]	TC + RSC	D	MA	RT + RO + AS + RSR	IP	D	RSR + SC + PEC	H (Iterative heuristics)
Hoogervorst et al. [25]	TSC	D	MA	RT + RO + ST + RSR	MIP	S	GTT + PC	E (Branch & bound and branch & price)
Espinose-Aranda and García-Ródenas [27]	TC	P	MI	RT + RO	IP + AG	S	TPD	H (Avoid most delayed alternative arc)
Dollevoet et al. [28]	TC + SC	P	MI	RT + RO	IP	S	TTD + NMC	H (Iterative approach)
Corman et al. [26]	TC	P	MI	RT + RO	MIP + AG	S	TTD + NMC	H (Three iterative heuristics algorithms)
Corman et al. [29]	TC	P	MI	RT + RO	MIP + AG	S	GTT	H (Three iterative heuristics algorithms)
Toletti and Weidmann [31]	TC + SC	P	MI	RT + RO	IP	D	TTD + TPD + PI	E (Commercial solver) and simulation
Shakibayifar et al. [32]	TC + SC	D	MI	RT + RO + SC	MIP	S	TTD + PC	E (Exact method) and H (two heuristics)
Zhan et al. [33]	TC + SC + TSC	D	MI	RT + RO + C	IP	S	OC + PEC	E (Alternating direction method of multipliers and lagrangian relaxation)

Back to article page