adopting grasp to solve a novel model for bus timetabling problem with minimum transfer and fruitless waiting times

This paper addresses a variant of bus timetabling problem assuming that travel times changes dynamically over the planning horizon. in addition to minimizing the transfer waiting time, another objective, namely minimizing the fruitless waiting time, is introduced in this paper as a new realistic objective. first, the problem is formulated as a mixed integer linear programming model. then, since commercial solvers become inefficient to solve moderate and large sized instances of the problem (due to the np-hardness), a grasp heuristic algorithm is developed. computational experiments over a variety of random instances verify the performance of the proposed method.