Amirkabir University of TechnologyAUT Journal of Mathematics and Computing2783-24491120200201Adopting GRASP to solve a novel model for bus timetabling problem with minimum transfer and fruitless waiting times125134332310.22060/ajmc.2019.15497.1018ENJavadZamani KafshaniAmirkabir University of TechnologySeyyed AliMirhassaniDepartment of Mathematics and Computer Science, Amirkabir University of Technology (Tehran Polytechnic)FarnazHooshmandDepartment of Mathematics and Computer Science, Amirkabir University of Technology (Tehran Polytechnic)0000-0002-2449-3925Journal Article20181122This 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.https://ajmc.aut.ac.ir/article_3323_85cc256ebddca4a51b227d38698683da.pdf