Abstract
Routing on the surface of a sphere is a very interesting new topic. This paper presents a new discrete particle swarm algorithm, ENS-DPSO, to solve the travelling salesman problems on a spherical surface. Differently from previous approaches, ENS-DPSO redefines the path-relinking as velocity and position updating operators, and the hybridization with expanding neighborhood search (ENS) strategy is employed to improve the exploitation capabilities of the method. After visual implementation of the experimental tool in Java with 3D APIs, the effectiveness and efficiency of the proposed method are tested on various instances of random points with promising results.
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
Preview
Unable to display preview. Download preview PDF.
References
Elizabeth, F.G., Marco, C.G., Givanaldo, R.: Particle Swarm Optimization Algorithm for the Traveling Salesman Problem. In: Greco, F. (ed.) Traveling Salesman Problem, pp. 85–96. Tech Publisher, Vienna (2008)
Tsai, H.K., Yang, J.M., Tsai, Y.F., et al.: An evolutionary algorithm for large travelling salesman problems. IEEE Trans. Syst. CY B 34, 1718–1729 (2004)
Mohemmed, A.W., Sahoo, N.C., Geok, T.K.: Solving shortest path problem using particle swarm optimization. Applied Soft Computing 8, 1643–1653 (2008)
Su, S.B., Cao, X.B., Kong, M.: Stability analysis of particle swarm optimization using swarm activity. Control Theory & Applications 27, 1411–1417 (2010)
Marinakis, Y., Marinaki, M.: A Particle Swarm Optimization Algorithm with Path Relinking for the Location Routing Problem. J. Math. Model Algor. 7, 59–78 (2008)
Ge, X.S., Bian, F.L.: On algorithm for 3D surface route optimization based on ant colony optimization. Geomatics and Information Science of Wuhan University 32, 366–372 (2007)
Takahashi, S., Fujimura, K., Tokutaka, H.: The SOM-TSP method for the three-dimension city location problem. Neural Information Processing 5, 2552–2555 (2002)
Uğur, A., Korukoğlu, S., Alişkan, A.Ç., et al.: Genetic algorithm based solution for TSP on a sphere. Mathematical and Computational Applications 14, 219–228 (2009)
Wikipedia.: Sphere from Wikipedia, the free encyclopedia Sphere (2011), http://en.wikipedia.org/wiki/
Anghinolfi, D., Paolucci, M.: A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times. Eur. J. Oper. Res. 193, 73–85 (2009)
Glover, F., Laguna, M., Martí, R.: Scatter Search and Path Relinking: Foundations and Advanced Designs. In: Onwubolu, G.C., Babu, B.V. (eds.) New Optimization Techniques in Engineering, pp. 87–100. Springer, Berlin (2004)
Marinakis, Y., Marinaki, M., Dounias, G.: A hybrid particle swarm optimization algorithm for the vehicle routing problem. Eng. Appl. Artif. Intel. 23, 463–472 (2010)
Hansen, P., Mladenovic, N.: Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130, 449–467 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Su, S., Yu, S., Ma, Y., Yang, Y., Xu, H. (2011). Routing on a Spherical Surface Using Hybrid PSO. In: Deng, H., Miao, D., Wang, F.L., Lei, J. (eds) Emerging Research in Artificial Intelligence and Computational Intelligence. AICI 2011. Communications in Computer and Information Science, vol 237. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24282-3_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-24282-3_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24281-6
Online ISBN: 978-3-642-24282-3
eBook Packages: Computer ScienceComputer Science (R0)