Access the full text.
Sign up today, get DeepDyve free for 14 days.
Andreas Ernst, M. Krishnamoorthy (1998)
Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problemEuropean Journal of Operational Research, 104
P. Goedeking (2010)
Networks in Aviation
Yaser Rahimi, R. Tavakkoli-Moghaddam, R. Tavakkoli-Moghaddam, Mehrdad Mohammadi, Mehrdad Mohammadi, Marjan Sadeghi (2016)
Multi-objective hub network design under uncertainty considering congestion: An M/M/c/K queue systemApplied Mathematical Modelling, 40
James Campbell (1994)
Integer programming formulations of discrete hub location problemsEuropean Journal of Operational Research, 72
S. Kirkpatrick, C. Gelatt, Mario Vecchi (1983)
Optimization by Simulated AnnealingScience, 220
Marjan Sadeghi, F. Jolai, R. Tavakkoli-Moghaddam, Yaser Rahimi (2015)
A new stochastic approach for a reliable p-hub covering location problemComput. Ind. Eng., 90
Mehrdad Mohammadi, S. Torabi, R. Tavakkoli-Moghaddam (2014)
Sustainable hub location under mixed uncertaintyTransportation Research Part E-logistics and Transportation Review, 62
V. Rodríguez, M. Álvarez, Lucía Barcos (2007)
Hub Location Under Capacity ConstraintsTransportation Research Part E-logistics and Transportation Review, 43
Sibel Alumur, B. Kara (2008)
Network hub location problems: The state of the artEur. J. Oper. Res., 190
M. Ventresca, H. Tizhoosh (2007)
Simulated Annealing with Opposite Neighbors2007 IEEE Symposium on Foundations of Computational Intelligence
A. Niknamfar, S. Niaki, S. Niaki (2017)
Opposition-based learning for competitive hub location: A bi-objective biogeography-based optimization algorithmKnowl. Based Syst., 128
T. Tran, J. O’Hanley, M. Scaparra (2017)
Reliable Hub Network Design: Formulation and Solution TechniquesTransp. Sci., 51
M. O’Kelly (1986)
The Location of Interacting Hub FacilitiesTransp. Sci., 20
N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller (1953)
Equation of state calculations by fast computing machinesJournal of Chemical Physics, 21
Y. Kathawala, K. Abdou, Catharina Franck (2002)
Supply chain/electronic hubs: a comparative analysisBenchmarking: An International Journal, 9
M. O’Kelly (1987)
A quadratic integer program for the location of interacting hub facilitiesEuropean Journal of Operational Research, 32
Cheng-Chang Lin, J. Lin, Y. Chen (2012)
The capacitated p-hub median problem with integral constraints: An application to a Chinese air cargo networkApplied Mathematical Modelling, 36
Tommy Thomadsen, J. Larsen (2007)
A hub location problem with fully interconnected backbone and access networksComput. Oper. Res., 34
V. Yu, Shih-Wei Lin (2014)
Multi-start simulated annealing heuristic for the location routing problem with simultaneous pickup and deliveryAppl. Soft Comput., 24
M. Silva, C. Cunha (2017)
A tabu search heuristic for the uncapacitated single allocation p-hub maximal covering problemEur. J. Oper. Res., 262
Inmaculada Rodríguez-Martín, Juan SALAZAR-GONZÁLEZ (2008)
Solving a capacitated hub location problemEuropean Journal of Operational Research, 184
P. Mackenzie-Williams (2005)
Aviation benchmarking: issues and industry insights from benchmarking resultsStrategic Direction, 22
Benchmarking: An International Journal, 12
Jamie Ebery, M. Krishnamoorthy, Andreas Ernst, N. Boland (2000)
The capacitated multiple allocation hub location problem: Formulations and algorithmsEur. J. Oper. Res., 120
田口 玄一 (1986)
Introduction to quality engineering : designing quality into products and processes
F. Glover, Jin-Kao Hao (2017)
Diversification-based learning in computing and optimizationJournal of Heuristics, 25
Lázaro Cánovas, Sergio García, Alfredo Marín (2007)
Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent techniqueEur. J. Oper. Res., 179
James Campbell (1993)
Location and allocation for distribution systems with transshipments and transportion economies of scaleAnnals of Operations Research, 40
M. Amin-Naseri, A. Yazdekhasti, A. Salmasnia (2018)
Robust bi-objective optimization of uncapacitated single allocation p-hub median problem using a hybrid heuristic algorithmNeural Computing and Applications, 29
M. Zhalechian, R. Tavakkoli-Moghaddam, Yaser Rahimi (2017)
A self-adaptive evolutionary algorithm for a fuzzy multi-objective hub location problem: An integration of responsiveness and social responsibilityEng. Appl. Artif. Intell., 62
Yuan Gao, Z. Qin (2016)
A chance constrained programming approach for uncertain p-hub center location problemComput. Ind. Eng., 102
J. Fry, I. Humphreys, Graham Francis (2005)
Benchmarking in civil aviation: some empirical evidenceBenchmarking: An International Journal, 12
Jeng-Fung Chen (2007)
A hybrid heuristic for the uncapacitated single allocation hub location problemOmega-international Journal of Management Science, 35
Nicolás Rojas-Morales, M. Riff, Elizabeth Montero (2017)
A survey and classification of Opposition-Based MetaheuristicsComput. Ind. Eng., 110
M. Zhalechian, R. Tavakkoli-Moghaddam, Yaser Rahimi, F. Jolai (2017)
An interactive possibilistic programming approach for a multi-objective hub location problem: Economic and environmental designAppl. Soft Comput., 52
V. Ghezavati, Parisa Hosseinifar (2018)
Application of efficient metaheuristics to solve a new bi-objective optimization model for hub facility location problem considering value at risk criterionSoft Computing, 22
S. Chaharsooghi, Farid Momayezi, Nader Ghaffari-Nasab (2017)
An adaptive large neighborhood search heuristic for solving the reliable multiple allocation hub location problem under hub disruptionsInternational Journal of Industrial Engineering Computations, 8
P. Morrell, C. Lu (2007)
The environmental cost implication of hub-hub versus hub by-pass flight networksTransportation Research Part D-transport and Environment, 12
Alan Murray, R. Church (1996)
Applying simulated annealing to location-planning modelsJournal of Heuristics, 2
Ramesh Bollapragadaa, rey Cammc, Uday Raoc, Junying Wuc (2004)
A two-phase greedy algorithm to locate and allocate hubs for & xed-wireless broadband access
F. Parvaresh, S. Golpayegany, S. Husseini, B. Karimi (2013)
Solving the p-hub Median Problem Under Intentional Disruptions Using Simulated AnnealingNetworks and Spatial Economics, 13
F. Glover (2017)
Diversification methods for zero-one optimizationJournal of Heuristics, 25
H. Hasanzadeh, M. Bashiri, A. Amiri (2018)
A new approach to optimize a hub covering location problem with a queue estimation component using genetic programmingSoft Computing, 22
R. Farahani, M. Hekmatfar, A. Arabani, Ehsan Nikbakhsh (2013)
Hub location problems: A review of models, classification, solution techniques, and applicationsComput. Ind. Eng., 64
Nader Ghaffari-Nasab, Alireza Motallebzadeh, Y. Jabarzadeh, B. Kara (2018)
Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problemsComput. Oper. Res., 90
R. Sani, R. Ghanbari (2016)
An efficient tabu search for solving the uncapacitated single allocation hub location problemComput. Ind. Eng., 93
V. Marianov, D. Serra (2003)
Location models for airline hubs behaving as M/D/c queuesComput. Oper. Res., 30
Mehrdad Mohammadi, R. Tavakkoli-Moghaddam, A. Siadat, Yaser Rahimi (2016)
A game-based meta-heuristic for a fuzzy bi-objective reliable hub location problemEng. Appl. Artif. Intell., 50
The purpose of this paper is to examine the efficacy of diversification-based learning (DBL) in expediting the performance of simulated annealing (SA) in hub location problems.Design/methodology/approachThis study proposes a novel diversification-based learning simulated annealing (DBLSA) algorithm for solving p-hub median problems. It is executed on MATLAB 11.0. Experiments are conducted on CAB and AP data sets.FindingsThis study finds that in hub location models, DBLSA algorithm equipped with social learning operator outperforms the vanilla version of SA algorithm in terms of accuracy and convergence rates.Practical implicationsHub location problems are relevant in aviation and telecommunication industry. This study proposes a novel application of a DBLSA algorithm to solve larger instances of hub location problems effectively in reasonable computational time.Originality/valueTo the best of the author’s knowledge, this is the first application of DBL in optimisation. By demonstrating its efficacy, this study steers research in the direction of learning mechanisms-based metaheuristic applications.
Benchmarking: An International Journal – Emerald Publishing
Published: Jul 31, 2019
Keywords: Simulated annealing; Diversification-based learning; Hub location problems
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.