{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T05:04:34Z","timestamp":1761541474491},"publisher-location":"Cham","reference-count":44,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319998091"},{"type":"electronic","value":"9783319998107"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-99810-7_5","type":"book-chapter","created":{"date-parts":[[2018,9,23]],"date-time":"2018-09-23T17:13:00Z","timestamp":1537722780000},"page":"93-117","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Evolutionary Harmony Search Algorithm for Sport Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Meriem","family":"Khelifa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dalila","family":"Boughaci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Esma","family":"A\u00efmeur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,24]]},"reference":[{"key":"5_CR1","unstructured":"Challenge traveling tournament instances. http:\/\/mat.tepper.cmu.edu\/TOURN\/ . Accessed 29 Jan 2016"},{"issue":"2","key":"5_CR2","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10951-006-7187-8","volume":"9","author":"A Anagnostopoulos","year":"2006","unstructured":"Anagnostopoulos, A., Michel, L., Hentenryck, P.V., Vergados, Y.: A simulated annealing approach to the traveling tournament problem. J. Sched. 9(2), 177\u2013193 (2006)","journal-title":"J. Sched."},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/3-540-29057-5_14","volume-title":"Stochastic Modeling of Manufacturing Systems","author":"S Axs\u00e4ter","year":"2006","unstructured":"Axs\u00e4ter, S.: Planning order releases for an assembly system with random operation times. In: Liberopoulos, G., Papadopoulos, C.T., Tan, B., Smith, J.M., Gershwin, S.B. (eds.) Stochastic Modeling of Manufacturing Systems, pp. 333\u2013344. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-29057-5_14"},{"issue":"2","key":"5_CR4","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"JC Bean","year":"1994","unstructured":"Bean, J.C.: Genetic algorithms and random keys for sequencing and optimization. ORSA J. Comput. 6(2), 154\u2013160 (1994)","journal-title":"ORSA J. Comput."},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-540-76631-5_9","volume-title":"MICAI 2007: Advances in Artificial Intelligence","author":"FL Biajoli","year":"2007","unstructured":"Biajoli, F.L., Lorena, L.A.N.: Clustering search approach for the traveling tournament problem. In: Gelbukh, A., Kuri Morales, \u00c1.F. (eds.) MICAI 2007. LNCS (LNAI), vol. 4827, pp. 83\u201393. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-76631-5_9"},{"issue":"01","key":"5_CR6","doi-asserted-by":"publisher","first-page":"1250008","DOI":"10.1142\/S1469026812500083","volume":"11","author":"LP C\u00e1ceres","year":"2012","unstructured":"C\u00e1ceres, L.P., Riff, M.C.: AISTTP: an artificial immune algorithm to solve traveling tournament problems. Int. J. Comput. Intell. Appl. 11(01), 1250008 (2012)","journal-title":"Int. J. Comput. Intell. Appl."},{"issue":"4","key":"5_CR7","doi-asserted-by":"publisher","first-page":"1089","DOI":"10.1016\/j.cie.2012.08.002","volume":"63","author":"MAM Carvalho de","year":"2012","unstructured":"de Carvalho, M.A.M., Lorena, L.A.N.: New models for the mirrored traveling tournament problem. Comput. Ind. Eng. 63(4), 1089\u20131095 (2012)","journal-title":"Comput. Ind. Eng."},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Chen, P.C., Kendall, G., Berghe, G.V.: An ant based hyper-heuristic for the travelling tournament problem. In: IEEE Symposium on Computational Intelligence in Scheduling, SCIS 2007, pp. 19\u201326. IEEE (2007)","DOI":"10.1109\/SCIS.2007.367665"},{"issue":"7","key":"5_CR9","doi-asserted-by":"publisher","first-page":"79","DOI":"10.5120\/1536-139","volume":"2","author":"NS Choubey","year":"2010","unstructured":"Choubey, N.S.: A novel encoding scheme for traveling tournament problem using genetic algorithm. IJCA 2(7), 79\u201382 (2010). Special Issue on Evolutionary Computation","journal-title":"IJCA"},{"issue":"1","key":"5_CR10","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s10479-010-0719-9","volume":"194","author":"FN Costa","year":"2012","unstructured":"Costa, F.N., Urrutia, S., Ribeiro, C.C.: An ils heuristic for the traveling tournament problem with predefined venues. Ann. Oper. Res. 194(1), 137\u2013150 (2012)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"5_CR11","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s10732-006-9007-x","volume":"13","author":"L Gaspero Di","year":"2007","unstructured":"Di Gaspero, L., Schaerf, A.: A composite-neighborhood tabu search approach to the traveling tournament problem. J. Heuristics 13(2), 189\u2013207 (2007)","journal-title":"J. Heuristics"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/3-540-45578-7_43","volume-title":"Principles and Practice of Constraint Programming \u2014 CP 2001","author":"K Easton","year":"2001","unstructured":"Easton, K., Nemhauser, G., Trick, M.: The traveling tournament problem description and benchmarks. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 580\u2013584. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45578-7_43"},{"issue":"2","key":"5_CR13","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s10845-014-0869-8","volume":"27","author":"KZ Gao","year":"2016","unstructured":"Gao, K.Z., Suganthan, P.N., Pan, Q.K., Chua, T.J., Cai, T.X., Chong, C.S.: Discrete harmony search algorithm for flexible job shop scheduling problem with multiple objectives. J. Intell. Manuf. 27(2), 363\u2013374 (2016)","journal-title":"J. Intell. Manuf."},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/978-3-540-73007-1_39","volume-title":"Computational and Ambient Intelligence","author":"ZW Geem","year":"2007","unstructured":"Geem, Z.W.: Optimal scheduling of multiple dam system using harmony search algorithm. In: Sandoval, F., Prieto, A., Cabestany, J., Gra\u00f1a, M. (eds.) IWANN 2007. LNCS, vol. 4507, pp. 316\u2013323. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73007-1_39"},{"key":"5_CR15","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00185-7","volume-title":"Music-Inspired Harmony Search Algorithm: Theory and Applications","author":"ZW Geem","year":"2009","unstructured":"Geem, Z.W.: Music-Inspired Harmony Search Algorithm: Theory and Applications. SCI, vol. 191. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00185-7"},{"issue":"2","key":"5_CR16","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1177\/003754970107600201","volume":"76","author":"ZW Geem","year":"2001","unstructured":"Geem, Z.W., Kim, J.H., Loganathan, G.: A new heuristic optimization algorithm: harmony search. Simulation 76(2), 60\u201368 (2001)","journal-title":"Simulation"},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.ijepes.2016.04.028","volume":"86","author":"ZW Geem","year":"2017","unstructured":"Geem, Z.W., Yoon, Y.: Harmony search optimization of renewable energy charging with energy storage system. Int. J. Electr. Power Energy Syst. 86, 120\u2013126 (2017)","journal-title":"Int. J. Electr. Power Energy Syst."},{"issue":"1","key":"5_CR18","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s10479-014-1586-6","volume":"239","author":"M Goerigk","year":"2016","unstructured":"Goerigk, M., Westphal, S.: A combined local search and integer programming approach to the traveling tournament problem. Ann. Oper. Res. 239(1), 343\u2013354 (2016). https:\/\/doi.org\/10.1007\/s10479-014-1586-6","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"5_CR19","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P Hansen","year":"2001","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130(3), 449\u2013467 (2001)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"5_CR20","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s10479-012-1161-y","volume":"218","author":"S Imahori","year":"2014","unstructured":"Imahori, S., Matsui, T., Miyashiro, R.: A 2.75-approximation algorithm for the unconstrained traveling tournament problem. Ann. Oper. Res. 218(1), 237\u2013247 (2014)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"5_CR21","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/j.ejor.2009.10.024","volume":"204","author":"S Irnich","year":"2010","unstructured":"Irnich, S.: A new branch-and-price algorithm for the traveling tournament problem. Eur. J. Oper. Res. 204(2), 218\u2013228 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"5_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2016.03.038","volume":"254","author":"T Januario","year":"2016","unstructured":"Januario, T., Urrutia, S., Ribeiro, C.C., De Werra, D.: Edge coloring: a natural model for sports scheduling. Eur. J. Oper. Res. 254(1), 1\u20138 (2016)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"5_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2009.05.013","volume":"37","author":"G Kendall","year":"2010","unstructured":"Kendall, G., Knust, S., Ribeiro, C.C., Urrutia, S.: Scheduling in sports: an annotated bibliography. Comput. Oper. Res. 37(1), 1\u201319 (2010)","journal-title":"Comput. Oper. Res."},{"key":"5_CR24","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.endm.2014.11.021","volume":"47","author":"M Khelifa","year":"2015","unstructured":"Khelifa, M., Boughaci, D.: A variable neighborhood search method for solving the traveling tournaments problem. Electron. Notes Discret. Math. 47, 157\u2013164 (2015)","journal-title":"Electron. Notes Discret. Math."},{"key":"5_CR25","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1007\/978-3-319-45243-2_48","volume-title":"Computational Collective Intelligence","author":"M Khelifa","year":"2016","unstructured":"Khelifa, M., Boughaci, D.: Hybrid harmony search combined with variable neighborhood search for the traveling tournament problem. In: Nguyen, N.-T., Manolopoulos, Y., Iliadis, L., Trawi\u0144ski, B. (eds.) ICCCI 2016. LNCS (LNAI), vol. 9875, pp. 520\u2013530. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-45243-2_48"},{"issue":"2","key":"5_CR26","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0377-2217(92)90138-Y","volume":"59","author":"G Laporte","year":"1992","unstructured":"Laporte, G.: The traveling salesman problem: an overview of exact and approximate algorithms. Eur. J. Oper. Res. 59(2), 231\u2013247 (1992)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"5_CR27","doi-asserted-by":"publisher","first-page":"1459","DOI":"10.1016\/j.ejor.2005.02.065","volume":"174","author":"A Lim","year":"2006","unstructured":"Lim, A., Rodrigues, B., Zhang, X.: A simulated annealing and hill-climbing algorithm for the traveling tournament problem. Eur. J. Oper. Res. 174(3), 1459\u20131478 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"5_CR28","doi-asserted-by":"crossref","first-page":"1567","DOI":"10.1016\/j.amc.2006.11.033","volume":"188","author":"M Mahdavi","year":"2007","unstructured":"Mahdavi, M., Fesanghary, M., Damangir, E.: An improved harmony search algorithm for solving optimization problems. Appl. Math. Comput. 188(2), 1567\u20131579 (2007)","journal-title":"Appl. Math. Comput."},{"issue":"4","key":"5_CR29","first-page":"25","volume":"36","author":"D Markovi\u0107","year":"2013","unstructured":"Markovi\u0107, D., Petrovi\u0107, G., \u0106ojba\u0161i\u0107, \u017d., Marinkovi\u0107, D.: A comparative analysis of metaheuristic maintenance optimization of refuse collection vehicles using the Taguchi experimental design. Trans. FAMENA 36(4), 25\u201338 (2013)","journal-title":"Trans. FAMENA"},{"key":"5_CR30","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-642-29210-1_55","volume-title":"Operations Research Proceedings 2011","author":"M Padberg","year":"2012","unstructured":"Padberg, M.: Harmony search algorithms for binary optimization problems. In: Klatte, D., L\u00fcthi, H.J., Schmedders, K. (eds.) Operations Research Proceedings 2011, pp. 343\u2013348. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29210-1_55"},{"issue":"3","key":"5_CR31","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1016\/j.cie.2009.02.006","volume":"57","author":"B Qian","year":"2009","unstructured":"Qian, B., Wang, L., Hu, R., Huang, D., Wang, X.: A DE-based approach to no-wait flow-shop scheduling. Comput. Ind. Eng. 57(3), 787\u2013805 (2009)","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"5_CR32","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s10479-008-0384-4","volume":"171","author":"RV Rasmussen","year":"2009","unstructured":"Rasmussen, R.V., Trick, M.A.: The timetable constrained distance minimization problem. Ann. Oper. Res. 171(1), 45 (2009)","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"5_CR33","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1016\/j.ejor.2005.03.061","volume":"179","author":"CC Ribeiro","year":"2007","unstructured":"Ribeiro, C.C., Urrutia, S.: Heuristics for the mirrored traveling tournament problem. Eur. J. Oper. Res. 179(3), 775\u2013787 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"5_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-540-45157-0_22","volume-title":"Practice and Theory of Automated Timetabling IV","author":"O Rossi-Doria","year":"2003","unstructured":"Rossi-Doria, O., et al.: A comparison of the performance of different metaheuristics on the timetabling problem. In: Burke, E., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol. 2740, pp. 329\u2013351. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45157-0_22"},{"issue":"1","key":"5_CR35","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.jcsr.2008.02.005","volume":"65","author":"M Saka","year":"2009","unstructured":"Saka, M.: Optimum design of steel sway frames to BS5950 using harmony search algorithm. J. Constr. Steel Res. 65(1), 36\u201343 (2009)","journal-title":"J. Constr. Steel Res."},{"issue":"3","key":"5_CR36","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1016\/j.ijepes.2010.12.031","volume":"33","author":"S Sivasubramani","year":"2011","unstructured":"Sivasubramani, S., Swarup, K.: Multi-objective harmony search algorithm for optimal power flow problem. Int. J. Electr. Power Energy Syst. 33(3), 745\u2013752 (2011)","journal-title":"Int. J. Electr. Power Energy Syst."},{"issue":"4\u20135","key":"5_CR37","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.tcs.2010.10.001","volume":"412","author":"C Thielen","year":"2011","unstructured":"Thielen, C., Westphal, S.: Complexity of the traveling tournament problem. Theor. Comput. Sci. 412(4\u20135), 345\u2013351 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR38","doi-asserted-by":"crossref","unstructured":"Uthus, D.C., Riddle, P.J., Guesgen, H.W.: An ant colony optimization approach to the traveling tournament problem. In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation, pp. 81\u201388. ACM (2009)","DOI":"10.1145\/1569901.1569913"},{"key":"5_CR39","unstructured":"Van Hentenryck, P., Vergados, Y.: Population-based simulated annealing for traveling tournaments. In: Proceedings of the National Conference on Artificial Intelligence, vol. 22, p. 267. MIT Press, Cambridge, London (1999). AAAI Press, Menlo Park (2007)"},{"issue":"4","key":"5_CR40","doi-asserted-by":"publisher","first-page":"2826","DOI":"10.1016\/j.eswa.2009.09.008","volume":"37","author":"CM Wang","year":"2010","unstructured":"Wang, C.M., Huang, Y.F.: Self-adaptive harmony search algorithm for optimization. Expert. Syst. Appl. 37(4), 2826\u20132837 (2010)","journal-title":"Expert. Syst. Appl."},{"issue":"12","key":"5_CR41","doi-asserted-by":"publisher","first-page":"7929","DOI":"10.1016\/j.eswa.2010.04.042","volume":"37","author":"L Wang","year":"2010","unstructured":"Wang, L., Pan, Q.K., Tasgetiren, M.F.: Minimizing the total flow time in a flow shop with blocking by using hybrid harmony search algorithms. Expert. Syst. Appl. 37(12), 7929\u20137936 (2010)","journal-title":"Expert. Syst. Appl."},{"issue":"1","key":"5_CR42","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0166-218X(88)90033-9","volume":"21","author":"D Werra de","year":"1988","unstructured":"de Werra, D.: Some models of graphs for scheduling sports competitions. Discret. Appl. Math. 21(1), 47\u201365 (1988)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"5_CR43","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s10479-012-1061-1","volume":"218","author":"S Westphal","year":"2014","unstructured":"Westphal, S., Noparlik, K.: A 5.875-approximation for the traveling tournament problem. Ann. Oper. Res. 218(1), 347\u2013360 (2014)","journal-title":"Ann. Oper. Res."},{"key":"5_CR44","doi-asserted-by":"crossref","unstructured":"Weyland, D.: A rigorous analysis of the harmony search algorithm: how the research community can be. In: Modeling, Analysis, and Applications in Metaheuristic Computing: Advancements and Trends: Advancements and Trends, p. 72 (2012)","DOI":"10.4018\/978-1-4666-0270-0.ch005"}],"container-title":["Lecture Notes in Computer Science","Transactions on Computational Collective Intelligence XXX"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99810-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,2]],"date-time":"2022-09-02T12:55:39Z","timestamp":1662123339000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-99810-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319998091","9783319998107"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99810-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}