{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T22:25:26Z","timestamp":1772835926838,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1998,12,1]],"date-time":"1998-12-01T00:00:00Z","timestamp":912470400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,12,1]],"date-time":"1998-12-01T00:00:00Z","timestamp":912470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Heuristics"],"published-print":{"date-parts":[[1998,12]]},"DOI":"10.1023\/a:1009618009594","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T22:47:08Z","timestamp":1040597228000},"page":"383-398","source":"Crossref","is-referenced-by-count":14,"title":["Solving a Real World Assignment Problem with a Metaheuristic"],"prefix":"10.1007","volume":"4","author":[{"given":"C.","family":"Privault","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Herault","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"188274_CR1","unstructured":"Aarts, E. and Lenstra, J.K. (1997). Local search in combinatorial optimization. John Wiley & Sons Publishers."},{"key":"188274_CR2","doi-asserted-by":"crossref","unstructured":"Aarts, E.H.L. and Van Laarhoven, P.J.M. (1987). Simulated Annealing: Theory and Applications. Kluwer Academic Publishers.","DOI":"10.1007\/978-94-015-7744-1"},{"issue":"1","key":"188274_CR3","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1287\/ijoc.6.1.82","volume":"6","author":"R. Aboudi","year":"1994","unstructured":"Aboudi, R. and J\u00f6rnsten, K. (1994). Tabu search for general zero-one integer programs using the Pivot and Complement heuristic. ORSA Journal on Computing, 6(1):82-93.","journal-title":"ORSA Journal on Computing"},{"key":"188274_CR4","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1287\/mnsc.26.1.86","volume":"26","author":"E. Balas","year":"1980","unstructured":"Balas, E. and Martin, C.H. (1980). Pivot and Complement-A heuristic for zero-one programming. Management Science, 26:89-96.","journal-title":"Management Science"},{"key":"188274_CR5","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF00940812","volume":"45","author":"V. Cerny","year":"1985","unstructured":"Cerny, V. (1985). A thermodynamical approach to the travellong salesman problem: an efficient simulated annealing. Journal of Optim. Theory Appl., 45:41\u201351.","journal-title":"Journal of Optim. Theory Appl."},{"issue":"19","key":"188274_CR6","doi-asserted-by":"crossref","first-page":"1411","DOI":"10.1103\/PhysRevLett.50.1411","volume":"50","author":"M. Creutz","year":"1983","unstructured":"Creutz, M. (1983). Microcanonical Monte Carlo simulation. Physic Rev. Lett. 50(19):1411-1414.","journal-title":"Physic Rev. Lett."},{"issue":"1","key":"188274_CR7","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","volume":"8","author":"F. Glover","year":"1977","unstructured":"Glover, F. (1977). Heuristics in Integer Programming using surrogate constraints. Decision Sciences, 8(1):156-166.","journal-title":"Decision Sciences"},{"issue":"4","key":"188274_CR8","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1287\/inte.20.4.74","volume":"20","author":"F. Glover","year":"1990","unstructured":"Glover, F. (1990). Tabu search: a tutorial. Interfaces, 20(4):74-94.","journal-title":"Interfaces"},{"key":"188274_CR9","unstructured":"Glover, F. and Laguna, M.. (1995). Tabu search. In C. Reeves (ed.), Modern heuristics for combinatorial problems. Blackwell Scientific Publishing (pp 70-151)."},{"key":"188274_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu search","author":"F. Glover","year":"1997","unstructured":"Glover, F. and Laguna, M. (1997). Tabu search. Kluwer Academic Publishing, Norwell, MA."},{"issue":"9","key":"188274_CR11","doi-asserted-by":"crossref","first-page":"899","DOI":"10.1109\/34.232076","volume":"15","author":"L. H\u00e9rault","year":"1993","unstructured":"H\u00e9rault, L. and Horaud, R. (1993). Figure-Ground Discrimination: A combinatorial optimization approach. IEEE Transactions on Pattern Analysis and Machine Intelligence, 15(9):899-914.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"188274_CR12","doi-asserted-by":"crossref","unstructured":"H\u00e9rault, L. (1998). Rescaled simulated annealing. In Proceedings of the 1998 IEEE International Conference on Neural Networks, Anchorage, Alaska, May 1998.","DOI":"10.1109\/IJCNN.1998.685951"},{"key":"188274_CR13","unstructured":"H\u00e9rault, L. (1998). Rescaled Simulated Annealing-Accelerating convergence of Simulated Annealing by rescaling the states energies. Submitted to Journal of Heuristics. Kluwer Academic Publishers."},{"key":"188274_CR14","unstructured":"Kirkpatrick, S., Gelatt, C.D. and Vecchi, M.P. (1982). Optimization by simulated annealing. IBM research report RC9355."},{"key":"188274_CR15","doi-asserted-by":"crossref","first-page":"9","DOI":"10.13182\/NT95-1-9","volume":"95","author":"D.J. Kropaczek","year":"1991","unstructured":"Kropaczek, D.J. and Turinsky, P.J. (1991). In-core nuclear fuel management optimization for pressurized water reactors utilizing simulated annealing Nuclear Technology, 95:9-32.","journal-title":"Nuclear Technology"},{"issue":"1","key":"188274_CR16","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1080\/07408179308964266","volume":"25","author":"R. Kuik","year":"1993","unstructured":"Kuik, R., Salomon, M., Wassenhove, L.N. and Maes, J. (1993). Linear programming, Simulated annealing and tabu search heuristics for lotsizing bottleneck assembly systems. IIE Transactions, 25(1):62-72.","journal-title":"IIE Transactions"},{"key":"188274_CR17","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/0377-2217(93)E0174-V","volume":"82","author":"M. Laguna","year":"1995","unstructured":"Laguna, M., Kelly, J.P., Gonz\u00e1les-Velarde, J.L. and Glover, F. (1995). Tabu search for the multivel generalized assignment problem. European Journal of Operational Research, 82:176-189.","journal-title":"European Journal of Operational Research"},{"key":"188274_CR18","doi-asserted-by":"crossref","unstructured":"Liegeois, B., Pirlot, M., Teghem, J., Trauwaert, E. and Tuyttens, D. (1992). Balanced grouping through simulated annealing. In R. Vidal (ed.), Lecture notes in economics and mathematical systems(pp 275-290). Springer Verlag.","DOI":"10.1007\/978-3-642-46787-5_14"},{"issue":"3","key":"188274_CR19","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1111\/1475-3995.d01-42","volume":"1","author":"A. L\u00f8kketangen","year":"1994","unstructured":"L\u00f8kketangen, A., J\u00f6rnsten, K. and Storoy, S. (1994). Tabu search within a Pivot and Complement framework. International Transactions in Operations Research, 1(3):305-316.","journal-title":"International Transactions in Operations Research"},{"key":"188274_CR20","unstructured":"L\u00f8kketangen, A. and Glover, F. (1996). Solving zero-one mixed integer programming problems using tabu search. European Journal of Operational Research-Special Issue on Tabu Search. To appear."},{"issue":"1","key":"188274_CR21","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0306-4549(94)00031-9","volume":"22","author":"Y.P. Mahlers","year":"1995","unstructured":"Mahlers, Y.P. (1995). Core loading pattern optimization based on simulated annealing and successive linear programming. Annals of Nuclear Energy, 22(1):223-227.","journal-title":"Annals of Nuclear Energy"},{"key":"188274_CR22","volume-title":"Knapsack problems: Algorithms and Computer Implementations","author":"S. Martello","year":"1990","unstructured":"Martello, S. and Toth, P. (1990). Knapsack problems: Algorithms and Computer Implementations. Wiley, New York."},{"key":"188274_CR23","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N. Metropolis","year":"1953","unstructured":"Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A. and Teller, E. (1953). Equation of state calculations by fast computing machines. Journal of Chem. Physics, 21:1087-1092.","journal-title":"Journal of Chem. Physics"},{"key":"188274_CR24","unstructured":"Niquil, Y. and Voskanian, A. (1995). POMAR: un prototype d'optimisation de la gestion du stock de plutonium. Internal report EDF Clamart, HI23\/95004."},{"key":"188274_CR25","unstructured":"Osman, I.H. (1991). Metastrategy simulated annealing and tabu search for combinatorial optimization. The management school, Imperial College of London."},{"issue":"1-2","key":"188274_CR26","first-page":"7","volume":"32","author":"M. Pirlot","year":"1992","unstructured":"Pirlot, M. (1992). General local search heuristics in combinatorial optimization: a tutorial. JORBEL Belgian Journal of Operations Research, 32(1-2):7-67.","journal-title":"JORBEL Belgian Journal of Operations Research"},{"key":"188274_CR27","doi-asserted-by":"crossref","unstructured":"Privault, C. and H\u00e9rault, L. (1998). Constraints satisfaction through recursive neural networks with mixed penalties. Neural Processing Letters. To appear.","DOI":"10.1023\/A:1009660928212"},{"key":"188274_CR28","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1007\/BF02085659","volume":"50","author":"D. Tuyttens","year":"1994","unstructured":"Tuyttens, D., Pirlot, M., Teghem, J., Trauwaert, E. and Liegeois, B. (1994). Homogeneous grouping of nuclear fuel cans through simulated annealing and tabu search. Annals of Operations Research, 50:575- 607.","journal-title":"Annals of Operations Research"},{"key":"188274_CR29","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/0305-0548(90)90016-Z","volume":"50","author":"A. Vernekar","year":"1990","unstructured":"Vernekar, A. and Anandalingam, G. and Dorny, C.N. (1990). Optimization of resource location in hierarchical computer networks. Computers and Operations Research, 50:375-388.","journal-title":"Computers and Operations Research"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009618009594.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009618009594\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009618009594.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T11:06:50Z","timestamp":1747652810000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009618009594"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,12]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1998,12]]}},"alternative-id":["188274"],"URL":"https:\/\/doi.org\/10.1023\/a:1009618009594","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,12]]}}}