Skip to main content

2016 | OriginalPaper | Buchkapitel

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

verfasst von : Meriem Khelifa, Dalila Boughaci

Erschienen in: Computational Collective Intelligence

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Bean, J.C.: Genetic algorithms and random keys for sequencing and optimization. ORSA J. Comput. 6, 154–160 (1994)CrossRefMATH Bean, J.C.: Genetic algorithms and random keys for sequencing and optimization. ORSA J. Comput. 6, 154–160 (1994)CrossRefMATH
2.
Zurück zum Zitat 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)CrossRef 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)CrossRef
3.
Zurück zum Zitat 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)CrossRef 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)CrossRef
4.
Zurück zum Zitat Carvalho, M.A.M.D., Lorena, L.A.N.: New models for the mirrored traveling tournament problem. Comput. Ind. Eng. 63, 1089–1095 (2012)CrossRef Carvalho, M.A.M.D., Lorena, L.A.N.: New models for the mirrored traveling tournament problem. Comput. Ind. Eng. 63, 1089–1095 (2012)CrossRef
6.
Zurück zum Zitat Choubey, N.S.: a novel encoding scheme for traveling tournament problem using genetic algorithm. IJCA Spec. Issue Evol. Comput. 2, 79–82 (2010) Choubey, N.S.: a novel encoding scheme for traveling tournament problem using genetic algorithm. IJCA Spec. Issue Evol. Comput. 2, 79–82 (2010)
8.
Zurück zum Zitat 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)CrossRef 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)CrossRef
9.
Zurück zum Zitat Gaspero, L.D., Schaerf, A.: A composite-neighborhood tabu search approach to the traveling tournament problem. J. Heuristics 13, 189–207 (2007)CrossRef Gaspero, L.D., Schaerf, A.: A composite-neighborhood tabu search approach to the traveling tournament problem. J. Heuristics 13, 189–207 (2007)CrossRef
10.
Zurück zum Zitat Geem, Z.W., Kim, J.H.: A new heuristic optimization algorithm: harmony search. Simulation 76, 60–68 (2001)CrossRef Geem, Z.W., Kim, J.H.: A new heuristic optimization algorithm: harmony search. Simulation 76, 60–68 (2001)CrossRef
11.
Zurück zum Zitat 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)MathSciNetCrossRef 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)MathSciNetCrossRef
12.
Zurück zum Zitat 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) 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)
13.
Zurück zum Zitat Hansen, P.: Mladenovi, N.: Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130, 449–467 (2001)CrossRefMATH Hansen, P.: Mladenovi, N.: Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130, 449–467 (2001)CrossRefMATH
14.
15.
Zurück zum Zitat Khelifa, M., Boughaci, D.: A variable neighborhood search method for solving the traveling tournaments problem. Electron. Notes Discrete Math. 47, 157–164 (2015)MathSciNetCrossRefMATH Khelifa, M., Boughaci, D.: A variable neighborhood search method for solving the traveling tournaments problem. Electron. Notes Discrete Math. 47, 157–164 (2015)MathSciNetCrossRefMATH
16.
Zurück zum Zitat 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)CrossRef 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)CrossRef
17.
18.
Zurück zum Zitat Ribeiro, C.C., Urrutia, S.: Heuristics for the mirrored traveling tournament problem. Eur. J. Oper. Res. 179, 775–787 (2007)CrossRefMATH Ribeiro, C.C., Urrutia, S.: Heuristics for the mirrored traveling tournament problem. Eur. J. Oper. Res. 179, 775–787 (2007)CrossRefMATH
19.
20.
Zurück zum Zitat Westphal, S., Noparlik, K.: A 5.875-approximation for the traveling tournament problem. Ann. Oper. Res. 218, 347–360 (2012)MathSciNetCrossRefMATH Westphal, S., Noparlik, K.: A 5.875-approximation for the traveling tournament problem. Ann. Oper. Res. 218, 347–360 (2012)MathSciNetCrossRefMATH
Metadaten
Titel
Hybrid Harmony Search Combined with Variable Neighborhood Search for the Traveling Tournament Problem
verfasst von
Meriem Khelifa
Dalila Boughaci
Copyright-Jahr
2016
DOI
https://doi.org/10.1007/978-3-319-45243-2_48