Impact of Double Operators on the Performance of a Genetic Algorithm for Solving the Traveling Salesman Problem

  • Goran Martinovic
  • Drazen Bajer
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7076)

Abstract

Genetic algorithms are a frequently used method for search and optimization problem solving. They have been applied very successfully to many NP-hard problems, among which the traveling salesman problem, which is also considered in this paper, is one of the most famous representative ones. A genetic algorithm usually makes use only of single mutation and a single crossover operator. However, three modes for determination which of the double crossover and mutation operators should be used in a given moment are presented. It has also been tested if there is a positive impact on the performance if double genetic operators are used. Experimental analysis conducted on several instances of the symmetric traveling salesman problem showed that it is possible to achieve better results by adaptively adjusting the usage of double operators, rather than by combining any single genetic operators.

Keywords

Combination genetic algorithm genetic operators synergy traveling salesman problem 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Gutin, G., Punnen, A.P.: The Traveling Salesman Problem and Its Variations. Kluwer Academic Publishers, New York (2004)MATHGoogle Scholar
  2. 2.
  3. 3.
    Sivanandam, S.N., Deepa, S.N.: Introduction to Genetic Algorithms. Springer, Heidelberg (2008)MATHGoogle Scholar
  4. 4.
    Haupt, R.L., Haupt, S.E.: Practical Genetic Algorithms, 2nd edn. John Wiley and Sons, New Jersey (2004)MATHGoogle Scholar
  5. 5.
    Tuson, A., Ross, P.: Cost Based Operator Rate Adaption: An Investigation. In: Ebeling, W., Rechenberg, I., Voigt, H.-M., Schwefel, H.-P. (eds.) PPSN 1996. LNCS, vol. 1141, pp. 461–469. Springer, Heidelberg (1996)CrossRefGoogle Scholar
  6. 6.
    Tasgetiren, M.F., Suganthan, P.N., Pan, Q.K.: An Ensemble of Discrete Differential Evolution Algorithms for Solving the Generalized Traveling Salesman Problem. Applied Mathematics and Computation 215(9), 3356–3368 (2010)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Zhang, L., Wang, L., Zheng, D.-Z.: An Adaptive Genetic Algorithm with Multiple Operators for Flow Shop Scheduling. Int. J. of Advanced Manufacturing Technology 27(5-6), 580–587 (2006)CrossRefGoogle Scholar
  8. 8.
    Mallipeddi, R., Suganthan, P.N., Pan, Q.K., Tasgetiren, M.F.: Differential Evolution Algorithm with Ensemble of Parameters and Mutation Strategies. Applied Soft Computing 11(2), 1679–1696 (2011)CrossRefGoogle Scholar
  9. 9.
    El-Mihoub, T.A., Hopgood, A.A., Nolle, L., Battersby, A.: Hybrid Genetic Algorithms: A Review. Engineering Letters 13(2) (2006), http://www.engineeringletters.com/issues_v13/issue_2/EL_13_2_11.pdf
  10. 10.
    Larranaga, P., Kuijpers, C.M.H., Murga, R.H., Inza, I., Dizdarevic, S.: Genetic Algorithms for the Traveling Salesman Problem: A Review of Representations and Operators. Artificial Intelligence Review 13, 129–170 (1999)CrossRefGoogle Scholar
  11. 11.
    Golub, M., Jakobovic, D., Budin, L.: Parallelization of Elimination Tournament Selection without Synchronization. In: Proc. of the 5th IEEE Int. Conf. on Intelligent Engineering Systems, INES 2001, Helsinki, Finland, September 16-18, pp. 85–89 (2001)Google Scholar
  12. 12.
    Johnson, D.S., McGeoch, L.A.: The Traveling Salesman Problem: A Case Study in Local Optimization. In: Aarts, E.H.L., Lenstra, J.K. (eds.) Local Search in Combinatorial Optimization, pp. 215–310. John Wiley and Sons, London (1997)Google Scholar
  13. 13.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Goran Martinovic
    • 1
  • Drazen Bajer
    • 1
  1. 1.Faculty of Electrical EngineeringJosip Juraj Strossmayer University of OsijekOsijekCroatia

Personalised recommendations