Using the metaheuristic methods for real-time optimisation of dynamic school bus routing problem and an application

被引:13
作者
Yigit, Tuncay [1 ]
Unsal, Ozkan [1 ]
Deperlioglu, Omer [2 ]
机构
[1] Suleyman Demirel Univ, Dept Comp Engn, TR-32260 Isparta, Turkey
[2] Afyon Kocatepe Univ, Dept Comp Technol, TR-03200 Afyon, Turkey
关键词
metaheuristic methods; real-time optimisation; dynamic school bus routing problem; DSBRP; ant colony optimisation; ACO; genetic algorithm; TABU SEARCH; ANT SYSTEM; VEHICLE; ALGORITHM; GA;
D O I
10.1504/IJBIC.2017.10004333
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The vehicle routing problem (VRP) is an optimisation issue that has been studied for more than 50 years with its numerous subfields. The optimisation of VRP over distribution and transportation systems leads to significant gains in cost and time. There are many metaheuristic methods developed for the solution of the problem; and it was observed that metaheuristic methods prove to produce more successful results compared to common heuristic methods. In this study, a mobile-supported visual application was developed using ant colony optimisation (ACO) and genetic algorithm (GA), which are among the metaheuristic methods for the dynamic school bus routing problem (DSBRP), one of the sub-problems of VRP. The ACO and GA methods were utilised via the application for bus routes of a school located in the province of Ankara and the performance of these methods were compared through the obtained results. It was observed that time and distance values of the routes of current school bus routes may be improved by these two methods.
引用
收藏
页码:123 / 133
页数:11
相关论文
共 34 条
[1]  
Arias-Rojas Juan S, 2012, Rev.EIA.Esc.Ing.Antioq, P193
[2]  
Ben Sghaier S, 2013, 2013 INTERNATIONAL CONFERENCE ON ADVANCED LOGISTICS AND TRANSPORT (ICALT), P7
[3]   A dynamic max-min ant system for solving the travelling salesman problem [J].
Bonyadi, Mohammad Reza ;
Shah-Hosseini, Hamed .
INTERNATIONAL JOURNAL OF BIO-INSPIRED COMPUTATION, 2010, 2 (06) :422-433
[4]   A reactive variable neighborhood search for the vehicle-routing problem with time windows [J].
Bräysy, O .
INFORMS JOURNAL ON COMPUTING, 2003, 15 (04) :347-368
[5]  
Breedam A. V., 1996, 9614 RUCA U ANTW
[6]   SCHEDULING OF VEHICLES FROM CENTRAL DEPOT TO NUMBER OF DELIVERY POINTS [J].
CLARKE, G ;
WRIGHT, JW .
OPERATIONS RESEARCH, 1964, 12 (04) :568-&
[7]  
Cordeau JF, 2002, J OPER RES SOC, V53, P512, DOI 10.1057/palgrave.jors.2601319
[8]   THE TRUCK DISPATCHING PROBLEM [J].
DANTZIG, GB ;
RAMSER, JH .
MANAGEMENT SCIENCE, 1959, 6 (01) :80-91
[9]   Ant system: Optimization by a colony of cooperating agents [J].
Dorigo, M ;
Maniezzo, V ;
Colorni, A .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 1996, 26 (01) :29-41
[10]  
Dorigo M., 1991, Positive feedback as a search strategy