{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:21:46Z","timestamp":1725531706673},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642010842"},{"type":"electronic","value":"9783642010859"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-01085-9_6","type":"book-chapter","created":{"date-parts":[[2009,5,4]],"date-time":"2009-05-04T16:55:34Z","timestamp":1241456134000},"page":"129-151","source":"Crossref","is-referenced-by-count":6,"title":["Tabu Search to Solve Real-Life Combinatorial Optimization Problems: A Case of Study"],"prefix":"10.1007","author":[{"given":"Djamal","family":"Habet","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"6_CR1","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s10288-004-0044-8","volume":"2","author":"T. Benoist","year":"2004","unstructured":"Benoist, T., Rottembourg, B.: Upper Bounds of the Maximal Revenue of an Earth Observation Satellite. 4OR: A Quarterly Journal of Operations Research\u00a02(3), 235\u2013249 (2004)","journal-title":"4OR: A Quarterly Journal of Operations Research"},{"key":"6_CR2","unstructured":"Bensana, E., Verfaillie, G., Agn\u00e8se, J.G., Bataille, N., Blumstein, D.: Exact and Approximate Methods for the Daily Management of an Earth Observation Satellite. In: Proceeding of the 4th International Symposium od Space Mission Operations and Ground Data Systems (spaceOps 1996) (1996)"},{"issue":"3","key":"6_CR3","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1023\/A:1026488509554","volume":"4","author":"E. Bensana","year":"1999","unstructured":"Bensana, E., Lema\u00eetre, M., Verfaillie, G.: Earth Observation Satellite Management. Constraints: An International Jounal\u00a04(3), 293\u2013299 (1999)","journal-title":"Constraints: An International Jounal"},{"key":"6_CR4","doi-asserted-by":"crossref","first-page":"928","DOI":"10.1057\/palgrave.jors.2601163","volume":"59","author":"J.F. Cordeau","year":"2001","unstructured":"Cordeau, J.F., Laporte, G., Mercier, A.: A Unified Tabu Search Heuristic for Vehicle Routing Problems with Time Windows. Journal of Operational Research Society\u00a059, 928\u2013936 (2001)","journal-title":"Journal of Operational Research Society"},{"key":"6_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":"6_CR6","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/BF02125407","volume":"63","author":"C. Fleurent","year":"1996","unstructured":"Fleurent, C., Ferland, J.A.: Genetic and Hybrid Algorithms for Graph Coloring. Annals of Operations Research\u00a063, 437\u2013461 (1996)","journal-title":"Annals of Operations Research"},{"key":"6_CR7","unstructured":"Gabrel, V.: Improved Linear Programming Bounds via Column Generation for Daily Scheduling of Earth Observation Satellite. Technical report, LIPN (1999)"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1023\/A:1018920709696","volume":"69","author":"V. Gabrel","year":"1997","unstructured":"Gabrel, V., Moulet, A., Murat, C., Paschos, V.T.: A New model and derived algorithms for the satellite shot planning problem using graph theory concepts. Annals of Operations Research\u00a069, 115\u2013134 (1997)","journal-title":"Annals of Operations Research"},{"key":"6_CR9","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/0-306-48056-5_2","volume":"57","author":"M. Gendreau","year":"2003","unstructured":"Gendreau, M.: An Introduction to Tabu Search. Handbook of Metaheuristics\u00a057, 37\u201354 (2003)","journal-title":"Handbook of Metaheuristics"},{"issue":"4","key":"6_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., Taillard, E.: Parallel tabu search for real-time vehicle routing and dispatching. Transportation Science\u00a033(4), 381\u2013390 (1999)","journal-title":"Transportation Science"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Gendreau, M., Laporte, G., Potvin, J.Y.: Metaheuristics for the capacitated vrp. pp. 129\u2013154 (2001)","DOI":"10.1137\/1.9780898718515.ch6"},{"issue":"1-4","key":"6_CR12","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/BF02023002","volume":"41","author":"M. Gendreau","year":"1993","unstructured":"Gendreau, M., Soriano, P., Salvail, L.: Solving the maximum clique problem using a tabu search approach. Annals of Operations Research\u00a041(1-4), 385\u2013403 (1993)","journal-title":"Annals of Operations Research"},{"key":"6_CR13","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"Glover, F.: Tabu Search \u2013 Part I. ORSA Journal on Computing\u00a01, 190\u2013206 (1989)","journal-title":"ORSA Journal on Computing"},{"key":"6_CR14","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F. Glover","year":"1990","unstructured":"Glover, F.: Tabu Search \u2013 Part II. ORSA Journal on Computing\u00a02, 4\u201332 (1990)","journal-title":"ORSA Journal on Computing"},{"key":"6_CR15","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/978-1-4613-1361-8_25","volume-title":"Meta-Heurisitics: Theory and Applications","author":"F. Glover","year":"1996","unstructured":"Glover, F., Kochenberger, G.A.: Critical Event Tabu Search for Multidimensional Knapsack Problems. In: Osman, I.H., Kelly, J.P. (eds.) Meta-Heurisitics: Theory and Applications, pp. 407\u2013428. Kluwer Academic Publishers, Dordrecht (1996)"},{"key":"6_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Dordrecht (1997)"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Hall, N.G., Magazine, M.J.: Maximizing the Value of a Space Mission. European Journal of Operational Research\u00a0(78), 224\u2013241 (1994)","DOI":"10.1016\/0377-2217(94)90385-9"},{"issue":"2\u20133","key":"6_CR18","first-page":"663","volume":"106","author":"S. Hanafi","year":"1998","unstructured":"Hanafi, S., Freville, A.: An Efficient Tabu Search Approach for the 0-1 Multidimensional Knapsack Problem. European Journal of Operational Research, Special Tabu Search Issue\u00a0106(2\u20133), 663\u2013697 (1998)","journal-title":"European Journal of Operational Research, Special Tabu Search Issue"},{"key":"6_CR19","unstructured":"Harrison, S.A., Price, M.E.: Task Scheduling for Satellite Based Imagery. In: Proceedings of the 18th Workshop of UK Planning and Scheduling Special Interest Group, pp. 64\u201378 (1999)"},{"issue":"3","key":"6_CR20","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0166-218X(92)90248-9","volume":"35","author":"A. Hertz","year":"1992","unstructured":"Hertz, A.: Finding a feasible course schedule using tabu search. Discrete Appl. Math.\u00a035(3), 255\u2013270 (1992)","journal-title":"Discrete Appl. Math."},{"key":"6_CR21","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01531073","volume":"1","author":"A. Hertz","year":"1991","unstructured":"Hertz, A., de Werra, D.: The Tabu Search Metaheuristic: How We Used It. Annals of Mathematics and Artificial Intelligence\u00a01, 111\u2013121 (1991)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"10","key":"6_CR22","doi-asserted-by":"publisher","first-page":"3347","DOI":"10.1016\/j.cor.2007.03.002","volume":"35","author":"A.R. McKendall Jr.","year":"2008","unstructured":"McKendall Jr., A.R.: Improved Tabu search heuristics for the dynamic space allocation problem. Comput. Oper. Res.\u00a035(10), 3347\u20133359 (2008)","journal-title":"Comput. Oper. Res."},{"key":"6_CR23","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/BF01471219","volume":"2","author":"M. Laguna","year":"1991","unstructured":"Laguna, M., Barnes, J.W., Glover, F.: Tabu search methodology for a single machine scheduling problem. Journal of Intelligent Manufacturing\u00a02, 63\u201374 (1991)","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"5","key":"6_CR24","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/S1270-9638(02)01173-2","volume":"6","author":"M. Lema\u00eetre","year":"2002","unstructured":"Lema\u00eetre, M., Verfaillie, G., Jouhaud, F., Lachiver, J.M., Bataille, N.: Selecting and Scheduling Observations of Agile Satellites. Aerospace Science and Technology\u00a06(5), 367\u2013381 (2002)","journal-title":"Aerospace Science and Technology"},{"issue":"12","key":"6_CR25","doi-asserted-by":"publisher","first-page":"2680","DOI":"10.1016\/j.ins.2008.01.022","volume":"178","author":"Y. Liu","year":"2008","unstructured":"Liu, Y., Yi, Z., Wu, H., Ye, M., Chen, K.: A tabu search approach for the minimum sum-of-squares clustering problem. Inf. Sci.\u00a0178(12), 2680\u20132704 (2008)","journal-title":"Inf. Sci."},{"key":"6_CR26","unstructured":"ROADEF 2003 Challenge. Booklet of Abstracts. ROADEF society, France (February 2003)"},{"key":"6_CR27","unstructured":"Schiex, T., Fargier, F., Verfaillie, G.: Valued Constrained Satisfaction Problems: Hard and Easy problems. In: Proceedings of IJCAI 1995, 14th International Joint Conference on Artificial Intelligence, pp. 631\u2013639 (1995)"},{"issue":"2","key":"6_CR28","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1023\/A:1011203002719","volume":"20","author":"M. Vasquez","year":"2001","unstructured":"Vasquez, M., Hao, J.K.: A Logic-Constrained Knapsack Formulation and a Tabu Algorithm for the Daily Photograph Scheduling of an Earth Observation Satellite. Journal of Computational Optimization and Applications\u00a020(2), 137\u2013157 (2001)","journal-title":"Journal of Computational Optimization and Applications"},{"key":"6_CR29","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1023\/A:1021950608048","volume":"7","author":"M. Vasquez","year":"2003","unstructured":"Vasquez, M., Hao, J.K.: Upper Bounds for the SPOT5 Daily Photograph Scheduling Problem. Journal of Combinatorial Optimization\u00a07, 87\u2013103 (2003)","journal-title":"Journal of Combinatorial Optimization"},{"issue":"1","key":"6_CR30","first-page":"146","volume":"46","author":"W.J. Wolf","year":"2000","unstructured":"Wolf, W.J., Sorensen, S.E.: Three Scheduling Algorithms Applied to the Earth Observing Systems Domain. Management Science\u00a046(1), 146\u2013168 (2000)","journal-title":"Management Science"}],"container-title":["Studies in Computational Intelligence","Foundations of Computational Intelligence Volume 3"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01085-9_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T09:56:39Z","timestamp":1619776599000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01085-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642010842","9783642010859"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01085-9_6","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2009]]}}}