TY  - JOUR
TT  - AN ANALYSIS  OF VEHICLE APPOINTMENT PROBLEM  THROUGH LINEAR PROGRAMMING
AU  - Atan, Murat
AU  - Şimşek, Pınar
PY  - 2017
DA  - September
JF  - Gazi Üniversitesi Sosyal Bilimler Dergisi
JO  - ASBİDER
PB  - Ankara Hacı Bayram Veli Üniversitesi
WT  - DergiPark
SN  - 2148-8924
SP  - 339
EP  - 358
VL  - 4
IS  - 11
KW  - Araç Atama Problemi
KW  - Doğrusal Programlama
KW  - Ulaştırma Modeli
KW  - Atama Modeli
N2  - Vehicle appointment problem is the problem of determining the necessary routes for fleet vehicles of the same or different capacities and kept in a central car depot in order for them to return to the depot in such a way to minimize the total travel distance and travel time after having served a set of customers, each of whom are from a different location and   have   a   notified   demand.  The   basic   aims   of   the   study   were   analyzing   the transportation system and stopping places, and sorting out the  best solutions about the routes and the kind of vehicles to be used in each route.In the study, the problem related to a private personnel vehicles company’s providing service  for  25  stops  in  five  different  routes  in  Ankara  for  the  personnel  working  in  a public institution was formulated. The personnel can be transported in a shorter time and with less fuel consumption. In the current practice, the daily travelled distance decreased from  350  km  to  282  km.  In  spite  of  this  decrease,  the number  of  dispatched  vehicles increased and the efficient use of resources and costs have been economized. As a result of  the  study,  10  stops  were  identified  and  with  the  suggested  solution  a  10,42%  cost reduction  (annual  13.634,28  ₺)  was  achieved.  The  annual  cost  of  825.415,8  ₺  was reduced to 817.965,72 ₺. The annual profit increased to be 13.634,28 ₺. The study aimed at finding the most cost-efficient solution which would ensure the target service, service quality,  and  personnel  satisfaction.  The  study  was  implemented  in  a  transportation company in Ankara.
CR  - Ai,  J.,  Kachitvichyanukul,  V.  (2009).  A  Particle  Swarm  Optimization  for  the  Vehicle  Routing Problem with Simultaneous Pickup and Delivery. Computers & Operations Research, 36: 5, 1693 -1702.
CR  - Bektaş, T. ve S. Elmastaş (2004). Okul Araç Rotalama Probleminin Tamsayılı Programlama ile Çözümü”,  24. Yöneylem  Araştırması  /Endüstri  Mühendisliği  Ulusal  Kongresi YA/EM’2004’nde Sunulan Bildiri, 15 -18 Haziran, Gaziantep–
Adana, 3.
CR  - Bowerman, R., B. Hall ve P. Calamai, (1995a). A Multiobjective Optimization Approach to Urban School  Bus  Routing:  Formulation  and  Solution  Method,  University  of  Waterloo, Waterloo, ON, Canada, 13.
CR  - Braca, J., J. Bramel, B. Posner, ve D. Simchi-Levi (1997). A Computerized Approach to the New York City School Bus Routing Problem” IIE Transactions, Cilt No 29, Sayı 8, 693 -702.
CR  - Bodin,  L.  ve  L.  Berman  (1979).  Routing  and  Scheduling  of  School  Busses  by  Computer, “Transportation Science” Cilt No 13, Sayı 2, 113 -129.
CR  - Chapleau, L., Ferland, J., Rousseau, J. (1985). Clustering for Routing in Densely Populated Areas. European Journal of Operational Research, 20: 48 -57.
CR  - Dantzig G.B., Ramser J. H. (1959). The Truck Dispatching Problem, Management Science, 6.
CR  - Demiral,  M.  F.  (2008). Servis Araçlarının Rotalanmasında Optimizasyon  ve  Bir  Uygulama,  Y. Lisans  Tezi,  Süleyman  Demirel  Üniversitesi,  Sosyal  Bilimler  Enstitüsü  İşletme Anabilim Dalı, Yüksek Lisans Tezi, Isparta, 2.
CR  - Dulac, G., Ferland, J., Fogues, P. A. (1980). School Bus Routes Generator in Urban Surroundings. Computers and Operations Research, 7:199 -213.
CR  - Laporte, G., Nobert, S. Y., Taillefer (1987). Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems, Transportation Science, Cilt No 22, Sayı 3, 161.
CR  - Lee, S. ve L. Moore (1977). Multi-Criteria School Bussing Models, Management Science, Cilt No 23, Sayı 7, 705.
CR  - Li, L. ve Fu, Z., (2002). The School Bus Routing Problem: A Case Study. Journal of Operations Resource Society,
53: 552 -558.
CR  - Montané, T, F, A., Galvão, R, D. (2006). A Tabu Search Algorithm  for  the  Vehicle  Routing Problem with Simultaneous Pick-up and Delivery Service. Computers and Operations Research 33: 3, 595 –619.
CR  - Spada, M., M. Bierlaire, TH. M. Liebling (2005). Decision-Aiding Methodology for the School Bus Routing and Scheduling Problem”, Tranportation Science, Cilt No 39, Sayı 4, 477 -490.
CR  - Swersey, A. J. ve W. Ballard (1984). Scheduling School Buses”, Management Science, Cilt No 30, Sayı 7, 844 -853.
CR  - Timor,  M.  (2001).  Yöneylem  Araştırması  ve  İsletmecilik  Uygulamaları, İstanbul:  İstanbul Üniversitesi Basımevi Müdürlüğü, 128.
CR  - Toth,  P.,  Vigo,  D.,  (2002),  The  Vehicle  Routing  Problem,  Society  for  Industrial  and  Applied Mathematics, Philadelphia.
CR  - Winston,  W.  L.  (1994).  Operations  Research:  Applications  and  Algorithms,  Duxbury Press, California.
UR  - https://dergipark.org.tr/tr/pub/gusbd/issue//341424
L1  - https://dergipark.org.tr/tr/download/article-file/346635
ER  -