Erkan KÖSE, Hakan Soner APLAK, Sinan AYGÜN

DÜĞÜMLER ARASINDA DİREKT GİDİŞE MÜSAADE EDEN KAPASİTE KISITLI, ÇOK ATAMALI ANA DAĞITIM ÜSSÜ YER SEÇİM PROBLEMİ

Ana dağıtım üsleri (ADÜ) çoktan-çoğa dağıtım sistemlerinde toplama, sınıflandırma ve aktarma noktası olarak hizmet veren özel tesislerdir. ADÜ yer seçim problemlerinde, kaynak-varış noktaları arasındaki akışlar doğrudan birbirleri arasında değil, ölçek ekonomisinden faydalanmak amacıyla ana dağıtım üsleri aracılığıyla gerçekleştirilir. Bu sayede daha az bağlantı hattı ve daha düşük maliyetlerle daha fazla noktaya bağlantı sağlanmış olur. Bu çalışmada, bir kamu kurumuna yönelik gerçek bir ana dağıtım üssü yer seçim problemi ele alınmıştır. Kurumun talepleri ve problemin gereksinimlerinden yola çıkılarak, literatürde yer alan kapasite kısıtlı ve çok atamalı yapıya sahip ADÜ yer seçim problemlerine yeni boyut kazandırılmıştır. Literatürde yer alan çalışmalardan farklı olarak, ADÜ olarak seçilmeyen kaynak-varış çiftleri arasındaki akışlarda ADÜ kullanma zorunluluğu gevşetilmiş ve ADÜ olarak seçilen düğümlerin kapasitelerinin hem ADÜ, hem de ADÜ olarak seçilmeyen düğümlerden gelen akışlardan etkilenmesi sağlanmıştır.

CAPACITATED MULTIPLE ALLOCATION HUB LOCATION PROBLEM WHICH ALLOWS DIRECT FLOW BETWEEN NODES

Hubs are special facilities that serve as switching, transshipment and sorting points in many-to-many distribution systems. In hub location problems, transfers between origin-destination points do not take place directly between each other, but by means of hubs for the purpose of taking advantages of economies of scale. Thus, it becomes possible to provide connections to more points with less lines and costs. In this study, a real hub location problem is studied for a public institution. On the basis of the institutions demands and the problemsrequirements, a new dimension has been provided to the capacitated multiple allocation hub location problems which have significance in the literature. Unlike the studies conducted in the literature, obligation to use hubs among the origin-destination pairs that are unselected hub is relaxed and the capacities of nodes that are selected as hubs are provided to be affected by the flows both from the hubs and the spokes.

PDF

___

1. Marín, A., Formulating and Solving Splittable Capacitated Multiple Allocation Hub Location Problems, Computers & Operations Research, Cilt 32, No 12, 3093-3109, 2005.
2. O'kelly, M.E., The Location of Interacting Hub Facilities, Transportation Science, Cilt 20, No 2, 92-106, 1986.
3. O'kelly, M.E., A Quadratic Integer Program for the Location of Interacting Hub Facilities, European Journal of Operational Research, Cilt 32, No 3, 393-404, 1987.
4. Ernst, A.T. ve Krishnamoorthy M.. Efficient Algorithms for the Uncapacitated Single Allocation P-Hub Median Problem, Location Science, Cilt 4, No 3, 139-154, 1996.
5. Mayer, G. ve Wagner, B., HubLocator: an Exact Solution Method for the Multiple Allocation Hub Location Problem, Computers & Operations Research, Cilt 29, No 6, 715-739, 2002.
6. O'kelly, M.E., Hub Facility Location with Fixed Costs, Papers in Regional Science, Cilt 71, No 3, 293-306, 1992.
7. Campbell, J.F., Integer Programming Formulations of Discrete Hub Location Problems, European Journal of Operational Research, Cilt 72, No 2, 387-405, 1994.
8. Campbell, J.F., Hub Location and the P-Hub Median Problem, Operations Research, Cilt 44, No 6, 923-935, 1996.
9. Aykin, T., On a Quadratic Integer Program for the Location of Interacting Hub Facilities, European Journal of Operational Research, Cilt 46, No 3, 409-411, 1990.
10. Aykin, T., Lagrangean Relaxation Based Approaches to Capacitated Hub-and-Spoke Network Design Problem, European Journal of Operational Research, Cilt 79, No 3, 501- 523, 1994.
11. Aykin, T., Networking Policies for Hub-andSpoke Systems with Application to the Air Transportation System, Transportation Science, Cilt 29, No 3, 201-221, 1995a.
12. Aykin, T., The Hub Location and Routing Problem, European Journal of Operational Research, Cilt 83, No 1, 200-219, 1995b.
13. Klincewicz, J.G., Heuristics for the P-Hub Location Problem, European Journal of Operational Research, Cilt 53, No 1, 25-37, 1991.
14. Klincewicz, J.G., Avoiding Local Optima in the p-Hub Location Problem Using Tabu Search and GRASP, Annals of Operations Research, Cilt 40, No 1, 283-302, 1992.
15. Ebery, J., Krishnamoorthy, M., Ernst A. ve Boland N., The Capacitated Multiple Allocation Hub Location Problem: Formulations and Algorithms, European Journal of Operational Research, Cilt 120, No 3, 614-631, 2000.
16. Sasaki, M. ve Fukushima, M., On the Hub-andSpoke Model with Arc Capacity Constraints, Journal of the Operations Research Society of Japan, Cilt 46, No 4, 409-428, 2003.
17. Boland, N., Krishnamoorthy, M., Ernst, A.T. ve Ebery, J., Preprocessing and Cutting for Multiple Allocation Hub Location Problems, European Journal of Operational Research, Cilt 155, No 3, 638-653, 2004.
18. Rodriguez, V., Alvarez, M.J. ve Barcos, L., Hub Location Under Capacity Constraints, Transportation Research Part E: Logistics and Transportation Review, Cilt 43, No 5, 495-505, 2007.
19. Rodriguez-Martin, I. ve Salazar-Gonzalez, J.J., Solving a Capacitated Hub Location Problem, European Journal of Operational Research, Cilt 184, No 2, 468-479, 2008.
20. Gelareh, S. ve Pisinger, D., Fleet Deployment, Network Design and Hub Location of Liner Shipping Companies, Transportation Research Part E: Logistics and Transportation Review, Cilt 47, No 6, 947-964, 2011.
21. Sender, J. ve Clausen U., Heuristics for Solving a Capacitated Multiple Allocation Hub Location Problem with Application in German Wagonload Traffic, Electronic Notes in Discrete Mathematics, Cilt 41, 13-20, 2013.
22. Shahabi, M. ve Unnikrishnan, A., Robust Hub Network Design Problem, Transportation Research Part E: Logistics and Transportation Review, Cilt 70, 356-373, 2014.
23. Karimi, H. ve Setak, M., Proprietor and Customer Costs in the Incomplete Hub LocationRouting Network Topology, Applied Mathematical Modelling, Cilt 38, No 3, 1011- 1023, 2014.
24. O'kelly, M.E. ve Miller, H.J., The Hub Network Design Problem: a Review and Synthesis, Journal of Transport Geography, Cilt 2, No 1, 31-40, 1994.
25. Alumur, S. ve Kara, B.Y., Network Hub Location Problems: The State of the Art, European Journal of Operational Research, Cilt 190, No 1, 1-21, 2008.
26. Bryan, D.L. ve Okelly, M.E., Hub-and-Spoke Networks in Air Transportation: an Analytical Review, Journal of Regional Science, Cilt 39, No 2, 275-295, 1999.
27. Kara, B. Y. ve Tansel, B.C., The SingleAssignment Hub Covering Problem: Models and Linearizations, Journal of the Operational Research Society, Cilt 54, No 1, 59-64, 2003.
28. Ermiş, M. ve Ülengin, F., Merkez Üslerin Konumlandırılması Probleminin Hopfield-Tank Yapay Sinir Ağları ile Çözülmesi İTÜ Dergisi/D, Cilt 5, No 1, 228-238, 2006.
29. Özger, A. ve Oktal, H., Havayolu Kargo Taşımacılığında Kapasite Sınırı Olmayan Çok Atamalı P-Ana Dağıtım Üssü Medyan Problemine Tamsayılı Model Yaklaşımı, Journal of Aeronautics & Space Technologies/Havacilik ve Uzay Teknolojileri Dergisi, Cilt 4, No 1, 2008.
30. Karayolları Genel Müdürlüğü 11 Mart 2014, www.kgm.gov.tr/Sayfalar/KGM/Site Tr/ Root/ Uzakliklar.aspx.