<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.4 20241031//EN"
        "https://jats.nlm.nih.gov/publishing/1.4/JATS-journalpublishing1-4.dtd">
<article  article-type="research-article"        dtd-version="1.4">
            <front>

                <journal-meta>
                                                                <journal-id>gummfd</journal-id>
            <journal-title-group>
                                                                                    <journal-title>Gazi Üniversitesi Mühendislik Mimarlık Fakültesi Dergisi</journal-title>
            </journal-title-group>
                            <issn pub-type="ppub">1300-1884</issn>
                                        <issn pub-type="epub">1304-4915</issn>
                                                                                            <publisher>
                    <publisher-name>Gazi Üniversitesi</publisher-name>
                </publisher>
                    </journal-meta>
                <article-meta>
                                        <article-id pub-id-type="doi">10.17341/gazimmfd.1716850</article-id>
                                                                <article-categories>
                                            <subj-group  xml:lang="en">
                                                            <subject>Industrial Engineering</subject>
                                                            <subject>Packaging, Storage and Transportation (Excl. Food and Agricultural Products)</subject>
                                                            <subject>Stochastic (Probability ) Process</subject>
                                                    </subj-group>
                                            <subj-group  xml:lang="tr">
                                                            <subject>Endüstri Mühendisliği</subject>
                                                            <subject>Paketleme, Depolama ve Taşımacılık (Gıda ve Tarım Ürünleri hariç)</subject>
                                                            <subject>Stokastik (Olasılıksal) Süreçler</subject>
                                                    </subj-group>
                                    </article-categories>
                                                                                                                                                        <title-group>
                                                                                                                        <article-title>İki aşamalı gürbüz tek atamalı p-Ana dağıtım üssü merkez ve açık uçlu rotalama problemi</article-title>
                                                                                                    </title-group>
            
                                                    <contrib-group content-type="authors">
                                                                        <contrib contrib-type="author">
                                                                    <contrib-id contrib-id-type="orcid">
                                        https://orcid.org/0000-0003-2903-7459</contrib-id>
                                                                <name>
                                    <surname>Evyapan</surname>
                                    <given-names>Merve</given-names>
                                </name>
                                                                    <aff>ESKİŞEHİR TEKNİK ÜNİVERSİTESİ</aff>
                                                            </contrib>
                                                    <contrib contrib-type="author">
                                                                    <contrib-id contrib-id-type="orcid">
                                        https://orcid.org/0000-0002-0076-7418</contrib-id>
                                                                <name>
                                    <surname>Kartal</surname>
                                    <given-names>Zühal</given-names>
                                </name>
                                                                    <aff>ESKİŞEHİR TEKNİK ÜNİVERSİTESİ</aff>
                                                            </contrib>
                                                    <contrib contrib-type="author">
                                                                    <contrib-id contrib-id-type="orcid">
                                        https://orcid.org/0000-0001-7249-1126</contrib-id>
                                                                <name>
                                    <surname>Kaya</surname>
                                    <given-names>Onur</given-names>
                                </name>
                                                                    <aff>ESKİŞEHİR TEKNİK ÜNİVERSİTESİ</aff>
                                                            </contrib>
                                                                                </contrib-group>
                        
                                        <pub-date pub-type="pub" iso-8601-date="20260331">
                    <day>03</day>
                    <month>31</month>
                    <year>2026</year>
                </pub-date>
                                        <volume>41</volume>
                                        <issue>1</issue>
                                        <fpage>549</fpage>
                                        <lpage>564</lpage>
                        
                        <history>
                                    <date date-type="received" iso-8601-date="20250611">
                        <day>06</day>
                        <month>11</month>
                        <year>2025</year>
                    </date>
                                                    <date date-type="accepted" iso-8601-date="20260116">
                        <day>01</day>
                        <month>16</month>
                        <year>2026</year>
                    </date>
                            </history>
                                        <permissions>
                    <copyright-statement>Copyright © 1986, Gazi Üniversitesi Mühendislik Mimarlık Fakültesi Dergisi</copyright-statement>
                    <copyright-year>1986</copyright-year>
                    <copyright-holder>Gazi Üniversitesi Mühendislik Mimarlık Fakültesi Dergisi</copyright-holder>
                </permissions>
            
                                                                                                <abstract><p>Bu çalışmada, Türkiye genelinde kargo taşımacılığı alanında karşılaşılan toplama-dağıtım sürecini doğrudan rotalar üzerinden gerçekleştiren bir yapıda, p-Ana Dağıtım Üssü (ADÜ) merkez yer seçimi ve açık uçlu araç rotalama kararlarını bütünleşik biçimde ele alan bir problem ele alınmıştır. Problemin amacı, herhangi bir kaynak-hedef noktası arasındaki maksimum seyahat süresini en aza indirerek dengeli ve etkin rotaların oluşturulmasını sağlamaktır. Bu amaçla öncelikle özgün bir karma tamsayılı matematiksel modelleme formülasyonu sunulmuştur. ADÜ yerlerinin belirlenmesi ve rotalama planlamasında, trafik sıkışıklığının etkisi çoğu zaman göz önüne alınmamakta, bu nedenle seyahat süreleri ideal koşullar altında sabit olarak değerlendirilmektedir. Ancak, seyahat süresindeki belirsizliklerin ADÜ yeri belirleme ve rotalama kararlarına entegre edilmesi, güvenilir bir dağıtım ağı tasarımı açısından kritik bir rol oynamaktadır. Bu kapsamda çalışmada ayrıca, taşıma sürecinde meydana gelebilecek gecikmelerin olasılığını dikkate alan çözümler üretmek amacıyla iki aşamalı bir gürbüz programlama modeli geliştirilmiş ve “İki Aşamalı Gürbüz Tek Atamalı p-ADÜ Merkez ve Açık Uçlu Rotalama Problemi” olarak literatüre sunulmuştur. Deterministik ve gürbüz modele ait duyarlılık analizleri CAB ve TR veri setleri üzerinde gerçekleştirilmiştir. Sonuçlar incelendiğinde, gerçek hayat trafik yoğunluğu gibi seyahat süresini etkileyebilecek faktörler gürbüz modele dahil edildiğinde, belirlenen ADÜ merkezlerinin konumları ve rotaların deterministik model sonuçlarından önemli ölçüde farklılaştığı görülmüştür. Bu bulgular, daha güvenilir lojistik dağıtım ağı tasarımları için belirsizliklerin karar süreçlerine entegre edilmesinin önemini ortaya koymaktadır.</p></abstract>
                                                            
            
                                                            <kwd-group>
                                                    <kwd>ADÜ Yer Seçimi Problemi ve Rotalama Problemi</kwd>
                                                    <kwd>  p-ADÜ Merkez ve Açık Uçlu Araç Rotalama Problemi</kwd>
                                                    <kwd>  Gürbüz Programlama</kwd>
                                                    <kwd>  İki Aşamalı Formülasyon</kwd>
                                            </kwd-group>
                            
                                                                                                                        </article-meta>
    </front>
    <back>
                            <ref-list>
                                    <ref id="ref1">
                        <label>1</label>
                        <mixed-citation publication-type="journal">1.	Yaman H., Kara B.Y., Tansel B.Ç., The last arrival hub location problem for cargo delivery systems with stopovers, Transportation Research Part B: Methodological, 41 (8), 906–919, 2007.</mixed-citation>
                    </ref>
                                    <ref id="ref2">
                        <label>2</label>
                        <mixed-citation publication-type="journal">2.	O’Kelly M.E., A Quadratic Integer-Program for the Location of Interacting Hub Facilities, European Journal of Operational Research, 32 (3), 393–404, 1987.</mixed-citation>
                    </ref>
                                    <ref id="ref3">
                        <label>3</label>
                        <mixed-citation publication-type="journal">3.	Campbell J.F., Integer programming formulations of discrete hub location problems, European Journal of Operational Research, 72 (2), 387–405, 1994.</mixed-citation>
                    </ref>
                                    <ref id="ref4">
                        <label>4</label>
                        <mixed-citation publication-type="journal">4.	Ernst A.T., Krishnamoorthy M., Efficient algorithms for the uncapacitated single allocation p-hub median problem, Location Science, 4 (3), 139–154, 1996.</mixed-citation>
                    </ref>
                                    <ref id="ref5">
                        <label>5</label>
                        <mixed-citation publication-type="journal">5.	Kartal Z., Hasgul S., Ernst A.T., Single allocation p-hub median location and routing problem with simultaneous pick-up and delivery, Transportation Research Part E: Logistics and Transportation Review, 108, 141–159, 2017.</mixed-citation>
                    </ref>
                                    <ref id="ref6">
                        <label>6</label>
                        <mixed-citation publication-type="journal">6.	Kartal Z., Krishnamoorthy M., Ernst A.T., Heuristic algorithms for the single allocation p-hub center problem with routing considerations, OR Spectrum, 41, 99–145, 2019.</mixed-citation>
                    </ref>
                                    <ref id="ref7">
                        <label>7</label>
                        <mixed-citation publication-type="journal">7.	Ibnoulouafi E.M., Oudani M., Aouam T., Ghogho M., The p-hub centre routing problem with emissions budget: Formulation and solution procedure, Computers &amp; Operations Research, 154, 2023.</mixed-citation>
                    </ref>
                                    <ref id="ref8">
                        <label>8</label>
                        <mixed-citation publication-type="journal">8.	Atasagun G.C., Karaoğlan İ., A mathematical model for the time dependent vehicle routing problem with simultaneous pick-up and delivery, Journal of the Faculty of Engineering and Architecture of Gazi University, 34 (4), 1743-1755, 2019.</mixed-citation>
                    </ref>
                                    <ref id="ref9">
                        <label>9</label>
                        <mixed-citation publication-type="journal">9.	Bayrak A., Özyörük B., Comparative mathematical models for split delivery simultaneous pickup and delivery, Journal of the Faculty of Engineering and Architecture of Gazi University, 32 (2), 469–479, 2017.</mixed-citation>
                    </ref>
                                    <ref id="ref10">
                        <label>10</label>
                        <mixed-citation publication-type="journal">10.	Rahmati R., Bashiri M., Nikzad E., Siadat A., A two-stage robust hub location problem with accelerated Benders decomposition algorithm, International Journal of Production Research, 60 (17), 5235–5257, 2022.</mixed-citation>
                    </ref>
                                    <ref id="ref11">
                        <label>11</label>
                        <mixed-citation publication-type="journal">11.	Ben-Tal A., Goryashko A., Guslitzer E., Nemirovski A., Adjustable robust solutions of uncertain linear programs, Mathematical Programming, 99 (2), 351–376, 2004.</mixed-citation>
                    </ref>
                                    <ref id="ref12">
                        <label>12</label>
                        <mixed-citation publication-type="journal">12.	Goldman A.J., Optimal locations for centers in a network, Transportation Science, 3 (4), 352–360, 1969.</mixed-citation>
                    </ref>
                                    <ref id="ref13">
                        <label>13</label>
                        <mixed-citation publication-type="journal">13.	Ebery J., Solving large single allocation p-hub problems with two or three hubs, European Journal of Operational Research, 128 (2), 447–458, 2001.</mixed-citation>
                    </ref>
                                    <ref id="ref14">
                        <label>14</label>
                        <mixed-citation publication-type="journal">14.	Kara B.Y., Tansel B.C., On the single-assignment p-hub center problem, European Journal of Operational Research, 125 (3), 648–655, 2000.</mixed-citation>
                    </ref>
                                    <ref id="ref15">
                        <label>15</label>
                        <mixed-citation publication-type="journal">15.	Ernst A.T., Hamacher H., Jiang H.Y., Krishnamoorthy M., Woeginger G., Uncapacitated single and multiple allocation p-hub center problems, CSIRO Math. Inf. Sci., Australia, Unpublished Report, 2002.</mixed-citation>
                    </ref>
                                    <ref id="ref16">
                        <label>16</label>
                        <mixed-citation publication-type="journal">16.	Ernst A.T., Hamacher H., Jiang H., Krishnamoorthy M., Woeginger G., Heuristic algorithms for the uncapacitated hub center single allocation problem, CSIRO Mathematical and Information Sciences, Australia, Unpublished Report, 2002.</mixed-citation>
                    </ref>
                                    <ref id="ref17">
                        <label>17</label>
                        <mixed-citation publication-type="journal">17.	Kara B.Y., Tansel B.C., The single-assignment hub covering problem: models and linearizations, Journal of the Operational Research Society, 54, 59–64, 2003.</mixed-citation>
                    </ref>
                                    <ref id="ref18">
                        <label>18</label>
                        <mixed-citation publication-type="journal">18.	Ernst A.T., Jiang H., Krishnamoorthy M., Reformulations and computational results for uncapacitated single and multiple allocation hub covering problems, CSIRO Mathematical and Information Sciences, Australia, Unpublished Report, 2005.</mixed-citation>
                    </ref>
                                    <ref id="ref19">
                        <label>19</label>
                        <mixed-citation publication-type="journal">19.	Alumur S., Kara B.Y., Network hub location problems: the state of the art, European Journal of Operational Research, 190 (1), 1–21, 2008.</mixed-citation>
                    </ref>
                                    <ref id="ref20">
                        <label>20</label>
                        <mixed-citation publication-type="journal">20.	Alumur S.A., Campbell J.F., Contreras I., Kara B.Y., Marianov V., O’Kelly M.E., Perspectives on modeling hub location problems, European Journal of Operational Research, 291 (1), 1–17, 2021.</mixed-citation>
                    </ref>
                                    <ref id="ref21">
                        <label>21</label>
                        <mixed-citation publication-type="journal">21.	Rodríguez-Martín I., Salazar-González J.-J., Yaman H., A branch-and-cut algorithm for the hub location and routing problem, Computers &amp; Operations Research, 50, 161–174, 2014.</mixed-citation>
                    </ref>
                                    <ref id="ref22">
                        <label>22</label>
                        <mixed-citation publication-type="journal">22.	Gao C.-F., Hu Z.-H., Wang Y.-Z., Optimizing the hub-and-spoke network with drone-based traveling salesman problem, Drones, 7 (1), 6, 2022.</mixed-citation>
                    </ref>
                                    <ref id="ref23">
                        <label>23</label>
                        <mixed-citation publication-type="journal">23.	Aloullal A., Saldanha-da Gama F., Todosijević R., Multi-period single-allocation hub location-routing: Models and heuristic solutions, European Journal of Operational Research, 310 (1), 53–70, 2023.</mixed-citation>
                    </ref>
                                    <ref id="ref24">
                        <label>24</label>
                        <mixed-citation publication-type="journal">24.	Kartal Z., Integrated hub location and capacitated vehicle routing problem over incomplete hub networks, International Journal of Industrial Engineering: Theory, Applications and Practice, 30 (1), 2023.</mixed-citation>
                    </ref>
                                    <ref id="ref25">
                        <label>25</label>
                        <mixed-citation publication-type="journal">25.	Pourmohammadi P., Tavakkoli-Moghaddam R., Rahimi Y., Triki C., Solving a hub location-routing problem with a queue system under social responsibility by a fuzzy meta-heuristic algorithm, Annals of Operations Research, 324, 1099-1128, 2023. 
