Soft Computing

, Volume 21, Issue 7, pp 1863–1875 | Cite as

Imperial competitive algorithm with policy learning for the traveling salesman problem

Methodologies and Application

Abstract

The traveling salesman problem (TSP) is one of the most studied combinatorial optimization problems. In this paper, we present the new idea of combining the imperial competitive algorithm with a policy-learning function for solving the TSP problems. All offspring of each country are defined as representing feasible solutions for the TSP. All countries can grow increasingly strong by learning the effective policies of strong countries. Weak countries will generate increasingly excellent offspring by learning the policies of strong countries while retaining the characteristics of their own country. Imitating these policies will enable the weak countries to produce improved offspring; the solutions generated will, therefore, acquire a favorable scheme while maintaining diversity. Finally, experimental results for TSP instances from the TSP library have shown that our proposed algorithm can determine the salesman’s tour with more effective performance levels than other known methods.

Keywords

Traveling salesman problem Imperial competitive algorithm Combinatorial optimization problems Artificial chromosomes Genetic algorithm 

References

  1. Affenzeller M, Wanger S (2003) A self-adaptive model for selective pressure handling within the theory of genetic algorithms. Lect Notes Comput Sci 2809(1):384–393CrossRefGoogle Scholar
  2. Atashpaz-Gargari E, Lucas C (2007) Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition. In: IEEE congress on evolutionary computation, pp 4661–4667Google Scholar
  3. Bianchi L, Knowles J, Bowler J (2005) Local search for the probabilistic traveling salesman problem: correction to the 2-p-opt and 1-shift algorithms. Eur J Oper Res 162(1):206–219MathSciNetCrossRefMATHGoogle Scholar
  4. Bonyadi RM, Rahimi Azghadi SM, Shah-Hosseini H (2007) Solving travelingsalesman problem using combinational evolutionary algorithm. In: Boukis C, Pnevmatikakis L, Polymenakos L (eds) IFIP international federation for information processing. Artificial intelligence and innovations 2007: from theory to applications, vol 247, Springer, Boston, pp 37–44Google Scholar
  5. Budinich M (1996) A self-organizing neural network for the traveling salesman problem that is competitive with simulated annealing. Neural Comput 8:416–424CrossRefGoogle Scholar
  6. Chang PC, Chen MH (2014) A block based estimation of distribution algorithm using bivariate model for scheduling problems. Soft Comput 18(6):1177–1188MathSciNetCrossRefGoogle Scholar
  7. Chang PC, Chen SH, Fan CY (2010) Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems. Ann Oper Res 180(1):197–211MathSciNetCrossRefMATHGoogle Scholar
  8. Chang PC, Chen MH, Tiwari MK, Iquebal AS (2013) A block-based evolutionary algorithm for flow-shop scheduling problem. Appl Soft Comput 13(1):4536–4547CrossRefGoogle Scholar
  9. Cheng J, Zhang G, Li Z, Li Y (2012) Multi-objective ant colony optimization based on decomposition for bi-objective traveling salesman problems. Soft Comput 16:597–614CrossRefMATHGoogle Scholar
  10. Chu SC, Roddick JF, Pan JS (2004) Ant colony system with communication strategies. Inf Sci 167(1–4):63–76MathSciNetCrossRefMATHGoogle Scholar
  11. Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning (book style). Addison-Wesley, BostonGoogle Scholar
  12. Gutin G, Punnen AP (2002) The traveling salesman problem and its variations. Springer, New YorkGoogle Scholar
  13. Holland JH (1973) Genetic algorithms and the optimal allocation of trials. SIAM J Comput 2:88–105MathSciNetCrossRefMATHGoogle Scholar
  14. Huang WH, Chang PC, Wang LC (2012) A fast block-based evolutional algorithm for combinatorial problems. World Acad Sci Eng Technol 6:771–777Google Scholar
  15. Johnson DS, McGeoch LA (1997) The traveling salesman problem: a case study in local optimization. In: Aarts EHL, Lenstra JK (eds) Local search in combinatorial optimization. Wiley, Chichester, pp 215–310Google Scholar
  16. Laporte G (1992) The vehicle routing problem: an overview of exact and approximate algorithms. Eur J Oper Res 59(2):345–358MathSciNetCrossRefMATHGoogle Scholar
  17. Larranaga P, Kuijpers CMH, Murga RH, Inza I, Dizdarevic S (1999) Genetic algorithms for the travelling salesman problems: a review of representations and operators. Artif Intell Rev 13:129–170CrossRefGoogle Scholar
  18. Lee ZJ (2004) A hybrid algorithm applied to traveling salesman problem. In: Proceedings of the 2004 IEEE international conference on networking, sensing and control, pp 237–242Google Scholar
  19. Leung KS, Jin HD, Xu ZB (2004) An expanding self-organizing neural network for the traveling salesman problem. Neural comput 62:267–292Google Scholar
  20. Liu G, He Y, Fang Y, Qiu Y (2003) A novel adaptive search strategy of intensification and diversification in tabu search. In: Proceedings of IEEE international conference on neural networks and signal processing, Nanjing, pp 14–17Google Scholar
  21. Mohammadian M, Sarker R, Yao X (2002) Evolutionary optimization. Kluwer Academic, BostonMATHGoogle Scholar
  22. Nozarian S, Jahan MV (2012) A novel memetic algorithm with imperialist competition as local search. IPCSIT Hong Kong Conf 30:54–59Google Scholar
  23. Onwubolu GC, Clerc M (2004) Optimal path for automated drilling operations by a new heuristic approach using particle swarm optimization. Int J Prod Res 44(3):473–491CrossRefMATHGoogle Scholar
  24. Ouaarab A, Ahiod B, Yang XS (2015) Random-key cuckoo search for the travelling salesman problem. Soft Comput 19(4):1099–1106Google Scholar
  25. Pan QK, Ruiz R (2012) An estimation of distribution algorithm for lot-streaming flow shop problems with setup times. Omega 40(2):166–180CrossRefGoogle Scholar
  26. Pasti R, de Castro LN (2006) A neuro-immune network for solving the traveling salesman problem. In: Proceedings of international joint conference on neural networks, vol 6, Sheraton Vancouver Wall Centre Hotel, Vancouver, 16–21 July 2006, pp 3760–3766Google Scholar
  27. Pham DT, Karaboga D (2000) Intelligent optimization techniques: genetic algorithms. Tabu search, simulated annealing and neural networks. Springer, LondonCrossRefMATHGoogle Scholar
  28. Somhom S, Modares A, Enkawa T (1997) A self-organizing model for the travelling salesman problem. J Oper Res Soc 48:919–928CrossRefMATHGoogle Scholar
  29. Wang YW, Wu JL, Lin JL (2011) Artificial chromosomes embedded in sub-population genetic algorithm for a multi-objective scheduling problem. In: 3rd international conference on information and financial engineering, vol 12. IPEDR IACSIT Press, Singapore, pp 108–112Google Scholar
  30. Yan XS, Li H, CAI ZH, Kang LS (2005) A fast evolutionary algorithm for combinatorial optimization problem. In: Proceedings of the fourth international conference on machine learning and cybernetics, pp 3288–3292Google Scholar
  31. Yong W (2015) Hybrid max–min ant system with four vertices and three lines inequality for traveling salesman problem. Soft Comput 19:585–596CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2015

Authors and Affiliations

  • Meng-Hui Chen
    • 1
  • Shih-Hsin Chen
    • 2
  • Pei-Chann Chang
    • 1
  1. 1.Department of Information Management, Innovation Center for Big Data and Digital ConvergenceYuan Ze UniversityChung-LiTaiwan
  2. 2.Department of Information ManagementCheng Shiu UniversityKaohsiungTaiwan

Personalised recommendations