Skip to main content
SpringerLink
Log in

Hybrid Harmony Search Combined with Variable Neighborhood Search for the Traveling Tournament Problem

  • Conference paper
  • First Online:
Computational Collective Intelligence (ICCCI 2016)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 9875))

Included in the following conference series:

Abstract

In this paper, we are interested in the mirrored version of the traveling tournament problem (mTTP) with reversed venues. We propose a new enhanced harmony search combined with a variable neighborhood search (V-HS) for mTTP. We use a largest-order-value rule to transform harmonies from real vectors to abstract schedules. We use also a variable neighborhood search (VNS) as an improvement strategy to enhance the quality of solutions and improve the intensification mechanism of harmony search. The overall method is evaluated on benchmarks and compared with other techniques for mTTP. The numerical results are encouraging and demonstrate the benefits of our approach. The proposed V-HS method succeeds in finding high quality solutions for several considered instances of mTTP.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bean, J.C.: Genetic algorithms and random keys for sequencing and optimization. ORSA J. Comput. 6, 154–160 (1994)

    Article  MATH  Google Scholar 

  2. Biajoli, F.L., Lorena, L.A.N.: Clustering search approach for the traveling tournament problem. In: Gelbukh, A., Kuri Morales, A.F. (eds.) MICAI 2007. LNCS (LNAI), vol. 4827, pp. 83–93. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  3. Biajoli, F.L., Lorena, L.A.N.: Mirrored traveling tournament problem: an evolutionary approach. In: Sichman, J.S., Coelho, H., Rezende, S.O. (eds.) IBERAMIA 2006 and SBIA 2006. LNCS (LNAI), vol. 4140, pp. 208–217. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  4. Carvalho, M.A.M.D., Lorena, L.A.N.: New models for the mirrored traveling tournament problem. Comput. Ind. Eng. 63, 1089–1095 (2012)

    Article  Google Scholar 

  5. Challenge Traveling Tournament Problems. http://mat.gsia.cmu.edu/TOURN/

  6. Choubey, N.S.: a novel encoding scheme for traveling tournament problem using genetic algorithm. IJCA Spec. Issue Evol. Comput. 2, 79–82 (2010)

    Google Scholar 

  7. de Werra, D.: Some models of graphs for scheduling sports competitions. Discrete Appl. Math. 21, 47–65 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  8. Easton, K., Nemhauser, G.L., Trick, M.A.: The traveling tournament problem description and benchmarks. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 580–584. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  9. Gaspero, L.D., Schaerf, A.: A composite-neighborhood tabu search approach to the traveling tournament problem. J. Heuristics 13, 189–207 (2007)

    Article  Google Scholar 

  10. Geem, Z.W., Kim, J.H.: A new heuristic optimization algorithm: harmony search. Simulation 76, 60–68 (2001)

    Article  Google Scholar 

  11. Guedes, A.C.B., Ribeiro, C.C.: A heuristic for minimizing weighted carry-over effects in round robin tournaments. J. Sched. 14, 655–667 (2011)

    Article  MathSciNet  Google Scholar 

  12. Gupta, D., Goel, D., Aggarwal, V.: A hybrid biogeography based heuristic for the mirrored traveling tournament problem. In: 2013 Sixth International Conference on Contemporary Computing (IC3), pp. 325–330. IEEE, Noida (2013)

    Google Scholar 

  13. Hansen, P.: Mladenovi, N.: Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130, 449–467 (2001)

    Article  MATH  Google Scholar 

  14. Irnich, S.: A new branch-and-price algorithm for the traveling tournament problem. Eur. J. Oper. Res. 204, 218–228 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  15. Khelifa, M., Boughaci, D.: A variable neighborhood search method for solving the traveling tournaments problem. Electron. Notes Discrete Math. 47, 157–164 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  16. Qian, B., Wang, L., Hu, R., Huang, D.X., Wang, X.: A DE-based approach to no-wait flow-shop scheduling. Comput. Ind. Eng. 57, 787–805 (2009)

    Article  Google Scholar 

  17. Rasmussen, R.V., Trick, M.A.: The timetable constrained distance minimization problem. Ann. Oper. Res. 171, 45–59 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  18. Ribeiro, C.C., Urrutia, S.: Heuristics for the mirrored traveling tournament problem. Eur. J. Oper. Res. 179, 775–787 (2007)

    Article  MATH  Google Scholar 

  19. Thielen, C., Westphal, S.: Complexity of the traveling tournament problem. Theor. Comput. Sci. 412, 345–351 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  20. Westphal, S., Noparlik, K.: A 5.875-approximation for the traveling tournament problem. Ann. Oper. Res. 218, 347–360 (2012)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LRIA-FEI, Computer Science Department, USTHB, BP 32 El-Alia, 16111, Bab-Ezzouar, Algiers, Algeria

    Meriem Khelifa & Dalila Boughaci

Authors
  1. Meriem Khelifa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dalila Boughaci
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Meriem Khelifa .

Editor information

Editors and Affiliations

  1. Wrocław University of Technology, Wrocław, Poland

    Ngoc-Thanh Nguyen

  2. Aristotle University of Thessaloniki, Thessaloniki, Greece

    Lazaros Iliadis

  3. Department of Forestry and Management, Democritus University of Thrace, Orestiada, Thrace, Greece

    Yannis Manolopoulos

  4. Wrocław University of Technology, Wrocław, Poland

    Bogdan Trawiński

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Khelifa, M., Boughaci, D. (2016). Hybrid Harmony Search Combined with Variable Neighborhood Search for the Traveling Tournament Problem. In: Nguyen, NT., Iliadis, L., Manolopoulos, Y., Trawiński, B. (eds) Computational Collective Intelligence. ICCCI 2016. Lecture Notes in Computer Science(), vol 9875. Springer, Cham. https://doi.org/10.1007/978-3-319-45243-2_48

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-45243-2_48

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-45242-5

  • Online ISBN: 978-3-319-45243-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation