Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Diversification-based learning simulated annealing algorithm for hub location problems

Diversification-based learning simulated annealing algorithm for hub location problems 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Benchmarking: An International Journal Emerald Publishing

Diversification-based learning simulated annealing algorithm for hub location problems

Loading next page...
 
/lp/emerald-publishing/diversification-based-learning-simulated-annealing-algorithm-for-hub-R0QJzY1USK

References (48)

Publisher
Emerald Publishing
Copyright
© Emerald Publishing Limited
ISSN
1463-5771
DOI
10.1108/bij-04-2018-0092
Publisher site
See Article on Publisher Site

Abstract

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.

Journal

Benchmarking: An International JournalEmerald Publishing

Published: Jul 31, 2019

Keywords: Simulated annealing; Diversification-based learning; Hub location problems

There are no references for this article.