{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T00:40:24Z","timestamp":1737333624110,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540742012"},{"type":"electronic","value":"9783540742050"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-74205-0_62","type":"book-chapter","created":{"date-parts":[[2007,7,30]],"date-time":"2007-07-30T04:32:41Z","timestamp":1185769961000},"page":"572-583","source":"Crossref","is-referenced-by-count":1,"title":["An Improved Nested Partitions Algorithm Based on Simulated Annealing in Complex Decision Problem Optimization"],"prefix":"10.1007","author":[{"given":"Yan","family":"Luo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changrui","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"62_CR1","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1287\/opre.48.3.390.12436","volume":"4008","author":"L. Shi","year":"2000","unstructured":"Shi, L., \u00d3lafsson, S.: Nested Partitions Method for Global Optimization. Operations Research\u00a04008, 390\u2013407 (2000)","journal-title":"Operations Research"},{"key":"62_CR2","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/S0305-0548(98)00068-9","volume":"26","author":"L. Shi","year":"1999","unstructured":"Shi, L., \u00d3lafsson, S., Sun, N.: New Parallel Randomized Algorithms for the Traveling Salesman Problem. Computers & Operations Research\u00a026, 371\u2013394 (1999)","journal-title":"Computers & Operations Research"},{"key":"62_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/07408170304431","volume":"35","author":"L. Shi","year":"2003","unstructured":"Shi, L., Men, S.: Optimal Buffer Allocation in Production Lines. IIE Transactions\u00a035, 1\u201310 (2003)","journal-title":"IIE Transactions"},{"key":"62_CR4","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/S0360-8352(99)00140-0","volume":"36","author":"L. Shi","year":"1999","unstructured":"Shi, L., \u00d3lafsson, S., Chen, Q.: A New Hybrid Optimization Algorithm. Computers & Industrial Engineering\u00a036, 409\u2013426 (1999)","journal-title":"Computers & Industrial Engineering"},{"key":"62_CR5","doi-asserted-by":"publisher","first-page":"1681","DOI":"10.1287\/mnsc.47.12.1681.10243","volume":"47","author":"L. Shi","year":"2001","unstructured":"Shi, L., \u00d3lafsson, S., Chen, Q.: An Optimization Framework for Product Design. Management Science\u00a047, 1681\u20131692 (2001)","journal-title":"Management Science"},{"key":"62_CR6","first-page":"135","volume":"32","author":"S. \u00d3lafsson","year":"1998","unstructured":"\u00d3lafsson, S., Shi, L.: A Method for Scheduling in Parallel Manufacturing Systems with Flexible Resources. IIE Transactions\u00a032, 135\u2013146 (1998)","journal-title":"IIE Transactions"},{"key":"62_CR7","doi-asserted-by":"crossref","unstructured":"\u00d3lafsson, S., Gopinath, N.: Optimal Selection Probability in the Two-stage Nested Partition Method for Simulation-based Optimization. In: Proceedings of the 2000 Winter Simulation Conference pp. 736\u2013742 (2000)","DOI":"10.1109\/WSC.2000.899787"},{"key":"62_CR8","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt Jr., C., Vecchi, M.: Optimization by Simulated Annealing. Science\u00a0220, 671\u2013680 (1983)","journal-title":"Science"},{"key":"62_CR9","doi-asserted-by":"crossref","unstructured":"Barretto, R.P., Chwif, L., Eldabi, T., et al.: Simulation Optimization with the Linear Move and Exchange Move Optimization Algorithm. In: Proceedings of the 1999 Winter Simulation Conference, pp. 806\u2013811 (1999)","DOI":"10.1145\/324138.324505"},{"key":"62_CR10","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/S0305-0548(00)00073-3","volume":"29","author":"M.A. Ahmed","year":"2002","unstructured":"Ahmed, M.A., Alkhamis, T.M.: Simulation-based Optimization Using Simulated Annealing with Ranking and Selection. Computers & Operations Research\u00a029, 387\u2013402 (2002)","journal-title":"Computers & Operations Research"},{"key":"62_CR11","unstructured":"Battiti, R., Brunato, M., Pasupuleti, S.: Do Not Be Afraid of Local Minima: Affine Shaker and Practicle Swarm. Technical Report # DIT-05-049, Department of Computer Science and Telecommunications, University of Trento, Italy (2005)"}],"container-title":["Lecture Notes in Computer Science","Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74205-0_62.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T00:23:32Z","timestamp":1737332612000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74205-0_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540742012","9783540742050"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74205-0_62","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}