You are here

Home » Content

ARAÇ ROTALAMA PROBLEMİNE AİT BİR UYGULAMA

Journal Name:

  • Süleyman Demirel Üniversitesi İktisadi ve İdari Bilimler Fakültesi Dergisi

Publication Year:

  • 2001

Keywords (Original Language):

Author NameUniversity of AuthorFaculty of Author
Bookmark/Search this post with
Abstract (Original Language): 
Araç Rotalama Problemi (ARP), merkezi bir depodan coğrafi olarak dağılmış çeşitli talep noktalarına dağıtım veya toplama rotalarının, araç filosunun kat ettiği toplam mesafeyi minimize edilecek şekilde bulunmasıdır. Çalışmada, ARP çözüm yöntemleri kullanılarak, Balıkesir Ordudonatım Okulu personel servis araçlarının toplam güzergah mesafesi minimize edilmeye çalışılmıştır. Problem çözümünde, sezgisel çözüm metotlarından tasarruf (savings) ve rassal tasarruf (randomized savings) algoritmaları ve VRP 328 yazılımı kullanılmıştır. Bulunan çözümler tur geliştirme algoritmalarıyla (2-opt ve Or-opt) daha iyi hale getirilmeye çalışılmış; elde edilen sonuçlar kendi aralarında ve mevcut durum ile karşılaştırılmıştır.
FULL TEXT (PDF): 
PDF icon arastirmax-arac-rotalama-problemine-ait-bir-uygulama.pdf
  • 1
139-155
  • Turkish

REFERENCES

References: 

1. LAPORTE, G., NOBERT, Y. and TAILLEFER, S., "Solving a Family of Multi-Depot Vehicle Routing and Location Routing Problems", Chaier du Gerad G-87-10, Ecole des Haltes Etudes Commercialse de Montreal, 1987.
2. SAVELSBERGH, M. W. P. and SOL, M., "The General Pick-up and Delivery Problem", Transportation Science 29, 17-29, 1995.
3. BOWERMAN, R. ; HALL, B. and CALOMAI, P. " A multi-objective Optimization Approach to Urban School Bus Routing: Formulation and Solution Method", Transportation Research Part A: Policy and Practice, 29(2), 107-123, 1995.
4. MAGNANTI, T. L., "Combinatorial Opt. And Vehicle Fleet Planning: Perspectives andProspects", Networks 11, 179-214, 1981.
5. FISHER, M. L. and JAIKUMAR R., "A Generalised Assignment Heuristic for VehicleRouting", Networks 11, 109-124, 1981.
6. CLARKE, G. and WRIGHT, J., "Scheduling of Vehicles from a Central Depot to a Number of Delivery Points", Operations Research 12(4), 568-581, 1964.
7. DANTZIG, G. and RANSER, J., "The Truck Dispatching Problem", Management Science 4, 407- 430, 1957.
8. GASKELL, T., "Bases for Vehicle Fleet Scheduling", Operations Research Quarterly 26, 717-734, 1975.
9. TILLMAN, F. and CAIN, T., "An Upper bounding Algorithm for the Single and Multiple Terminal Problem", Management Science 11, 664-682, 1972.
10. WREN, A. and HOLLIDAY, A., "Computer Scheduling of Vehicles from one or more Depots to a Number of Delivery Points", Operations Research Quarterly 3, 333-344, 1972.
11. YELLOW, P. , "A Computational Modification to the Savings Method of Vehicle Scheduling", Operations Research Quarterly 3, 281, 1970.
12. LIN, S., "Computer Solutions of Travelling Salesman Problem", Bell System Technical Journal 44, 2245-2269, 1965.
54
13. LENSTRA, J. K. and RINNOOY KAN, A. H. G. , "Some Simple Applications of the Travelling Salesman Problem", Operational Research Quarterly 26, 717-734, 1975.
14. GILLET, B. and MILLER, L., "A Heuristic Algorithm for the Vehicle Dispactching Problem", Operations Research, 22, 340-349, 1974.
15. CHRISTOFIDES, N., MINGOZZI A. And TOTH, P., "Exact Algorithms for the TSP with Additional Constraints" , Euro-4 Cong. Cambridge, England, 1980.
16. GOLDEN, B., "A Statistical Approach to the TSP", Networks 7, 209-225, 1977.
17. www. users.iems.nwu.edu/~msdaskin/

Thank you for copying data from http://www.arastirmax.com