26.	de Camargo R.S., de Miranda G., Løkketangen A., A new formulation and an exact approach for the many-to-many hub location-routing problem, Applied Mathematical Modelling, 37 (12–13), 7465–7480, 2013.</mixed-citation>
                    </ref>
                                    <ref id="ref26">
                        <label>26</label>
                        <mixed-citation publication-type="journal">27.	Bostel N., Dejax P., Zhang M., A model and a metaheuristic method for the hub location routing problem and application to postal services, 2015 International Conference on Industrial Engineering and Systems Management (IESM), Seville-Spain, 1383–1389, 2015.</mixed-citation>
                    </ref>
                                    <ref id="ref27">
                        <label>27</label>
                        <mixed-citation publication-type="journal">28.	Abbasi M., Mokhtari N., Shahvar H., Mahmoudi A., Application of variable neighborhood search for solving large-scale many to many hub location routing problems, Journal of Advances in Management Research, 16 (5), 683–697, 2019.</mixed-citation>
                    </ref>
                                    <ref id="ref28">
                        <label>28</label>
                        <mixed-citation publication-type="journal">29.	Danach K., Gelareh S., Monemi R.N., The capacitated single-allocation p-hub location routing problem: a Lagrangian relaxation and a hyper-heuristic approach, EURO Journal on Transportation and Logistics, 8 (5), 597–631, 2019.</mixed-citation>
                    </ref>
                                    <ref id="ref29">
                        <label>29</label>
                        <mixed-citation publication-type="journal">30.	Wu Y., Qureshi A.G., Yamada T., Yu S., Branch-and-price-and-cut algorithm for the capacitated single allocation hub location routeing problem, Journal of the Operational Research Society, 75 (2), 2023.</mixed-citation>
                    </ref>
                                    <ref id="ref30">
                        <label>30</label>
                        <mixed-citation publication-type="journal">31.	Wandelt S., Wang S., Sun X., A literature review on hub location-routing models and their solution techniques, Computers &amp; Operations Research, 173, 106861, 2025.</mixed-citation>
                    </ref>
                                    <ref id="ref31">
                        <label>31</label>
                        <mixed-citation publication-type="journal">32.	Kartal Z., Ernst A.T., Integer programming formulations for the uncapacitated vehicle routing p-hub center problem, 21st International Congress on Modelling and Simulation, Gold Coast, 1724–1730, 2015.</mixed-citation>
                    </ref>
                                    <ref id="ref32">
                        <label>32</label>
                        <mixed-citation publication-type="journal">33.	Kassoumeh A.K., Kartal Z., Arslan A., The Effect of Different Initial Solutions on the Metaheuristic Algorithms for the Single Allocation p-Hub Center and Routing Problem, PeerJ Computer Science, 11: e2840.</mixed-citation>
                    </ref>
                                    <ref id="ref33">
                        <label>33</label>
                        <mixed-citation publication-type="journal">34.	Marianov V., Serra D., Location models for airline hubs behaving as M/D/c queues, Computers &amp; Operations Research, 30 (7), 983–1003, 2003.</mixed-citation>
                    </ref>
                                    <ref id="ref34">
                        <label>34</label>
                        <mixed-citation publication-type="journal">35.	Yang T.H., Stochastic air freight hub location and flight routes planning, Applied Mathematical Modelling, 33 (12), 4424–4430, 2009.</mixed-citation>
                    </ref>
                                    <ref id="ref35">
                        <label>35</label>
                        <mixed-citation publication-type="journal">36.	Sim T., Lowe T.J., Thomas B.W., The stochastic p-hub center problem with service-level constraints, Computers &amp; Operations Research, 36 (12), 3166–3177, 2009.</mixed-citation>
                    </ref>
                                    <ref id="ref36">
                        <label>36</label>
                        <mixed-citation publication-type="journal">37.	Contreras I., Cordeau J.-F., Laporte G., Stochastic uncapacitated hub location, European Journal of Operational Research, 212 (3), 518–528, 2011.</mixed-citation>
                    </ref>
                                    <ref id="ref37">
                        <label>37</label>
                        <mixed-citation publication-type="journal">38.	Alumur S.A., Nickel S., Saldanha-da-Gama F., Hub location under uncertainty, Transportation Research Part B: Methodological, 46 (4), 529–543, 2012.</mixed-citation>
                    </ref>
                                    <ref id="ref38">
                        <label>38</label>
                        <mixed-citation publication-type="journal">39.	Mohammadi M., Jula P., Tavakkoli-Moghaddam R., Reliable single-allocation hub location problem with disruptions, Transportation Research Part E: Logistics and Transportation Review, 123, 90–120, 2019.</mixed-citation>
                    </ref>
                                    <ref id="ref39">
                        <label>39</label>
                        <mixed-citation publication-type="journal">40.	Mulvey J.M., Ruszczynski A., A new scenario decomposition method for large-scale stochastic optimization, Operations Research, 43 (3), 477, 1995.</mixed-citation>
                    </ref>
                                    <ref id="ref40">
                        <label>40</label>
                        <mixed-citation publication-type="journal">41.	Yu C., Li H., A robust optimization model for stochastic logistic problems, International Journal of Production Economics, 64 (1–3), 385–397, 2000.</mixed-citation>
                    </ref>
                                    <ref id="ref41">
                        <label>41</label>
                        <mixed-citation publication-type="journal">42.	Shahabi M., Unnikrishnan A., Robust hub network design problem, Transportation Research Part E: Logistics and Transportation Review, 70, 356–373, 2014.</mixed-citation>
                    </ref>
                                    <ref id="ref42">
                        <label>42</label>
                        <mixed-citation publication-type="journal">43.	Ghaffari-Nasab N., Ghazanfari M., Teimoury E., Robust optimization approach to the design of hub-and-spoke networks, International Journal of Advanced Manufacturing Technology, 76, 1091–1100, 2015.</mixed-citation>
                    </ref>
                                    <ref id="ref43">
                        <label>43</label>
                        <mixed-citation publication-type="journal">44.	Habibzadeh Boukani F., Farhang Moghaddam B., Pishvaee M.S., Robust optimization approach to capacitated single and multiple allocation hub location problems, Computational and Applied Mathematics, 35 (1), 45–60, 2016.</mixed-citation>
                    </ref>
                                    <ref id="ref44">
                        <label>44</label>
                        <mixed-citation publication-type="journal">45.	Merakli M., Yaman H., Robust intermodal hub location under polyhedral demand uncertainty, Transportation Research Part B: Methodological, 86, 66–85, 2016.</mixed-citation>
                    </ref>
                                    <ref id="ref45">
                        <label>45</label>
                        <mixed-citation publication-type="journal">46.	Merakli M., Yaman H., A capacitated hub location problem under hose demand uncertainty, Computers &amp; Operations Research, 88, 58–70, 2017.</mixed-citation>
                    </ref>
                                    <ref id="ref46">
                        <label>46</label>
                        <mixed-citation publication-type="journal">47.	Zetina C.A., Contreras I., Cordeau J.-F., Nikbakhsh E., Robust uncapacitated hub location, Transportation Research Part B: Methodological, 106, 393–410, 2017.</mixed-citation>
                    </ref>
                                    <ref id="ref47">
                        <label>47</label>
                        <mixed-citation publication-type="journal">48.	de Sá M., Morabito R., de Camargo R.S., Efficient Benders decomposition algorithms for the robust multiple allocation incomplete hub location problem with service time requirements, Expert Systems with Applications, 93, 50–61, 2018.</mixed-citation>
                    </ref>
                                    <ref id="ref48">
                        <label>48</label>
                        <mixed-citation publication-type="journal">49.	Ghaffarinasab N., An efficient matheuristic for the robust multiple allocation p-hub median problem under polyhedral demand uncertainty, Computers &amp; Operations Research, 97, 31–47, 2018.</mixed-citation>
                    </ref>
                                    <ref id="ref49">
                        <label>49</label>
                        <mixed-citation publication-type="journal">50.	Rahmati R., Bashiri M., Robust hub location problem with uncertain inter hub flow discount factor, International Conference on Industrial Engineering and Operations Management (IEOM), Paris-France, 2018.</mixed-citation>
                    </ref>
                                    <ref id="ref50">
                        <label>50</label>
                        <mixed-citation publication-type="journal">51.	Araghi M.E.T., Tavakkoli-Moghaddam R., Jolai F., Hadji Molana S.M., A green multi-facilities open location-routing problem with planar facility locations and uncertain customer, Journal of Cleaner Production, 282, 124343, 2021.</mixed-citation>
                    </ref>
                                    <ref id="ref51">
                        <label>51</label>
                        <mixed-citation publication-type="journal">52.	Wang C., Liu Y., Yang G., Adaptive distributionally robust hub location and routing problem with a third-party logistics strategy, Socio-Economic Planning Sciences, 87, 2023.</mixed-citation>
                    </ref>
                                    <ref id="ref52">
                        <label>52</label>
                        <mixed-citation publication-type="journal">53.	Tan P.Z., Kara B.Y., A hub covering model for cargo delivery systems, Networks, 49 (1), 28–39, 2007.</mixed-citation>
                    </ref>
                            </ref-list>
                    </back>
    </article>
