Advertisement

Hybrid Optimization Algorithm Based on Wolf Pack Search and Local Search for Solving Traveling Salesman Problem

  • Ruyi Dong (董如意)
  • Shengsheng Wang (王生生)Email author
  • Guangyao Wang (王光耀)
  • Xinying Wang (王新颖)
Article
  • 4 Downloads

Abstract

Traveling salesman problem (TSP) is one of the typical NP-hard problems, and it has been used in many engineering applications. However, the previous swarm intelligence (SI) based algorithms for TSP cannot coordinate with the exploration and exploitation abilities and are easily trapped into local optimum. In order to deal with this situation, a new hybrid optimization algorithm based on wolf pack search and local search (WPS-LS) is proposed for TSP. The new method firstly simulates the predatory process of wolf pack from the broad field to a specific place so that it allows for a search through all possible solution spaces and prevents wolf individuals from getting trapped into local optimum. Then, local search operation is used in the algorithm to improve the speed of solving and the accuracy of solution. The test of benchmarks selected from TSPLIB shows that the results obtained by this algorithm are better and closer to the theoretical optimal values with better robustness than those obtained by other methods.

Key words

traveling salesman problem (TSP) swarm intelligence (SI) wolf pack search (WPS) combinatorial optimization 

CLC number

TP 18 

Document code

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    LAPOTE G. The traveling salesman problem: An overview of exact and approximate algorithms [J]. European Journal of Operational Research, 1992, 59(2): 231–247.Google Scholar
  2. [2]
    JIANG H, SUN W C, REN Z L, et al. Evolving hard and easy traveling salesman problem instances: A multi-objective approach [C]//Proceedings of the 10th International Conference on Simulated Evolution and Learning. Dunedin, New Zealand: Springer International Publishing, 2014: 216–227.Google Scholar
  3. [3]
    URRUTIA S, MILANÉS A, LØKKETANGEN A. A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks [J]. International Transactions in Operational Research, 2015, 22(1): 61–75.MathSciNetzbMATHGoogle Scholar
  4. [4]
    JOZEFOWIEZ N, LAPORTE G, SEMET F. A generic branch-and-cut algorithm for multiobjective optimization problems: Application to the multilabel traveling salesman problem [J]. INFORMS Journal on Computing, 2012, 24(4): 554–564.MathSciNetzbMATHGoogle Scholar
  5. [5]
    QU D P, TU H, FAN T S. Performance analysis of local optimization algorithms in traveling salesman problem [J]. Advanced Materials Research, 2014, 846/847: 1364–1367.Google Scholar
  6. [6]
    ZHANG J W. Hybrid particle swarm optimization algorithm for large-scale travelling salesman problem [J]. Applied Mechanics and Materials, 2014, 513/514/515/516/517: 1773–1778.Google Scholar
  7. [7]
    CONTRERAS-BOLTON C, PARADA V. Automatic combination of operators in a genetic algorithm to solve the traveling salesman problem [J]. PLoS ONE, 2015, 10(9): e0137724.Google Scholar
  8. [8]
    YANG J Y, DING R F, ZHANG Y, et al. An improved ant colony optimization (I-ACO) method for the quasi travelling salesman problem (quasi-TSP) [J]. International Journal of Geographical Information Science, 2015, 29(9): 1534–1551.Google Scholar
  9. [9]
    ZHOU Y Q, LUO Q F, CHEN H, et al. A discrete invasive weed optimization algorithm for solving traveling salesman problem [J]. Neurocomputing, 2015, 151(3): 1227–1236.Google Scholar
  10. [10]
    GARLIA M B. Particle swarm optimization with an improved exploration-exploitation balance [C]//Proceedings of 51st Midwest Symposium on Circuits and Systems. [s.l.]: IEEE, 2008: 759–762.Google Scholar
  11. [11]
    YANG C G, TU X Y, CHEN J. Algorithm of marriage in honey bees optimization based on the wolf pack search [C]//Proceedings of International Conference on Intelligent Pervasive Computing. [s.l.]: IEEE, 2007: 462–467.Google Scholar
  12. [12]
    WU H S, ZHANG F M, WU L S. New swarm intelligence algorithm: Wolf pack algorithm [J]. Systems Engineering and Electronics, 2013, 35(11): 2430–2438 (in Chinese).zbMATHGoogle Scholar
  13. [13]
    OUYANG X X, ZHOU Y Q, LUO Q F, et al. A novel discrete cuckoo search algorithm for spherical traveling salesman problem [J]. Applied Mathematics & Information Sciences, 2013, 7(2): 777–784.MathSciNetGoogle Scholar
  14. [14]
    PASTI R, DE CASTRO L N. A neuro-immune network for solving the traveling salesman problem [C]//Proceedings of IEEE International Joint Conference on Neural Network Proceedings. Vancouver, Canada: IEEE, 2006: 3760–3766.Google Scholar
  15. [15]
    MASUTTI T A S, DE CASTRO L N. A self-organizing neural network using ideas from the immune system to solve the traveling salesman problem [J]. Information Sciences, 2009, 179(10): 1454–1468.MathSciNetGoogle Scholar
  16. [16]
    WU J Q, OUYANG A J. A hybrid algorithm of ACO and delete-cross method for TSP [C]//Proceedings of 2012 International Conference on Industrial Control and Electronics Engineering. [s.l.]: IEEE, 2012: 1694–1696.Google Scholar
  17. [17]
    DONG GF, GUO WW, TICKLE K. Solving the traveling salesman problem using cooperative genetic ant systems [J]. Expert Systems with Applications, 2012, 39: 5006–5011.Google Scholar
  18. [18]
    PEKER M, SEN B, KUMRU P Y. An efficient solving of the traveling salesman problem: The ant colony system having parameters optimized by the Taguchi method [J]. Turkish Journal of Electrical Engineering & Computer Science, 2013, 21: 2015–2036.Google Scholar
  19. [19]
    GÜNDÜZ M, KIRAN M S, ÖZCEYLAN E. A hierarchic approach based on swarm intelligence to solve the traveling salesman problem [J]. Turkish Journal of Electrical Engineering & Computer Sciences, 2015, 23: 103–117.Google Scholar

Copyright information

© Shanghai Jiaotong University and Springer-Verlag GmbH Germany, part of Springer Nature 2019

Authors and Affiliations

  • Ruyi Dong (董如意)
    • 1
    • 2
  • Shengsheng Wang (王生生)
    • 1
    Email author
  • Guangyao Wang (王光耀)
    • 1
  • Xinying Wang (王新颖)
    • 3
  1. 1.College of Computer Science and TechnologyJilin UniversityChangchunChina
  2. 2.Jilin Vocational College of Industry and TechnologyJilinChina
  3. 3.College of Computer Science and EngineeringChangchun University of TechnologyChangchunChina

Personalised recommendations