Goal Programming Approach for Carrying People with Physical Disabilities

  • Oğuzhan Ahmet Arik Nuh Naci Yazgan University, Industrial Engineering Department, Kayseri, Turkey
  • Erkan Köse Nuh Naci Yazgan University
  • Gülçin Canbulut Nuh Naci Yazgan University, Industrial Engineering Department, Kayseri, Turkey
Keywords: mixed integer programming, goal programming, Analytic Hierarchy Process, humanitarian factors, dial-a-ride problem

Abstract

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.

Author Biography

Erkan Köse, Nuh Naci Yazgan University

Engineering Faculty, Industrial Engineering Department

References

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 request dial-a-ride problem with time windows. Transp Res Part B. 1986;20: 243-57. Available from: doi:10.1016/0191-2615(86)90020-2

Sutcliffe C, Board J. Optimal solution of a vehicle-routeing problem: Transporting mentally handicapped adults to an adult training centre. J Oper Res Soc. 1990;41: 61-7. Available from: doi:10.1057/jors.1990.7

Toth P, Vigo D. Heuristic algorithms for the handicapped persons transportation problem. Transp Sci. 1997;31: 60-71. Available from: doi:10.1287/trsc.31.1.60

Rekiek B, Delchambre A, Saleh HA. Handicapped Person Transportation: An application of the Grouping Genetic Algorithm. Eng Appl Artif Intell. 2006;19: 511-20. Available from: doi:10.1016/j.engappai.2005.12.013

Dumas Y, Desrosiers J, Soumis F. The pickup and delivery problem with time windows. Eur J Oper Res. 1991;54: 7-22. Available from: doi:10.1016/0377-2217(91)90319-Q

Donati AV, Montemanni R, Casagrande N, Rizzoli AE, Gambardella LM. Time dependent vehicle routing problem with a multi ant colony system. Eur J Oper Res. 2008;185: 1174-91. Available from: doi:10.1016/j.ejor.2006.06.047

Fleischmann B, Gnutzmann S, Sandvoß E. Dynamic vehicle routing based on online traffic information. Transp Sci. 2004;38: 420-33. Available from: doi:10.1287/trsc.1030.0074

Masson R, Ropke S, Lehuédé F, Péton O. A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes. Eur J Oper Res. 2014;236: 849-62. Available from: doi:10.1016/j.ejor.2013.08.042

Liu L, Yang J, Mu H, Li X, Wu F. Exact algorithms for multi-criteria multi-modal shortest path with transfer delaying and arriving time-window in urban transit network. Appl Math Model. 2014;38: 2613-29. Available from: doi:10.1016/j.apm.2013.10.059

Si B, Zhong M, Yang X, Gao Z. Urban transit assignment model based on augmented network with in-vehicle congestion and transfer congestion. J Syst Sci Syst Eng. 2011;20: 155-72. Available from: doi:10.1007/s11518-011-5159-9

Modesti P, Sciomachen A. A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks. Eur J Oper Res. 1998;111: 495-508. Available from: doi:10.1016/S0377-2217(97)00376-7

Saaty TL. How to make a decision: The analytic hierarchy process. Eur J Oper Res. 1990;48: 9-26. Available from: doi:10.1016/0377-2217(90)90057-I

Saaty TL. Fundamentals of Decision Making and Priority Theory With the Analytic Hierarchy Process. New York: McGraw Hill; 2000.

Published
2020-07-17
How to Cite
1.
Arik OA, Köse E, Canbulut G. Goal Programming Approach for Carrying People with Physical Disabilities . PROMET [Internet]. 2020Jul.17 [cited 2020Aug.7];32(4):585-94. Available from: https://traffic.fpz.hr/index.php/PROMTT/article/view/3461
Section
Articles