{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:48:23Z","timestamp":1725486503903},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540290063"},{"type":"electronic","value":"9783540324942"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-32494-1_12","type":"book-chapter","created":{"date-parts":[[2007,6,18]],"date-time":"2007-06-18T22:56:07Z","timestamp":1182207367000},"page":"281-292","source":"Crossref","is-referenced-by-count":24,"title":["Estimation of Distribution Algorithm with 2-opt Local Search for the Quadratic Assignment Problem"],"prefix":"10.1007","author":[{"given":"Qingfu","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianyong","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edward","family":"Tsang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Ford","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"53","DOI":"10.2307\/1907742","volume":"25","author":"T.C. Koopmans","year":"1957","unstructured":"T.C. Koopmans and M.J. Beckmann, \u201cAssignment Problems and the Location of Economic Activities,\u201d Econometrica, vol. 25, pp. 53\u201376, 1957.","journal-title":"Econometrica"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"E. \u00c7ela, \u201cThe Quadratic Assignment Problem: Theory and Algorithms\u201d, Kluwer Academic Publishers, 1998.","DOI":"10.1007\/978-1-4757-2787-6"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Larranaga, P. and Lozano, J.A., \u201cEstimation of Distribution Algorithms: A New Tool for Evolutionary Computation,\u201d Kluwer Academic Publishers, 2001.","DOI":"10.1007\/978-1-4615-1539-5"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0377-2217(90)90301-Q","volume":"46","author":"D.T. Connolly","year":"1990","unstructured":"D.T. Connolly, \u201cAn Improved Annealing Scheme for the Quadratic Assignment Problem,\u201d European Journal of Operational Research, vol. 46, pp. 93\u2013100, 1990.","journal-title":"European Journal of Operational Research"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/BF01719267","volume":"17","author":"V. Nissen","year":"1995","unstructured":"V. Nissen and H. Paul, \u201cA Modification of Threshold Accepting and its Application to the Quadratic Assignment Problem,\u201d OR Spektrum, vol. 17, pp. 205\u2013210, 1995.","journal-title":"OR Spektrum"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.1016\/S0893-6080(98)00077-X","volume":"11","author":"S. Ishii","year":"1998","unstructured":"S. Ishii and M. Sato, \u201cConstrained Neural Approaches to Quadratic Assignment Problems,\u201d Neural Networks, vol. 11, pp. 1073\u20131082, 1998.","journal-title":"Neural Networks"},{"key":"12_CR7","unstructured":"V. Bachelet, P. Preux, and E.-G. Talbi, \u201cParallel Hybrid Meta-Heuristics: Application to the Qudratic Assignment Problem,\u201d in Proceedings of the Parallel Optimization Colloquium, (Versailles, France), 1996."},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1023\/A:1021857607524","volume":"118","author":"P. Mills","year":"2003","unstructured":"P. Mills, E.P.K. Tsang and J.A. Ford, \u201cApplying an Extended Guided Local Search on the Quadratic Assignment Problem,\u201d Annals of Operations Research, Kluwer Academic Publishers, vol. 118, pp. 121\u2013135, 2003.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"12_CR9","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1109\/72.265961","volume":"5","author":"V. Nissen","year":"1994","unstructured":"V. Nissen, \u201cSolving the Quadratic Assignment Problem with Clues from Nature,\u201d IEEE Transactions on Neural Networks, vol. 5, no. 1, pp. 66\u201372, 1994.","journal-title":"IEEE Transactions on Neural Networks"},{"issue":"1","key":"12_CR10","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0305-0548(93)E0020-T","volume":"22","author":"D.M. Tate","year":"1995","unstructured":"D.M. Tate and A.E. Smith, \u201cA Genetic Approach to the Quadratic Assignment Problem,\u201d Computers and Operations Research, vol. 22, no. 1, pp.73\u201383, 1995.","journal-title":"Computers and Operations Research"},{"key":"12_CR11","unstructured":"L. Gambardella, \u00c9. Taillard and M. Dorigo, \u201cAnt Colonies for the QAP,\u201d Journal of the Operations Research Society, 1999."},{"issue":"4","key":"12_CR12","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/4235.887234","volume":"4","author":"P. Merz","year":"2000","unstructured":"P. Merz and B. Freisleben, \u201cFitness Landscape Analysis and Memetic Algorithms for the Quadratic Assignment Problem,\u201d IEEE Transactions on Evolutionary Computation, vol. 4, no. 4, pp. 337\u2013352, 2000.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1109\/ICEC.1997.592289","volume-title":"Proceedings of the 1997 IEEE International Conference on Evolutionary Computation (ICEC)","author":"V.-D. Cung","year":"1997","unstructured":"V.-D. Cung, T. Mautor, P. Michelon and A. Tavares, \u201cA Scatter Search Based Approach for the Quadratic Assignment Problem,\u201d in Proceedings of the 1997 IEEE International Conference on Evolutionary Computation (ICEC), (T. B\u00e4ck, Z. Michalewicz, and X. Yao, eds.), (Indianapolis, USA), pp. 165\u2013170, IEEE Press, 1997."},{"key":"12_CR14","unstructured":"S. Baluja, \u201cPopulation-based Incremental Learning: A Method for Integrating Genetic Search Based Function Optimization And Competitive Learning,\u201d Technical Report, Carnegie Mellon University, 1994."},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0377-2217(91)90197-4","volume":"55","author":"R.E. Burkard","year":"1991","unstructured":"R.E. Burkard, S. Karisch and F. Rendl, \u201cQAPLIB-A Quadratic Assignment Problem Library,\u201d European Journal of Operational Research, vol. 55, pp. 115\u2013119, 1991. Updated Version: http:\/\/www.imm.dtu.dk\/sk\/qaplib.","journal-title":"European Journal of Operational Research"},{"key":"12_CR16","unstructured":"E.S. Buffa, G.C. Armour and T.E. Vollmann, \u201cAllocating Facilities with CRAFT,\u201d Harvard Business Review, pp. 136\u2013158, March 1964."},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"F. Glover and M. Laguna, Tabu Search, Kluwer, 1997.","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1016\/S0377-2217(97)00063-5","volume":"108","author":"P.M. Hahn","year":"1998","unstructured":"P.M. Hahn, T. Grant and N. Hall, \u201cA Branch-and-Bound Algorithm for the Quadratic Assignment Problem based on the Hungarian Method,\u201d European Journal of Operational Research, vol. 108, pp. 629\u2013640, 1998.","journal-title":"European Journal of Operational Research"},{"key":"12_CR19","unstructured":"Q. Zhang, J. Sun, E.P.K. Tsang and J.A. Ford, \u201cCombination of Guided Local Search and Estimation of Distribution Algorithm for Solving Quadratic Assignment Problem,\u201d Proceedings of the Bird of a Feather Workshops, Genetic and Evolutionary Computation Conference, pp. 42\u201348, 2004."},{"issue":"2","key":"12_CR20","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1109\/TEVC.2004.840835","volume":"9","author":"Q. Zhang","year":"2005","unstructured":"Q. Zhang, J. Sun, and E. Tsang, \u201cAn evolutionary algorithm with guided mutation for the maximum clique problem. IEEE Trans. Evolutionary Computation\u201d, vol. 9, no. 2. pp. 192\u2013200, 2005.","journal-title":"IEEE Trans. Evolutionary Computation"}],"container-title":["Studies in Fuzziness and Soft Computing","Towards a New Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-32494-1_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:55:49Z","timestamp":1619571349000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-32494-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540290063","9783540324942"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-32494-1_12","relation":{},"ISSN":["1434-9922"],"issn-type":[{"type":"print","value":"1434-9922"}],"subject":[]}}