This paper presents a timetable rescheduling algorithm based on Mixed Integer Programming (MIP) formulation when train traffic is disrupted. We minimize further inconvenience to passengers instead of consecutive delays caused by the disruption, since loss of time and satisfaction of the passengers are considered implicitly and insufficiently in the latter optimization. We presume that inconvenience of traveling by train consists of the traveling time on board, the waiting time at platforms and the number of transfers. Hence, the objective function is calculated on the positive difference between the inconvenience which each passenger suffers on his/her route in a rescheduled timetable and that in a planned timetable. The inconvenience-minimized rescheduling is often achieved at the cost of further train delays. Some trains dwell longer at a station to wait for extra passengers to come or to keep a connection, for instance. In the MIP model, train operation, each passenger’s behavior and the amount inconvenience are simultaneously expressed by a system of integer linear inequalities. As countermeasures against the disruption, changes of train types and rolling stock operation schedules at termini as well as changes of departing order of trains and assignment of a track to trains in stations are performed. We also consider capacities of a line between adjacent stations as well as those of a track in stations. We have conducted numerical experiments using actual data and have obtained better rescheduled timetables in terms of customer satisfaction within practical time in proper solution space. set of train directions opposite direction of b ∈ B set of trains set of trains traveling in b ∈ B set of ordered pair of distinct trains traveling in b ∈ B set of candidate successor trains of r ∈ R set of stations starting station of trains traveling in b ∈ B terminus of trains traveling in b ∈ B station next to s ∈ S in b ∈ B set of O–D pair of stations in b ∈ B set of stations at which passengers to d ∈ S in b ∈ B can transfer station next to s ∈ S in b ∈ B at which passengers can transfer set of tracks at s ∈ S which trains traveling in b ∈ B can pass through or stop at set of train types set of train types which stop at s ∈ S set of train types which passengers can take at s to reach d where ( s , d ) ∈ S b < 2 priority relation between two train types set of discrete time periods set of two pairs ( o , d 1 ) , ( o , d 2 ) ∈ S b < 2 with d 1 ≠ d 2 whose behavior is same when they appear at same time arrival/departure time of r ∈ R at s ∈ S in planned timetable amount of inconvenience to passengers between ( o , d ) ∈ S b < 2 appearing at t ∈ T in planned timetable arrival/departure time of r ∈ R at s ∈ S in certain feasible rescheduled timetable minimum interval required between arrivals and departures arbitrary large number concerning headway/inconvenience maximum number of trains traveling in b ∈ B allowed to exist on line between ( s , Next ( b , s ) ) number of passengers between ( o , d ) ∈ S b < 2 appearing at t ∈ T inconvenience of waiting for 1min at platform inconvenience of one train transfer flexibility in timetable to be rescheduled arrival/departure time of r ∈ R at s ∈ S 0–1 if or not type of r ∈ R is e ∈ E 0–1 if or not r ∈ R b passes through or stops at k ∈ K b , s 0–1 if or not successor of r 1 ∈ R is r 2 ∈ R Suc ( r 1 ) 0–1 if or not r 1 ∈ R b departs from s ∈ S ⧹ { Term ( b ) } earlier than r 2 ∈ R b ⧹ { r 1 } 0–1 if or not r 1 ∈ R b arrives at Term(b) earlier than r 2 ∈ R Opp ( b ) departs from 0–1 if or not r 2 ∈ R Opp ( b ) departs from Term(b) earlier than r 1 ∈ R b arrives at 0–1 if or not N b , s - 1 trains depart from s after r 1 and before r 2 does 0–1 if or not passengers between ( o , d ) ∈ S b < 2 appearing at t ∈ T take r ∈ R b 0–1 if or not passengers to d ∈ S at s ∈ S Tra ( b , d ) transfer from r 1 ∈ R b to r 2 ∈ R b amount of inconvenience to passengers to d when they take r ∈ R b at s where ( s , d ) ∈ S b < 2 increased amount of inconvenience to passengers between ( o , d ) ∈ S b < 2 appearing at t ∈ T taking r ∈ R b 
A MIP-based timetable rescheduling formulation and algorithm minimizing further inconvenience to passengers