Abstract
This paper introduces a new Discrete Particle Swarm Optimization algorithm for solving Dynamic Traveling Salesman Problem (DTSP). An experimental environment is stochastic and dynamic, based on Benchmark Generator was prepared for testing DTSP solvers. Changeability requires quick adaptation ability from the algorithm. The introduced technique presents a set of advantages that fulfill this requirement. The proposed solution is based on the virtual pheromone first applied in Ant Colony Optimization. The pheromone serves as a communication topology and information about the landscape of global discrete space. Experimental results demonstrate the effectiveness and efficiency of the algorithm.
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
Applegate, D.L., Bixby, R.E., Chvátal, V., Cook, W.J.: The traveling salesman problem: A computational study. Princeton University (2006)
Bean, J.C.: Genetic algorithms and random keys for sequencing and optimization. ORSA Journal of Computing 6, 154–160 (1994)
Blackwell, T.: Particle Swarm Optimization in Dynamic Environments. In: Yang, S., Ong, Y.-S., Jin, Y. (eds.) Evolutionary Computation in Dynamic and Uncertain Environments. SCI, vol. 51, pp. 29–49. Springer, Heidelberg (2007)
Branke, J.: Evolutionary approaches to dynamic environments. In: GECCO Workshop on Evolutionary Algorithms for Dynamics Optimization Problems (2001)
Dong, C., Ernst, C., Jäger, G., Richter, D., Molitor, P.: Effective heuristics for large euclidean tsp instances based on pseudo backbones (2009)
Eyckelhof, C.J., Snoek, M.: Ant Systems for a Dynamic TSP. In: Dorigo, M., Di Caro, G.A., Sampels, M. (eds.) ANTS 2002. LNCS, vol. 2463, p. 88. Springer, Heidelberg (2002)
Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. W.H. Freeman (1979)
Goldbarg, E.F.G., Goldbarg, M.C., de Souza, G.R.: Particle swarm optimization algorithm for the traveling salesman problem (2008)
Hendtlass, T.: Preserving Diversity in Particle Swarm Optimisation. In: Chung, P.W.H., Hinde, C.J., Ali, M. (eds.) IEA/AIE 2003. LNCS, vol. 2718, pp. 31–40. Springer, Heidelberg (2003)
Hu, X., Eberhart, R.C., Shi, Y.: Swarm intelligence for permutation optimization: Case study of n-queens problem (2003)
Kalivarapu, V., Foo, J.-L., Winer, E.: Improving solution characteristics of particle swarm optimization using digital pheromones. In: Structural and Multidisciplinary Optimization (2009)
Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proceedings of the IEEE International Conference on Neural Networks, pp. 1942–1948 (1995)
Kennedy, J., Eberhart, R.C.: A discrete binary version of the particle swarm algorithm. In: Systems, Man, and Cybernetics, Computational Cybernetics and Simulation. IEEE (1997)
Li, C., Yang, M., Kang, L.: A New Approach to Solving Dynamic Traveling Salesman Problems. In: Wang, T.-D., Li, X., Chen, S.-H., Wang, X., Abbass, H.A., Iba, H., Chen, G.-L., Yao, X. (eds.) SEAL 2006. LNCS, vol. 4247, pp. 236–243. Springer, Heidelberg (2006)
Li, W.: A Parallel Multi-start Search Algorithm for Dynamic Traveling Salesman Problem. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 65–75. Springer, Heidelberg (2011)
Zhong, W.L., Zhang, J., Chen, W.N.: A novel set-based particle swarm optimization method for discrete optimization problems. In: Evolutionary Computation, CEC 2007, vol. 14, pp. 3283–3287. IEEE (1997)
Liu, B., Wang, L., Jin, Y.H., Huang, D.X.: An Effective PSO-Based Memetic Algorithm for TSP. In: Huang, D.-S., Li, K., Irwin, G.W. (eds.) ICIC 2006. LNCIS, vol. 345, pp. 1151–1156. Springer, Heidelberg (2006)
Azimi, P., Daneshvar, P.: An Efficient Heuristic Algorithm for the Traveling Salesman Problem. In: Dangelmaier, W., Blecken, A., Delius, R., Klöpfer, S. (eds.) IHNS 2010. LNBIP, vol. 46, pp. 384–395. Springer, Heidelberg (2010)
Schutte, J.F., Groenwold, A.A.: A study of global optimization using particle swarms. Journal of Global Optimization 31, 93–108 (2005)
Senthilkumar, K.M., Selladurai, V., Raja, K., Thirunavukkarasu, V.: A hybrid algorithm based on pso and aco approach for solving combinatorial fuzzy unrelated parallel machine scheduling problem. European Journal of Scientific Research (2011)
Shi, X.H., Liang, Y.C., Lee, H.P., Lu, C.L., Wang, Q.X.: Particle swarm optimization-based algorithms for tsp and generalized tsp. Inf. Process. Lett. (2007)
Silva, C.A., Runkler, T.A.: Ant colony optimization for dynamic traveling salesman problems. In: ARCS Workshops (2004)
Wang, K.-P., Huang, L., Zhou, C.-G., Pang, W.: Particle swarm optimization for traveling salesman problem. In: International Conference on Machine Learning and Cybernetics, vol. 3. IEEE (2003)
Xiaohui, H., Eberhart, R.C.: Adaptive particle swarm optimisation: detection and response to dynamic systems. In: Proceedings of the 2002 Congress on Evolutionary Computation, CEC 2002 (2002)
Xiaohui, H., Shi, Y., Eberhart, R.C.: Recent advances in particle swarm (2004)
Younes, A., Basir, O., Calamai, P.: A benchmark generator for dynamic optimization. In: Digest of the Proceedings of the Wseas Conferences (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boryczka, U., Strąk, Ł. (2012). A Hybrid Discrete Particle Swarm Optimization with Pheromone for Dynamic Traveling Salesman Problem. In: Nguyen, NT., Hoang, K., Jȩdrzejowicz, P. (eds) Computational Collective Intelligence. Technologies and Applications. ICCCI 2012. Lecture Notes in Computer Science(), vol 7654. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34707-8_51
Download citation
DOI: https://doi.org/10.1007/978-3-642-34707-8_51
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34706-1
Online ISBN: 978-3-642-34707-8
eBook Packages: Computer ScienceComputer Science (R0)