ماتریال برای هماهنگ سازی انتقال از طریق برنامه ریزی یکپارچه و برنامه ریزی خودرو

A matheuristic is proposed that iteratively solves the mathematical formulation of the integrated timetabling and vehicle scheduling problem allowing timetable modifications for a subset of timetabled trips only, while solving the full vehicle scheduling problem. We compare different selection strategies for defining the sub-problems. Results for a realistic case study of the Greater Copenhagen area indicate that the matheuristic is able to find better feasible solutions faster than a commercial solver and that allowing the addition of dwell time creates a larger potential for reducing transfer costs.