Abstract
Scatter Search (SS) is a population-based evolutionary metaheuristic algorithm that selects solutions from a specific memory called a reference set (RefSet) to produce other diverse solutions. In this work, a dynamic SS algorithm is proposed to solve the symmetric traveling salesman problem (TSP). To improve the performance of SS, a dynamic RefSet update and a dynamic population update are proposed. To test the performance of the proposed algorithm, computational experiments are carried out on the basis of the benchmark instances of the problem. The computational results show that the performance of the proposed algorithm is effective in solving the TSP.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Glover Fred (1977) Heuristics for integer programming using surrogate constraints. Decis Sci J 8:156–166
Glover F, Laguna M, Mart´ı R (2000) Fundamentals of scatter search and path relinking. Control Cybern 39:653–684
El-Ghazali T (2009) Metaheuristics from design to implementation, 1st edn. Wiley
Liu Y-H (2007) A hybrid scatter search for the probabilistic traveling salesman problem. Computers and Operations Research, vol 34. Elsevier Ltd, pp 2949–2963
Pantrigo JJ, Duarte A, Sánchez Á, Cabido R (2005) Scatter search particle filter to solve the dynamic travelling salesman problem. In: Evolutionary computation in combinatorial optimization. Lecture notes in computer science, vol 3448. Springer, Berlin Heidelberg, pp 177–189
Sagheer AM, Sadiq AT, Ibrahim MS (2012) Improvement of scatter search using Bees Algorithm. In: 6th International Conference, Signal Processing and Communication Systems (ICSPCS), IEEE, Gold Coast. pp 1–7
Russell RR, Chiang WC (2006) Scatter search for the vehicle routing problem with time windows. European J Oper Res 169:606–622. Elsevier
Tang J, Zhang J, Fung RYK (2011) A scatter search for multi-depot vehicle routing problem with weight-related cost. Asia-pacific J Oper Res 28:323–348
Alkhazaleh HA, Ayob M, Othman Z, Ahmad Z (2013) Diversity measurement for a solution of team orienteering problem. Int J Adv Comput Technol (IJACT). 5:21–28
Créput J, Koukam A (2009) A memetic neural network for the euclidean traveling salesman problem. Neurocomputing 72 1250–1264. Elsevier Ltd
Cochrane EM, Beasley, JE (2003) The Co-adaptive neural network approach to the euclidean travelling salesman problem. Neural Netw 16:1499–1525. Elsevier Ltd
Acknowledgments
The study is supported by Project No.: RG312-14AFR from University of Malaya.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer Science+Business Media Singapore
About this paper
Cite this paper
Abdulelah, A.J., Shaker, K., Sagheer, A.M., Jalab, H.A. (2017). A Dynamic Scatter Search Algorithm for Solving Traveling Salesman Problem. In: Ibrahim, H., Iqbal, S., Teoh, S., Mustaffa, M. (eds) 9th International Conference on Robotic, Vision, Signal Processing and Power Applications. Lecture Notes in Electrical Engineering, vol 398. Springer, Singapore. https://doi.org/10.1007/978-981-10-1721-6_13
Download citation
DOI: https://doi.org/10.1007/978-981-10-1721-6_13
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-1719-3
Online ISBN: 978-981-10-1721-6
eBook Packages: EngineeringEngineering (R0)