Adopting GRASP to solve a novel model for bus timetabling problem with minimum transfer and fruitless waiting times | ||
| AUT Journal of Mathematics and Computing | ||
| مقاله 12، دوره 1، شماره 1، اردیبهشت 2020، صفحه 125-134 اصل مقاله (544.03 K) | ||
| نوع مقاله: Original Article | ||
| شناسه دیجیتال (DOI): 10.22060/ajmc.2019.15497.1018 | ||
| نویسندگان | ||
| Javad Zamani Kafshani1؛ Seyyed Ali Mirhassani* 2؛ Farnaz Hooshmand2 | ||
| 1MSc, Faculty of Mathematics and Computer Sciences, Amirkabir University of Technology, Tehran, Iran | ||
| 2Department of Mathematics and Computer Science, Amirkabir University of Technology (Tehran Polytechnic), Iran | ||
| چکیده | ||
| 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. | ||
| کلیدواژهها | ||
| Bus timetabling؛ Dynamic travel time؛ Transfer waiting time؛ Fruitless waiting time؛ GRASP | ||
| مراجع | ||
|
| ||
|
آمار تعداد مشاهده مقاله: 40,068 تعداد دریافت فایل اصل مقاله: 847 |
||
| تعداد نشریات | 9 |
| تعداد شمارهها | 455 |
| تعداد مقالات | 5,771 |
| تعداد مشاهده مقاله | 8,375,224 |
| تعداد دریافت فایل اصل مقاله | 6,933,601 |