Heuristic Solutions for a Class of Stochastic Uncapacitated p-Hub Median Problems

References

• Abdinnour-Helm S (1998) A hybrid heuristic for the uncapacitated hub location problem. Eur. J. Oper. Res. 106(2/3):489–499.Crossref, Google Scholar
• Abdinnour-Helm S, Venkataramanan MA (1998) Solution approaches to hub location problems. Ann. Oper. Res. 78:31–50.Crossref, Google Scholar
• Albareda-Sambola M, Alonso-Ayuso A, Escudero LF, Fernández E, Pizarro C (2013) Fix-and-relax-coordination for a multi-period location–allocation problem under uncertainty. Comput. Oper. Res. 40(12):2878–2892.Crossref, Google Scholar
• Alonso-Ayuso A, Escudero LF, Ortuño MT (2003) BFC, a branch-and-fix coordination algorithmic framework for solving stochastic 0–1 programs. Eur. J. Oper. Res. 151(3):503–519.Crossref, Google Scholar
• Alumur S, Kara BY (2008) Network hub location problems: The state of the art. Eur. J. Oper. Res. 190(1):1–21.Crossref, Google Scholar
• Alumur S, Serper EZ (2016) The design of capacitated intermodal hub networks with different vehicle types. Transportation Res. B: Methodological 86:51–65.Crossref, Google Scholar
• Alumur S, Nickel S, Saldanha-da-Gama F (2012) Hub location under uncertainty. Transportation Res. B: Methodological 46(4):529–543.Crossref, Google Scholar
• Alumur SA, Kara BY, Karasan OE (2009) The design of single allocation incomplete hub networks. Transportation Res. B: Methodological 43(10):936–951.Crossref, Google Scholar
• Aykin T (1994) Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem. Eur. J. Oper. Res. 79(3):501–523.Crossref, Google Scholar
• Aykin T (1995a) The hub location and routing problem. Eur. J. Oper. Res. 83(1):200–219.Crossref, Google Scholar
• Aykin T (1995b) Networking policies for hub-and-spoke systems with application to the air transportation system. Transportation Sci. 29(3):201–221.Link, Google Scholar
• Bianchi L, Dorigo M, Gambardella LM, Gutjahr WJ (2009) A survey on metaheuristics for stochastic combinatorial optimization. Natural Comput. 8(2):239–287.Crossref, Google Scholar
• Bollapragada R, Camm J, Rao US, Wu J (2005) A two-phase greedy algorithm to locate and allocate hubs for fixed-wireless broadband access. Oper. Res. Lett. 33(2):134–142.Crossref, Google Scholar
• Bryan D (1998) Extensions to the hub location problem: Formulations and numerical examples. Geographical Anal. 30(4):315–330.Crossref, Google Scholar
• Calık H, Alumur SA, Kara BY, Karasan OE (2009) A tabu-based heuristic for the hub covering problem over incomplete hub networks. Comput. Oper. Res. 36(12):3088–3096.Crossref, Google Scholar
• Camargo RS, Miranda G Jr, O’Kelly ME, Campbell JF (2017) Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints. Appl. Math. Model. 51:274–301.Crossref, Google Scholar
• Campbell JF (1996) Hub location and the p-hub median problem. Oper. Res. 44(6):923–935.Link, Google Scholar
• Campbell JF, O’Kelly ME (2012) Twenty-five years of hub location research. Transportation Sci. 46(2):153–169.Link, Google Scholar
• Campbell JF, Ernst AT, Krishnamoorthy M (2005a) Hub arc location problems: Part I—Introduction and results. Management Sci. 51(10):1540–1555.Link, Google Scholar
• Campbell JF, Ernst AT, Krishnamoorthy M (2005b) Hub arc location problems: Part II—Formulations and optimal algorithms. Management Sci. 51(10):1556–1571.Link, Google Scholar
• Casement CJ, Kahle DJ (2018) Graphical prior elicitation in univariate models. Comm. Statist. Simulation Comput. 47(10):2906–2924.Crossref, Google Scholar
• Chen J (2007) A hybrid heuristic for the uncapacitated single allocation hub location problem. Omega 35(2):211–220.Crossref, Google Scholar
• Contreras I (2015) Hub location problems. Laporte G, Nickel S, Saldanha-da-Gama F, eds. Location Science (Springer International Publishing, Cham, Switzerland), 311–344.Crossref, Google Scholar
• Contreras I, Cordeau J-F, Laporte G (2011) Stochastic uncapacitated hub location. Eur. J. Oper. Res. 212(3):518–528.Crossref, Google Scholar
• Contreras I, Díaz JA, Fernández E (2009) Lagrangean relaxation for the capacitated hub location problem with single assignment. OR Spectrum 31(3):483–505.Crossref, Google Scholar
• Contreras I, Díaz JA, Fernández E (2011) Branch and price for large-scale capacitated hub location problems with single assignment. INFORMS J. Comput. 23(1):41–55.Link, Google Scholar
• Correia I, Nickel S, Saldanha-da-Gama F (2018) A stochastic multi-period capacitated multiple allocation hub location problem: Formulation and inequalities. Omega 74:122–134.Crossref, Google Scholar
• Cunha CB, Silva MR (2007) A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil. Eur. J. Oper. Res. 179(3):747–758.Crossref, Google Scholar
• Dillenberger Ch, Escudero LF, Wollensak A, Zang W (1994) On practical resource allocation for production planning and scheduling with period overlapping setups. Eur. J. Oper. Res. 75(2):275–286.Crossref, Google Scholar
• Eiselt HA, Marianov V (2009) A conditional p-hub location problem with attraction functions. Comput. Oper. Res. 36(12):3128–3135.Crossref, Google Scholar
• Ernst AT, Krishnamoorthy M (1996) Efficient algorithms for the uncapacitated single allocation p-hub median problem. Location Sci. 4(3):139–154.Crossref, Google Scholar
• Ernst AT, Krishnamoorthy M (1999) Solution algorithms for the capacitated single allocation hub location problem. Ann. Oper. Res. 86:141–159.Crossref, Google Scholar
• Escudero LF, Salmerón J (2005) Fix-and-relax partitioning. An algorithmic framework for large-scale resource constrained project selection and scheduling. Ann. Oper. Res. 140(1):163–188.Crossref, Google Scholar
• Gao Y, Qin Z (2016) A chance constrained programming approach for uncertain p-hub center location problem. Comput. Indust. Engrg. 102:10–20.Crossref, Google Scholar
• Glover F, Laguna M (1997) Tabu Search (Kluwer, Norwell, MA).Crossref, Google Scholar
• Ilić A, Urošević D, Brimberg J, Mladenović N (2010) A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem. Eur. J. Oper. Res. 206(2):289–300.Crossref, Google Scholar
• Klincewicz J (1992) Avoiding local optima in the p-hub location problem using tabu search and GRASP. Ann. Oper. Res. 40(1):283–302.Crossref, Google Scholar
• Kratica J, Milanović M, Stanimirović ZZ, Tošić D (2011) An evolutionary-based approach for solving a capacitated hub location problem. Appl. Soft Comput. 11(2):1858–1866.Crossref, Google Scholar
• Kratica J, Stanimirović Z, Tošić D, Filipović V (2007) Two genetic algorithms for solving the uncapacitated single allocation p-hub median problem. Eur. J. Oper. Res. 182(1):15–28.Crossref, Google Scholar
• Kratica J, Stanimirović Z, Tošić D, Filipović V (2012) Genetic algorithm for solving uncapacitated multiple allocation hub location problem. Comput. Inform. 24(4):415–426.Google Scholar
• Lüer-Villagra A, Marianov V (2013) A competitive hub location and pricing problem. Eur. J. Oper. Res. 231(3):734–744.Crossref, Google Scholar
• Marianov V, Serra D (2003) Location models for airline hubs behaving as M/D/c queues. Comput. Oper. Res. 30(7):983–1003.Crossref, Google Scholar
• Marianov V, Serra D, ReVelle C (1999) Location of hubs in a competitive environment. Eur. J. Oper. Res. 114(2):363–371.Crossref, Google Scholar
• Martí R, Corberán Á, Peiró J (2015) Scatter search for an uncapacitated p-hub median problem. Comput. Oper. Res. 58:53–66.Crossref, Google Scholar
• Meraklı M, Yaman H (2016) Robust intermodal hub location under polyhedral demand uncertainty. Transportation Res. Part B: Methodological 86:66–85.Crossref, Google Scholar
• Meyer T, Ernst AT, Krishnamoorthy M (2009) A 2-phase algorithm for solving the single allocation p-hub center problem. Comput. Oper. Res. 36(12):3143–3151.Crossref, Google Scholar
• Mohammadi M, Jolai F, Tavakkoli-Moghaddam R (2013) Solving a new stochastic multi-mode p-hub covering location problem considering risk by a novel multi-objective algorithm. Appl. Math. Model. 37(24):10053–10073.Crossref, Google Scholar
• Mohammadi M, Torabi SA, Tavakkoli-Moghaddam R (2014) Sustainable hub location under mixed uncertainty. Transportation Res. Part E: Logist. Transportation Rev. 62:89–115.Crossref, Google Scholar
• Nickel S, Schobel A, Sonneborn T (2001) Hub location problems in urban traffic networks. Niittymaki J, Pursula M, eds. Mathematics Methods and Optimization in Transportation Systems (Springer, New York), 95–107.Crossref, Google Scholar
• Oakley J (2017) SHELF: Tools to Support the Sheffield Elicitation Framework (R package). Accessed January 4, 2019, https://github.com/OakleyJ/SHELF.Google Scholar
• O’Hagan A (1998) Eliciting expert beliefs in substantial practical applications. J. Roy. Statist. Soc. Ser. D, Statistician 47(1):21–35.Crossref, Google Scholar
• O’Kelly ME (1987) A quadratic integer program for the location of interacting hub facilities. Eur. J. Oper. Res. 32(3):393–404.Crossref, Google Scholar
• O’Kelly ME, Bryan D (1998) Hub location with flow economies of scale. Transportation Res. Part B: Methodological 32(8):605–616.Crossref, Google Scholar
• O’Kelly ME, Campbell JF, Camargo RS, Miranda G Jr (2015) Multiple allocation hub location model with fixed arc costs. Geographical Anal. 47(1):73–96.Crossref, Google Scholar
• Pamuk FS, Sepil C (2001) A solution to the hub center problem via a single-relocation algorithm with tabu search. IIE Trans. 33(5):399–411.Crossref, Google Scholar
• Peiró J, Corberán Á, Martí R (2014) GRASP for the uncapacitated r-allocation p-hub median problem. Comput. Oper. Res. 43:50–60.Crossref, Google Scholar
• Peker M, Kara BY, Campbell JF, Alumur SA (2016) Spatial analysis of single allocation hub location problems. Networks Spatial Econom. 16(4):1075–1101.Crossref, Google Scholar
• Pirkul H, Schilling DA (1998) An efficient procedure for designing single allocation hub and spoke systems. Management Sci. 44(12‐ part‐2):S235–S242.Link, Google Scholar
• Randall M (2008) Solution approaches for the capacitated single allocation hub location problem using ant colony optimization. Comput. Optim. Appl. 39(2):239–261.Crossref, Google Scholar
• Rodríguez-Martín I, Salazar-González JJ (2006) An iterated local search heuristic for a capacitated hub location problem. Almeida et al., eds. Hybrid Metaheuristics. HM 2006, Lecture Notes in Computer Science, vol 4030 (Springer, Berlin, Heidelberg).Crossref, Google Scholar
• Rosing KE, ReVelle CS (1997) Heuristic concentration: Two stage solution construction. Eur. J. Oper. Res. 97(1):75–86.Crossref, Google Scholar
• Sadeghi M, Jolai F, Tavakkoli-Moghaddam R, Rahimi Y (2015) A new stochastic approach for a reliable p-hub covering location problem. Comput. Indust. Engrg. 90:371–380.Crossref, Google Scholar
• Sasaki M, Suzuki A, Drezner Z (1999) On the selection of hub airports for an airline hub-and-spoke system. Comput. Oper. Res. 26(14):1411–1422.Crossref, Google Scholar
• Silva MR, Cunha CB (2009) New simple and efficient heuristics for the uncapacitated single allocation hub location problem. Comput. Oper. Res. 36(12):3152–3165.Crossref, Google Scholar
• Sim T, Lowe TJ, Thomas BW (2009) The stochasticp-hub center problem with service-level constraints. Comput. Oper. Res. 36(12):3166–3177.Crossref, Google Scholar
• Smith K, Krishnamoorthy M, Palaniswami M (1996) Neural versus traditional approaches to the location of interacting hub facilities. Location Sci. 4(3):155–171.Crossref, Google Scholar
• Stanimirović Z (2010) A genetic algorithm approach for the capacitated single allocation p-hub median problem. Comput. Inform. 29(1):117–132.Google Scholar
• Sung CS, Jin HW (2001) Dual-based approach for a hub network design problem under non-restrictive policy. Eur. J. Oper. Res. 132(1):88–105.Crossref, Google Scholar
• Todosijević R, Urošević D, Mladenović N, Hanafi S (2017) A general variable neighborhood search for solving the uncapacitated r-allocation p-hub median problem. Optim. Lett. 11(6):1109–1121.Crossref, Google Scholar
• Wagner B (2007) An exact solution procedure for a cluster hub location problem. Eur. J. Oper. Res. 178(2):391–401.Crossref, Google Scholar
• Wets RJ-B (1989) The aggregation principle in scenario analysis and stochastic optimisation. Wallace SW, ed. Algorithms and Model Formulations in Mathematical Programming (Springer-Verlag, Berlin Heidelberg), 92–113.Crossref, Google Scholar
• Yaman H (2011) Allocation strategies in hub networks. Eur. J. Oper. Res. 211(3):442–451.Crossref, Google Scholar
• Yaman H, Carello G (2005) Solving the hub location problem with modular link capacities. Comput. Oper. Res. 32(12):3227–3245.Crossref, Google Scholar
• Yang K, Liu Y, Yang G (2014) Optimizing fuzzy p-hub center problem with generalized value-at-risk criterion. Appl. Math. Model. 38(15–16):3987–4005.Crossref, Google Scholar
• Yang K, Yang L, Gao Z (2016) Planning and optimization of intermodal hub-and-spoke network under mixed uncertainty. Transportation Res. Part E: Logist. Transportation Rev. 95:248–266.Crossref, Google Scholar
• Yang K, Yang L, Gao Z (2017) Hub-and-spoke network design problem under uncertainty considering financial and service issues: A two-phase approach. Inform. Sci. 402:15–34.Crossref, Google Scholar
• Yang T-H (2009)Stochastic air freight hub location and flight routes planning. Appl. Math. Model. 33(12):4424–4430.Crossref, Google Scholar