“…Computational experiments show that fewer flight changes are needed, compared with the deterministic approach. Takahashi et al (2008) address re-scheduling decisions for DSP problem, in which, after a disruption occurs, the problem is to minimize the violation of the constraints, such as the number of drivers, train coverage, meal times, continuous shifts, and work time bounds. A TS is designed to solve the problem and the experimentation stage in a real example shows that the solutions generated surpass (in terms of the satisfaction of each constraint) the ones obtained by the manual process employed by the agency.…”