{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T12:33:46Z","timestamp":1769171626743,"version":"3.49.0"},"publisher-location":"New York","reference-count":31,"publisher":"Springer-Verlag","isbn-type":[{"value":"0387253823","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/0-387-25383-1_18","type":"book-chapter","created":{"date-parts":[[2005,8,10]],"date-time":"2005-08-10T16:37:44Z","timestamp":1123691864000},"page":"389-414","source":"Crossref","is-referenced-by-count":5,"title":["Constraint Oriented Neighbourhoods \u2014 A New Search Strategy in Metaheuristics"],"prefix":"10.1007","author":[{"given":"Ana","family":"Viana","sequence":"first","affiliation":[]},{"given":"Jorge P.","family":"Sousa","sequence":"additional","affiliation":[]},{"given":"Manuel A.","family":"Matos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF02430363","volume":"1","author":"R.S. Barr","year":"1995","unstructured":"Barr, R.S., Golden, B.L., Kelly, J., Stewart, W.R., and Resende, M.G.C. (1995). Designing and reporting on computational experiments with heuristic methods. Journal of Heuristics, 1:9\u201332.","journal-title":"Journal of Heuristics"},{"key":"18_CR2","unstructured":"Battiti, R. (1996). Reactive search: Toward self-tuning heuristics. In Rayward-Smith, V.J., editor, Modern Heuristic Search Methods, pages 61\u201383. John Wiley & Sons."},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Burke, E., Hart, E., Kendall, G., Newall, J., Ross, P., and Schulenburg, S. (2003). Hyper-heuristics: an emerging direction in modern search technology. In Glover, F. and Kochenberger, G., editors, Handbook of Metaheuristics. Kluwer Academic Publishers.","DOI":"10.1007\/0-306-48056-5_16"},{"issue":"2","key":"18_CR4","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/S0377-2217(02)00069-3","volume":"140","author":"E.K. Burke","year":"2002","unstructured":"Burke, E.K. and Petrovic, S. (2002). Recent research directions in automated timetabling. European Journal of Operational Research, 140(2):266\u2013280.","journal-title":"European Journal of Operational Research"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/S0377-2217(97)00279-8","volume":"106","author":"E. Costamagna","year":"1998","unstructured":"Costamagna, E., Fanni, A., and Giacinto, G. (1998). A Tabu Search algorithm for the optimisation of telecommunication networks. European Journal of Operational Research, 106:357\u2013372.","journal-title":"European Journal of Operational Research"},{"key":"18_CR6","unstructured":"Cung, V-D., Martins, S., Ribeiro, C., and Roucairol, C. (2001). Strategies for the parallel implementation of metaheuristics. In Ribeiro, C.C. and Hansen, P., editors, Essays and Surveys on Metaheuristics, pages 263\u2013308. Kluwer Academic Publishers."},{"key":"18_CR7","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1002\/(SICI)1099-1360(199801)7:1<34::AID-MCDA161>3.0.CO;2-6","volume":"7","author":"P. Czyzac","year":"1998","unstructured":"Czyzac, P. and Jaszkiewicz, A. (1998). Pareto Simulated Annealing \u2014 a metaheuristic technique for multiple objective combinatorial optimization. Journal of Multi-Criteria Decision Analysis, 7:34\u201337.","journal-title":"Journal of Multi-Criteria Decision Analysis"},{"key":"18_CR8","unstructured":"Dorigo, M. and di Caro, G. (1999). The ant colony optimization metaheuristic. In Corne, D., Dorigo, M., and Glover, F., editors, New Ideas in Optimization. McGraw-Hill."},{"issue":"1","key":"18_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0377-2217(03)00095-X","volume":"153","author":"A.T. Ernst","year":"2004","unstructured":"Ernst, A.T., Jiang, H., Krishnamoorthy, M., and Sier, D. (2004). Staff scheduling and rostering: A review of applications, methods and models. European Journal of Operational Research, 153(1):3\u201327.","journal-title":"European Journal of Operational Research"},{"key":"18_CR10","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T.A. Feo","year":"1995","unstructured":"Feo, T.A. and Resende, M.G.C. (1995). Greedy randomized adaptive search procedures. Journal of Global Optimization, 6:109\u2013133.","journal-title":"Journal of Global Optimization"},{"key":"18_CR11","doi-asserted-by":"crossref","first-page":"1276","DOI":"10.1287\/mnsc.40.10.1276","volume":"40","author":"M. Gendreau","year":"1994","unstructured":"Gendreau, M., Hertz, A., and Laporte, G. (1994). A Tabu Search heuristic for the vehicle routing problem. Management Science, 40:1276\u20131290.","journal-title":"Management Science"},{"key":"18_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/b101874","volume-title":"Handbook of Metaheuristics","author":"F. Glover","year":"2003","unstructured":"Glover, F. and Kochenberger, G. (2003). Handbook of Metaheuristics. Kluwer Academic Publishers, Boston."},{"issue":"3","key":"18_CR13","first-page":"653","volume":"39","author":"F. Glover","year":"2000","unstructured":"Glover, F., Laguna, M., and Mart\u00ed, R. (2000). Fundamentals of scatter search and path relinking. Control and Cybernetics, 39(3):653\u2013684.","journal-title":"Control and Cybernetics"},{"key":"18_CR14","unstructured":"Hansen, M.P. (1997). Tabu search for multiobjective optimization: MOTS. Presented at \u201cThe 13th International Conference on Multiple Criteria Decision Making\u201d, University of Cape Town, pages 574\u2013586."},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"P. Hansen","year":"1997","unstructured":"Hansen, P. and Mladenovi\u0107, N. (1997). Variable Neighborhood Search. Computers and Operations Research, 24:1097\u20131100.","journal-title":"Computers and Operations Research"},{"key":"18_CR16","unstructured":"Hansen, P. and Mladenovi\u0107, N. (2002). Variable neighbourhood search. In Pardalos, P. and Resende, M., editors, Handbook of Applied Optimization. Oxford University Press."},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Horn, J., Nafpliotis, N., and Goldberg, D.E. (1994). A Niched Pareto Genetic Algorithm for multiobjective optimization. In Proceedings of the 1st IEEE Conference on Evolutionary Computation, IEEE World Congress on Computational Intelligence, pages 82\u201387, Piscataway, New Jersey.","DOI":"10.1109\/ICEC.1994.350037"},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1016\/S0377-2217(01)00210-7","volume":"137","author":"J. Jozefowska","year":"2002","unstructured":"Jozefowska, J., Waligora, G., and Weglarz, J. (2002). Tabu list management methods for a discrete-continuous scheduling problem. European Journal of Operational Research, 137:288\u2013302.","journal-title":"European Journal of Operational Research"},{"key":"18_CR19","doi-asserted-by":"publisher","first-page":"1452","DOI":"10.1109\/59.801925","volume":"14","author":"K.A. Juste","year":"1999","unstructured":"Juste, K.A., Kita, H., Tanaka, E., and Hasegawa, J. (1999). An Evolutionary Programming solution to the unit commitment problem. IEEE Transactions on Power Systems, 14:1452\u20131459.","journal-title":"IEEE Transactions on Power Systems"},{"key":"18_CR20","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1109\/59.485989","volume":"11","author":"S.A. Kazarlis","year":"1996","unstructured":"Kazarlis, S.A., Bakirtzis, A.G., and Petridis, V. (1996). A Genetic Algorithm solution to the unit commitment problem. IEEE Transactions on Power Systems, 11:83\u201392.","journal-title":"IEEE Transactions on Power Systems"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Louren\u00e7o, H.R., Martin, O.C., and Stutzle, T. (2003). Iterated Local Search. In Glover, F. and Kochenberger, G., editors, Handbook of Metaheuristics. Kluwer Academic Publishers.","DOI":"10.1007\/0-306-48056-5_11"},{"key":"18_CR22","unstructured":"Reeves, C.R. (1995). Modern heuristics techniques for combinatorial problems. McGraw-Hill."},{"key":"18_CR23","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1287\/ijoc.14.3.228.116","volume":"14","author":"C. Ribeiro","year":"2002","unstructured":"Ribeiro, C., Uchoa, E., and Werneck, R. (2002). A hybrid GRASP with perturbations for the Steiner problem in graphs. INFORMS Journal on Computing, 14:228\u2013246.","journal-title":"INFORMS Journal on Computing"},{"key":"18_CR24","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/S0142-0615(98)00013-1","volume":"20","author":"S. Sen","year":"1998","unstructured":"Sen, S. and Kothari, D.P. (1998). Optimal thermal generating unit commitment: a review. Electrical Power and Energy Systems, 20:443\u2013451.","journal-title":"Electrical Power and Energy Systems"},{"key":"18_CR25","doi-asserted-by":"crossref","unstructured":"Senjyu, T., Yamashiro, H., Uezato, K., and Funabashi, T. (2002). A unit commitment problem by using Genetic Algorithm based on unit characteristic classification. In Proceedings of the 2002 IEEE Winter Power Meeting, New York, USA.","DOI":"10.1109\/PESW.2002.984954"},{"key":"18_CR26","unstructured":"Serafini, P. (1992). Simulated Annealing for multiobjective optimization problems. In Proceedings of the 10th International Conference on MCDM, pages 221\u2013248, Taipei."},{"key":"18_CR27","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1016\/S0305-0548(97)00101-9","volume":"25","author":"J.M. Thompson","year":"1998","unstructured":"Thompson, J.M. and Dowsland, K.A. (1998). A robust Simulated Annealing based examination timetabling system. Computers & Operations Research, 25:637\u2013648.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"18_CR28","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1023\/A:1017960507177","volume":"8","author":"J. Valenzuela","year":"2002","unstructured":"Valenzuela, J. and Smith, A.E. (2002). A seeded memetic algorithm for large unit commitment problems. Journal of Heuristics, 8(2):173\u2013195.","journal-title":"Journal of Heuristics"},{"key":"18_CR29","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/S0377-2217(99)00163-0","volume":"120","author":"A. Viana","year":"2000","unstructured":"Viana, A. and Sousa, J.P. (2000). Using metaheuristics in multiobjective resource constrained project scheduling. European Journal of Operational Research, 120:359\u2013374.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"18_CR30","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1023\/A:1023326413273","volume":"120","author":"A. Viana","year":"2003","unstructured":"Viana, A., Sousa, J.P., and Matos, M.A. (2003). Using GRASP to solve the unit commitment problem. Annals of Operations Research, 120(1):117\u2013132.","journal-title":"Annals of Operations Research"},{"key":"18_CR31","unstructured":"Wood, A.J. and Wollenberg, B.F. (1996). Power Generation Operation and Control. John Wiley & Sons."}],"container-title":["Operations Research\/Computer Science Interfaces Series","Metaheuristics: Progress as Real Problem Solvers"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/0-387-25383-1_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T01:00:59Z","timestamp":1619485259000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/0-387-25383-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["0387253823"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/0-387-25383-1_18","relation":{},"subject":[]}}