{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:32:21Z","timestamp":1725535941003},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642030697"},{"type":"electronic","value":"9783642030703"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03070-3_38","type":"book-chapter","created":{"date-parts":[[2009,7,15]],"date-time":"2009-07-15T15:55:54Z","timestamp":1247673354000},"page":"505-515","source":"Crossref","is-referenced-by-count":0,"title":["An Improved Tabu Search (ITS) Algorithm Based on Open Cover Theory for Global Extremums"],"prefix":"10.1007","author":[{"given":"Kemal","family":"Y\u00fcksek","sequence":"first","affiliation":[]},{"given":"Serhat","family":"Cakaloglu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"38_CR1","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"Glover, F.: Tabu Search: part I. ORSA Journal on Computing\u00a01, 190\u2013206 (1989)","journal-title":"ORSA Journal on Computing"},{"key":"38_CR2","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F. Glover","year":"1990","unstructured":"Glover, F.: Tabu Search: part II. ORSA Journal on Computing\u00a02, 4\u201332 (1990)","journal-title":"ORSA Journal on Computing"},{"key":"38_CR3","doi-asserted-by":"crossref","unstructured":"Youssef, H., Sait, S.M., Adiche, H.: Evalutiory algorithms, simulated annealing and a tabu search: a comparative study. In: Engineering Applications of Artificial Intelligence, vol. 14 (2001)","DOI":"10.1016\/S0952-1976(00)00065-8"},{"key":"38_CR4","first-page":"70","volume-title":"Modern Heuristic Techniques for Combinatorial Problems","author":"F. Glover","year":"1993","unstructured":"Glover, F., Laguna, M.: Tabu Search. In: Reeves, C.R. (ed.) Modern Heuristic Techniques for Combinatorial Problems, pp. 70\u2013150. Blackwell, Malden (1993)"},{"key":"38_CR5","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BF01720782","volume":"11","author":"D. Werra de","year":"1989","unstructured":"de Werra, D., Hertz, A.: Tabu Search Techniques: A Tutorial and an Application to Neural Networks. OR Spektrum\u00a011, 131\u2013141 (1989)","journal-title":"OR Spektrum"},{"key":"38_CR6","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/BF01471219","volume":"2","author":"A.M. Laguna","year":"1991","unstructured":"Laguna, A.M., Barnes, A.J.W., Glover, A.F.: Tabu Search Methodology for a Single Machine Scheduling Problem. J. of Int. Manufacturing\u00a02, 63\u201374 (1991)","journal-title":"J. of Int. Manufacturing"},{"key":"38_CR7","doi-asserted-by":"crossref","unstructured":"Porto, A.S.C.S., Ribeiro, A.C.C.: A Tabu Search Approach to Task Scheduling on Heterogeneous Processors under Precedence Constraints. International Journal of High-Speed Computing\u00a07(2) (1995)","DOI":"10.1142\/S012905339500004X"},{"key":"38_CR8","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1287\/ijoc.12.3.223.12638","volume":"12","author":"T.G. Crainic","year":"2000","unstructured":"Crainic, T.G., Gendreau, M., Farvolden, J.M.: Simplex-based Tabu Search for the Multicommodity Capacitated Fixed Charge Network Design Problem. INFORMS Journal on Computing\u00a012, 223\u2013236 (2000)","journal-title":"INFORMS Journal on Computing"},{"key":"38_CR9","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/BF02023004","volume":"41","author":"I.H. Osman","year":"1993","unstructured":"Osman, I.H.: Metastrategy Simulated Annealing and Tabu Search Algorithms for the Vehicle Routing Problem. Annals of Operations Research\u00a041, 421\u2013451 (1993)","journal-title":"Annals of Operations Research"},{"key":"38_CR10","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1287\/trsc.33.4.381","volume":"33","author":"M. Gendreau","year":"1999","unstructured":"Gendreau, M., Guertin, F., Potvin, J.-Y., Taillard, \u00c9.D.: Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching. Transportation Science\u00a033, 381\u2013390 (1999)","journal-title":"Transportation Science"},{"key":"38_CR11","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/BF02023076","volume":"41","author":"M. Dell\u2019Amico","year":"1993","unstructured":"Dell\u2019Amico, M., Trubian, M.: Applying Tabu Search to the Job-Shop Scheduling Problem. Annals of Operations Research\u00a041, 231\u2013252 (1993)","journal-title":"Annals of Operations Research"},{"issue":"2","key":"38_CR12","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1287\/ijoc.6.2.126","volume":"6","author":"R. Battiti","year":"1994","unstructured":"Battiti, R., Tecchiolli, G.: The Reactive Tabu Search. ORSA Journal on Computing\u00a06(2), 126\u2013140 (1994a); A description of a specialized tabu search implementation that seeks to dynamically control search parameters with feedback mechanisms","journal-title":"ORSA Journal on Computing"},{"key":"38_CR13","unstructured":"Fang, Y., Liu, G., He, Y., Qiu, Y.: Tabu search algorithm based on insertion method. In: IEEE Int. Conf. Neural Network & Signal Processing, Nanjing,China, December 14-17 (2003)"},{"issue":"2","key":"38_CR14","doi-asserted-by":"publisher","first-page":"1184","DOI":"10.1109\/TMAG.2004.824909","volume":"40","author":"O. Hajji","year":"2004","unstructured":"Hajji, O., Brisset, S., Brochet, P.: A New Tabu Search Method for Optimization With Continuous Parameters. IEEE Transactions on Magnetics\u00a040(2), 1184\u20131187 (2004)","journal-title":"IEEE Transactions on Magnetics"},{"key":"38_CR15","doi-asserted-by":"crossref","unstructured":"Liu, S.Q., Ong, H.L., Ng, K.M.: A fast tabu search algorithm for the group shop scheduling problem. Advances in Engineering Software, 1\u20135 (2005)","DOI":"10.1016\/j.advengsoft.2005.02.002"},{"key":"38_CR16","doi-asserted-by":"crossref","unstructured":"Michel, L., Hentenryck, P.V.: A simple tabu search for warehouse location. European Journal of Operational Research, 576\u2013591 (2004)","DOI":"10.1016\/S0377-2217(03)00247-9"},{"key":"38_CR17","doi-asserted-by":"crossref","unstructured":"Rolland, E., Schilling, D.A., Current, J.R.: An efficient tabu search procedure for the p-Median Problem. European Journal of Operational Research, 329\u2013342 (1996)","DOI":"10.1016\/S0377-2217(96)00141-5"},{"key":"38_CR18","unstructured":"Munkres, J.R.: Topology, pp. 164\u2013170 (2000)"},{"key":"38_CR19","doi-asserted-by":"crossref","unstructured":"Franze, F., Speciale, N.: A tabu-search-based algorithm for continuous multiminima problems. International Journal For Numerical Methods in Engineering, 665\u2013680 (2001)","DOI":"10.1002\/1097-0207(20010130)50:3<665::AID-NME43>3.0.CO;2-U"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Data Mining in Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03070-3_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T13:55:28Z","timestamp":1558446928000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03070-3_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642030697","9783642030703"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03070-3_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}