A Simulated Evolution-Tabu search hybrid metaheuristic for routing in computer networks

Author(s):  
Salman A. Khan ◽  
Zubair A. Baig
2019 ◽  
Vol 2019 ◽  
pp. 1-16
Author(s):  
Dieudonné Nijimbere ◽  
Songzheng Zhao ◽  
Haichao Liu ◽  
Bo Peng ◽  
Aijun Zhang

This paper presents a hybrid metaheuristic that combines estimation of distribution algorithm with tabu search (EDA-TS) for solving the max-mean dispersion problem. The proposed EDA-TS algorithm essentially alternates between an EDA procedure for search diversification and a tabu search procedure for search intensification. The designed EDA procedure maintains an elite set of high quality solutions, based on which a conditional preference probability model is built for generating new diversified solutions. The tabu search procedure uses a fast 1-flip move operator for solution improvement. Experimental results on benchmark instances with variables ranging from 500 to 5000 disclose that our EDA-TS algorithm competes favorably with state-of-the-art algorithms in the literature. Additional analysis on the parameter sensitivity and the merit of the EDA procedure as well as the search balance between intensification and diversification sheds light on the effectiveness of the algorithm.


Author(s):  
Dmitro Trushakov ◽  
◽  
Taras Glushenko ◽  
Nuzhny Vitaliy ◽  
◽  
...  

Sign in / Sign up

Export Citation Format

Share Document