Oğuzhan Ahmet Arik
Nuh Naci Yazgan University, Industrial Engineering Department, Kayseri, Turkey
Erkan Köse
Gülçin Canbulut
Nuh Naci Yazgan University, Industrial Engineering Department, Kayseri, Turkey
Most of today's optimization efforts aim to reduce costs, time or the number of resources used. However, optimization efforts should consider other factors as important as these, such as facilitating the lives of the disabled, elderly and pregnant and helping them in their daily lives. In this study, the Nuh Naci Yazgan (NNY) University (Kayseri/Turkey) personnel transport problems were discussed. The NNY University provides a shuttle service to bring employees to school at the start of the work and to leave them at home after work. In order to shorten the collection / distribution time and the total distance travelled, the service vehicle does not leave / pick up all employees in front of their homes. Instead, the employees are picked up / dropped at appropriate locations on an intuitively determined route. Since only the time and cost savings are taken into account when determining the service route, some employees have a long walking distance to the service route. This creates a very important problem, especially for the disabled and pregnant workers. In this study, a new mathematical model is proposed which takes into consideration the physical disadvantages and occupational positions of the employees in order to determine the shortest vehicle route. The results show that the proposed model can significantly reduce walking distances of physically disabled people without compromising the total distance travelled by the vehicle.
Raff S. Routing and scheduling of vehicles and crews: The state of the art. Comput Oper Res. 1983;10(2). Available from: doi:10.1016/0305-0548(83)90030-8
Cordeau J-F, Laporte G. The dial-a-ride problem: Models and algorithms. Ann Oper Res. 2007;153: 29-46. Available from: doi:10.1007/s10479-007-0170-8
Psaraftis HN. Dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. Transp Sci. 1980;14: 130-54. Available from: doi:10.1287/trsc.14.2.130
Psaraftis HN. Exact algorithm for the single vehicle many-to-many dial-a-ride problem with time windows. Transp Sci. 1983;17: 351-7. Available from: doi:10.1287/trsc.17.3.351
Desrosiers J, Dumas Y, Soumis F. A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows. Am J Math Manag Sci. 1986;6: 301-25. Available from: doi:10.1080/01966324.1986.10737198
Jaw J-J, Odoni AR, Psaraftis HN, Wilson NHM. A heuristic algorithm for the multi-vehicle advance req
Guest Editor: Eleonora Papadimitriou, PhD
Editors: Marko Matulin, PhD, Dario Babić, PhD, Marko Ševrović, PhD
Accelerating Discoveries in Traffic Science |
2024 © Promet - Traffic&Transportation journal