Less is more: General variable neighborhood search for the capacitated modular hub location problem
暂无分享,去创建一个
[1] Jack Brimberg,et al. Less is more: Solving the Max-Mean diversity problem with variable neighborhood search , 2017, Inf. Sci..
[2] Nenad Mladenovic,et al. A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem , 2009, Eur. J. Oper. Res..
[3] Nenad Mladenovic,et al. Less is more: Basic variable neighborhood search for minimum differential dispersion problem , 2016, Inf. Sci..
[4] Ali Husseinzadeh Kashan,et al. The capacitated modular single-allocation hub location problem with possibilities of hubs disruptions: modeling and a solution algorithm , 2018, Oper. Res..
[5] Andreas T. Ernst,et al. Efficient algorithms for the uncapac-itated single allocation p-hub median problem , 1996 .
[6] Pierre Hansen,et al. Variable neighborhood search: basics and variants , 2017, EURO J. Comput. Optim..
[7] Ángel Corberán,et al. Heuristics for the capacitated modular hub location problem , 2017, Comput. Oper. Res..
[8] Hossein Karimi,et al. Capacity selection for hubs and hub links in hub location problems , 2016 .
[9] Hande Yaman,et al. Solving the hub location problem with modular link capacities , 2005, Comput. Oper. Res..
[10] Sibel A. Alumur,et al. Network hub location problems: The state of the art , 2008, Eur. J. Oper. Res..
[11] Iván A. Contreras,et al. An exact algorithm for the modular hub location problem with single assignments , 2017, Comput. Oper. Res..
[12] James F. Campbell,et al. Integer programming formulations of discrete hub location problems , 1994 .
[13] Pierre Hansen,et al. First vs. best improvement: An empirical study , 1999, Discret. Appl. Math..
[14] Iván A. Contreras,et al. The Tree of Hubs Location Problem , 2010, Eur. J. Oper. Res..
[15] Daniel Aloise,et al. Less is more: basic variable neighborhood search heuristic for balanced minimum sum-of-squares clustering , 2017, Inf. Sci..
[16] Pierre Hansen,et al. Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem , 2015, Int. Trans. Oper. Res..
[17] M. O'Kelly,et al. A quadratic integer program for the location of interacting hub facilities , 1987 .
[18] Ali Abdi Kordani,et al. Airline hub-and-spoke network design based on airport capacity envelope curve: A practical view , 2018, Comput. Ind. Eng..
[19] Ehsan Nikbakhsh,et al. Hub location problems: A review of models, classification, solution techniques, and applications , 2013, Comput. Ind. Eng..
[20] Fred W. Glover,et al. Strategic oscillation for the capacitated hub location problem with modular links , 2016, J. Heuristics.
[21] Iván A. Contreras,et al. Exact and heuristic approaches for the cycle hub location problem , 2017, Ann. Oper. Res..
[22] Morton E. O'Kelly,et al. Twenty-Five Years of Hub Location Research , 2012, Transp. Sci..
[23] Jack Brimberg,et al. A non-triangular hub location problem , 2020, Optim. Lett..
[24] Bahar Y. Kara,et al. Hub Location Problem with Allowed Routing between Nonhub Nodes , 2015 .
[25] Shahin Gelareh,et al. The selective traveling salesman problem with draft limits , 2020, J. Heuristics.
[26] Ángel Corberán,et al. GRASP for the uncapacitated r-allocation p-hub median problem , 2014, Comput. Oper. Res..
[27] Pierre Hansen,et al. Variable Neighborhood Search , 2018, Handbook of Heuristics.
[28] Sibel A. Alumur,et al. Profit maximizing hub location problems , 2019, Omega.