{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,22]],"date-time":"2026-03-22T06:18:31Z","timestamp":1774160311138,"version":"3.50.1"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319452425","type":"print"},{"value":"9783319452432","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-45243-2_48","type":"book-chapter","created":{"date-parts":[[2016,9,19]],"date-time":"2016-09-19T09:41:42Z","timestamp":1474278102000},"page":"520-530","source":"Crossref","is-referenced-by-count":6,"title":["Hybrid Harmony Search Combined with Variable Neighborhood Search for the Traveling Tournament Problem"],"prefix":"10.1007","author":[{"given":"Meriem","family":"Khelifa","sequence":"first","affiliation":[]},{"given":"Dalila","family":"Boughaci","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,20]]},"reference":[{"key":"48_CR1","doi-asserted-by":"crossref","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, 154\u2013160 (1994)","journal-title":"ORSA J. Comput."},{"key":"48_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"crossref","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, A.F. (eds.) MICAI 2007. LNCS (LNAI), vol. 4827, pp. 83\u201393. Springer, Heidelberg (2007)"},{"key":"48_CR3","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1007\/11874850_25","volume-title":"Advances in Artificial Intelligence - IBERAMIA-SBIA 2006","author":"FL Biajoli","year":"2006","unstructured":"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\u2013217. Springer, Heidelberg (2006)"},{"key":"48_CR4","doi-asserted-by":"crossref","first-page":"1089","DOI":"10.1016\/j.cie.2012.08.002","volume":"63","author":"MAMD Carvalho","year":"2012","unstructured":"Carvalho, M.A.M.D., Lorena, L.A.N.: New models for the mirrored traveling tournament problem. Comput. Ind. Eng. 63, 1089\u20131095 (2012)","journal-title":"Comput. Ind. Eng."},{"key":"48_CR5","unstructured":"Challenge Traveling Tournament Problems. http:\/\/mat.gsia.cmu.edu\/TOURN\/"},{"key":"48_CR6","first-page":"79","volume":"2","author":"NS Choubey","year":"2010","unstructured":"Choubey, N.S.: a novel encoding scheme for traveling tournament problem using genetic algorithm. IJCA Spec. Issue Evol. Comput. 2, 79\u201382 (2010)","journal-title":"IJCA Spec. Issue Evol. Comput."},{"key":"48_CR7","doi-asserted-by":"crossref","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. Discrete Appl. Math. 21, 47\u201365 (1988)","journal-title":"Discrete Appl. Math."},{"key":"48_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1007\/3-540-45578-7_43","volume-title":"Principles and Practice of Constraint Programming - CP 2001","author":"K Easton","year":"2001","unstructured":"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\u2013584. Springer, Heidelberg (2001)"},{"key":"48_CR9","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s10732-006-9007-x","volume":"13","author":"LD Gaspero","year":"2007","unstructured":"Gaspero, L.D., Schaerf, A.: A composite-neighborhood tabu search approach to the traveling tournament problem. J. Heuristics 13, 189\u2013207 (2007)","journal-title":"J. Heuristics"},{"key":"48_CR10","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1177\/003754970107600201","volume":"76","author":"ZW Geem","year":"2001","unstructured":"Geem, Z.W., Kim, J.H.: A new heuristic optimization algorithm: harmony search. Simulation 76, 60\u201368 (2001)","journal-title":"Simulation"},{"key":"48_CR11","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1007\/s10951-011-0244-y","volume":"14","author":"ACB Guedes","year":"2011","unstructured":"Guedes, A.C.B., Ribeiro, C.C.: A heuristic for minimizing weighted carry-over effects in round robin tournaments. J. Sched. 14, 655\u2013667 (2011)","journal-title":"J. Sched."},{"key":"48_CR12","doi-asserted-by":"crossref","unstructured":"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\u2013330. IEEE, Noida (2013)","DOI":"10.1109\/IC3.2013.6612213"},{"key":"48_CR13","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P Hansen","year":"2001","unstructured":"Hansen, P.: Mladenovi, N.: Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130, 449\u2013467 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"48_CR14","doi-asserted-by":"crossref","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, 218\u2013228 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"48_CR15","doi-asserted-by":"crossref","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 Discrete Math. 47, 157\u2013164 (2015)","journal-title":"Electron. Notes Discrete Math."},{"key":"48_CR16","doi-asserted-by":"crossref","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.X., Wang, X.: A DE-based approach to no-wait flow-shop scheduling. Comput. Ind. Eng. 57, 787\u2013805 (2009)","journal-title":"Comput. Ind. Eng."},{"key":"48_CR17","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/s10479-008-0384-4","volume":"171","author":"RV Rasmussen","year":"2008","unstructured":"Rasmussen, R.V., Trick, M.A.: The timetable constrained distance minimization problem. Ann. Oper. Res. 171, 45\u201359 (2008)","journal-title":"Ann. Oper. Res."},{"key":"48_CR18","doi-asserted-by":"crossref","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, 775\u2013787 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"48_CR19","doi-asserted-by":"crossref","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, 345\u2013351 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"48_CR20","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s10479-012-1061-1","volume":"218","author":"S Westphal","year":"2012","unstructured":"Westphal, S., Noparlik, K.: A 5.875-approximation for the traveling tournament problem. Ann. Oper. Res. 218, 347\u2013360 (2012)","journal-title":"Ann. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Computational Collective Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-45243-2_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T19:08:47Z","timestamp":1498331327000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-45243-2_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319452425","9783319452432"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-45243-2_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}