{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:14:11Z","timestamp":1774415651557,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,3,10]],"date-time":"2006-03-10T00:00:00Z","timestamp":1141948800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Math Model Algor"],"published-print":{"date-parts":[[2006,4]]},"DOI":"10.1007\/s10852-005-9034-x","type":"journal-article","created":{"date-parts":[[2006,3,9]],"date-time":"2006-03-09T09:14:49Z","timestamp":1141895689000},"page":"111-137","source":"Crossref","is-referenced-by-count":57,"title":["Hybrid Population-Based Algorithms for the Bi-Objective Quadratic Assignment Problem"],"prefix":"10.1007","volume":"5","author":[{"given":"Manuel","family":"L\u00f3pez-Ib\u00e1\u00f1ez","sequence":"first","affiliation":[]},{"given":"Lu\u00eds","family":"Paquete","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"St\u00fctzle","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,3,10]]},"reference":[{"key":"9034_CR1","first-page":"494","volume-title":"Evolutionary Multi-Criterion Optimization (EMO 2003), Vol. 2632 of Lecture Notes in Computer Science","author":"S. Bleuler","year":"2003","unstructured":"Bleuler, S., Laumanns, M., Thiele, L. and Zitzler, E.: PISA \u2013 A platform and programming language independent interface for search algorithms in C. M. Fonseca, P. J. Fleming, E. Zitzler, K. Deb and L. Thiele (eds.), Evolutionary Multi-Criterion Optimization (EMO 2003), Vol. 2632 of Lecture Notes in Computer Science, Springer, Berlin Heidelberg New York, 2003, pp. 494\u2013508."},{"key":"9034_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2787-6","volume-title":"The Quadratic Assignment Problem: Theory and Algorithms","author":"E. \u00c7ela","year":"1998","unstructured":"\u00c7ela, E.: The Quadratic Assignment Problem: Theory and Algorithms, Kluwer Academic, Dordrecht, The Netherlands, 1998."},{"key":"9034_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/b99492","volume-title":"Ant Colony Optimization","author":"M. Dorigo","year":"2004","unstructured":"Dorigo, M. and St\u00fctzle, T.: Ant Colony Optimization, MIT, Cambridge, Massachusetts, 2004."},{"key":"9034_CR4","first-page":"173","volume-title":"Quadratic Assignment and Related Problems, Vol. 16 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science","author":"C. Fleurent","year":"1994","unstructured":"Fleurent, C. and Ferland, J. A.: Genetic hybrids for the quadratic assignment problem, in P. M. Pardalos and H. Wolkowicz (eds.), Quadratic Assignment and Related Problems, Vol. 16 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, Providence, Rhode Island, 1994, pp. 173\u2013187."},{"issue":"4","key":"9034_CR5","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1023\/A:1009823419804","volume":"3","author":"P. Galinier","year":"1999","unstructured":"Galinier, P. and Hao, J. K.: Hybrid evolutionary algorithms for graph coloring. J. Comb. Optim. 3(4) (1999), 379\u2013397.","journal-title":"J. Comb. Optim."},{"issue":"2","key":"9034_CR6","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1057\/palgrave.jors.2600676","volume":"50","author":"L. M. Gambardella","year":"1999","unstructured":"Gambardella, L. M., Taillard, E. D. and Dorigo, M.: Ant colonies for the quadratic assignment problem. J. Oper. Res. Soc. 50(2) (1999), 167\u2013176.","journal-title":"J. Oper. Res. Soc."},{"key":"9034_CR7","first-page":"213","volume-title":"Evolutionary Multi-criterion Optimization (EMO 2001), Vol. 1993 of Lecture Notes in Computer Science","author":"V. Grunert da Fonseca","year":"2001","unstructured":"Grunert da Fonseca, V., Fonseca, C. M. and Hall, A.: Inferential performance assessment of stochastic optimisers and the attainment function, in E. Zitzler, K. Deb, L. Thiele, C. C. Coello and D. Corne (eds.), Evolutionary Multi-criterion Optimization (EMO 2001), Vol. 1993 of Lecture Notes in Computer Science, Springer, Berlin Heidelberg New York, 2001, pp. 213\u2013225."},{"key":"9034_CR8","first-page":"229","volume-title":"Operation Research Proceedings 2001, Selected Papers of the International Conference on Operations Research (OR2001)","author":"H. Hamacher","year":"2001","unstructured":"Hamacher, H., Nickel, S. and Tenfelde-Podehl, D.: Facilities layout for social institutions, in Operation Research Proceedings 2001, Selected Papers of the International Conference on Operations Research (OR2001), Springer, Berlin Heidelberg New York, 2001, pp. 229\u2013236."},{"key":"9034_CR9","unstructured":"Hansen, M. P. and Jaszkiewicz, A.: Evaluating the quality of approximations to the non-dominated set. Technical Report IMM-REP-1998-7, Institute of Mathematical Modelling, Technical University of Denmark, Lyngby, Denmark, 1998."},{"key":"9034_CR10","volume-title":"Stochastic Local Search \u2013 Foundations and Applications","author":"H. Hoos","year":"2004","unstructured":"Hoos, H. and St\u00fctzle, T.: Stochastic Local Search \u2013 Foundations and Applications, Morgan Kaufmann, San Francisco, California, 2004."},{"key":"9034_CR11","first-page":"359","volume-title":"First International Conference on Evolutionary Multi-Criterion Optimization, (EMO'01), Vol. 1993 of Lecture Notes in Computer Science","author":"S. Iredi","year":"2001","unstructured":"Iredi, S., Merkle, D. and Middendorf, M.: Bi-Criterion optimization with multi colony ant algorithms, in E. Zitzler, K. Deb, L. Thiele, C. C. Coello and D. Corne (eds.), First International Conference on Evolutionary Multi-Criterion Optimization, (EMO'01), Vol. 1993 of Lecture Notes in Computer Science, Springer, Berlin Heidelberg New York, 2001, pp. 359\u2013372."},{"issue":"2","key":"9034_CR12","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1109\/TEVC.2003.810752","volume":"7","author":"H. Ishibuchi","year":"2003","unstructured":"Ishibuchi, H., Yoshida, T. and Murata, T.: Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling. IEEE Trans. Evol. Comput. 7(2) (2003), 204\u2013223.","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"9034_CR13","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/S0377-2217(01)00104-7","volume":"137","author":"A. Jaszkiewicz","year":"2002","unstructured":"Jaszkiewicz, A.: Genetic local search for multiple objective combinatorial optimization. Eur. J. Oper. Res. 137(1) (2002), 50\u201371.","journal-title":"Eur. J. Oper. Res."},{"key":"9034_CR14","doi-asserted-by":"crossref","unstructured":"Knowles, J. and Corne, D.: The pareto archived evolution strategy: a new baseline algorithm for pareto multiobjective optimisation, in Proceedings of 1999 Congress on Evolutionary Computation (CEC'99), Vol. 1. 1999, pp. 98\u2013105.","DOI":"10.1109\/CEC.1999.781913"},{"key":"9034_CR15","unstructured":"Knowles, J. and Corne, D.: Towards landscape analyses to inform the design of a hybrid local search for the multiobjective quadratic assignment problem, in A. Abraham, J. R. del Solar and M. Koppen (eds.), Soft Computing Systems: Design, Management and Applications, IOS, 2002, pp. 271\u2013279."},{"key":"9034_CR16","first-page":"295","volume-title":"Evolutionary Multi-criterion Optimization (EMO 2003), Vol. 2632 of Lecture Notes in Computer Science","author":"J. Knowles","year":"2003","unstructured":"Knowles, J. and Corne, D.: Instance generators and test suites for the multiobjective quadratic assignment problem, in C. M. Fonseca, P. Fleming, E. Zitzler, K. Deb and L. Thiele (eds.), Evolutionary Multi-criterion Optimization (EMO 2003), Vol. 2632 of Lecture Notes in Computer Sience, Springer, Berlin Heidelberg New York, 2003, pp. 295\u2013310."},{"key":"9034_CR17","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M.: Multi-objective ant colony optimization. Diploma thesis, Intellectics Group, Computer Science Department, Technische Universit\u00e4t Darmstadt, Germany, 2004."},{"key":"9034_CR18","first-page":"214","volume-title":"ANTS'2004, Fourth International Workshop on Ant Algorithms and Swarm Intelligence, Vol. 3172 of Lecture Notes in Computer Science","author":"M. L\u00f3pez-Ib\u00e1\u00f1ez","year":"2004","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Paquete, L. and St\u00fctzle, T.: On the design of ACO for the biobjective quadratic assignment problem, in M. Dorigo, L. Gambardella, F. Mondada, T. St\u00fctzle, M. Birratari and C. Blum (eds.), ANTS'2004, Fourth International Workshop on Ant Algorithms and Swarm Intelligence, Vol. 3172 of Lecture Notes in Computer Science, Springer, Berlin Heidelberg New York, 2004, pp. 214\u2013225."},{"key":"9034_CR19","unstructured":"Merz, P.: Memetic algorithms for combinatorial optimization problems: fitness landscapes and effective search strategies. PhD thesis, Department of Electrical Engineering and Computer Science, University of Siegen, Germany, 2000."},{"issue":"4","key":"9034_CR20","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/4235.887234","volume":"4","author":"P. Merz","year":"2000","unstructured":"Merz, P. and Freisleben, B.: Fitness landscape analysis and memetic algorithms for the quadratic assignment problem. IEEE Trans. Evol Comput. 4(4) (2000), 337\u2013352.","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9034_CR21","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/978-3-642-17144-4_7","volume-title":"Metaheuristics for Multiobjective Optimisation, Vol. 535 of Lecture Notes in Economics and Mathematical Systems","author":"L. Paquete","year":"2004","unstructured":"Paquete, L., Chiarandini, M. and St\u00fctzle, T.: Pareto local optimum sets in the biobjective traveling salesman problem: an experimental study, in X. Gandibleux, M. Sevaux, K. S\u00f6rensen and V. T'kindt (eds.), Metaheuristics for Multiobjective Optimisation, Vol. 535 of Lecture Notes in Economics and Mathematical Systems, Springer, Berlin Heidelberg New York, 2004, pp. 177\u2013200."},{"issue":"3","key":"9034_CR22","doi-asserted-by":"crossref","first-page":"943","DOI":"10.1016\/j.ejor.2004.08.024","volume":"169","author":"L. Paquete","year":"2006","unstructured":"Paquete, L. and St\u00fctzle, T.: A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices. Eur. J. Oper. Res. 169(3) (2006), 943\u2013959.","journal-title":"Eur. J. Oper. Res."},{"key":"9034_CR23","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S. Sahni","year":"1976","unstructured":"Sahni, S. and Gonzalez, T.: P-complete approximation problems. J. ACM 23 (1976), 555\u2013565.","journal-title":"J. ACM"},{"key":"9034_CR24","volume-title":"Multiple Criteria Optimization: Theory, Computation and Application, Wiley Series in Probability and Mathematical Statistics","author":"R. E. Steuer","year":"1986","unstructured":"Steuer, R. E.: Multiple Criteria Optimization: Theory, Computation and Application, Wiley Series in Probability and Mathematical Statistics, Wiley, New York, 1986."},{"key":"9034_CR25","first-page":"33","volume-title":"New Ideas in Optimization","author":"T. St\u00fctzle","year":"1999","unstructured":"St\u00fctzle, T. and Dorigo, M.: ACO algorithms for the quadratic assignment problem, in D. Corne, M. Dorigo and F. Glover (eds.), New Ideas in Optimization, McGraw Hill, London, UK, 1999, pp. 33\u201350."},{"issue":"8","key":"9034_CR26","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T. St\u00fctzle","year":"2000","unstructured":"St\u00fctzle, T. and Hoos, H. H.: % MathType!Translator!2!1!AMS LaTeX.tdl!TeX -- AMS-LaTeX! % MathType!MTEF!2!1!+- % feaaeaart1ev0aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbbjxAHX % garmWu51MyVXgatuuDJXwAK1uy0HwmaeHbfv3ySLgzG0uy0Hgip5wz % aebbnrfifHhDYfgasaacH8qrps0lbbf9q8WrFfeuY-Hhbbf9v8qqaq % Fr0xc9pk0xbba9q8WqFfea0-yr0RYxir-Jbba9q8aq0-yq-He9q8qq % Q8frFve9Fve9Ff0dmeaabaqaciGacaGaaeqabaWaaeWaeaaakeaacq % qIZestcqqIaeFqcqqIxepwaaa!3C70! $$ {\\user1{\\mathcal{M}\\mathcal{A}\\mathcal{X}}} $$ - % MathType!Translator!2!1!AMS LaTeX.tdl!TeX -- AMS-LaTeX!% MathType!MTEF!2!1!+-% feaaeaart1ev0aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbbjxAHX% garmWu51MyVXgatuuDJXwAK1uy0HwmaeHbfv3ySLgzG0uy0Hgip5wz% aebbnrfifHhDYfgasaacH8qrps0lbbf9q8WrFfeuY-Hhbbf9v8qqaq% Fr0xc9pk0xbba9q8WqFfea0-yr0RYxir-Jbba9q8aq0-yq-He9q8qq% Q8frFve9Fve9Ff0dmeaabaqaciGacaGaaeqabaWaaeWaeaaakeaacq% qIZestcqqIqesscqqIneVtaaa!3BA4! $${\\user1{\\mathcal{M}\\mathcal{I}\\mathcal{N}}}$$ ant system. Future Gener. Comput. Syst. 16(8) (2000), 889\u2013914.","journal-title":"Future Gener. Comput. Syst."},{"key":"9034_CR27","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"17","author":"\u00c9. D. Taillard","year":"1991","unstructured":"Taillard, \u00c9. D.: Robust taboo search for the quadratic assignment problem. Parallel Comput. 17 (1991), 443\u2013455.","journal-title":"Parallel Comput."},{"key":"9034_CR28","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0966-8349(95)00008-6","volume":"3","author":"\u00c9. D. Taillard","year":"1995","unstructured":"Taillard, \u00c9. D.: Comparison of iterative searches for the quadratic assignment problem. Location Sci. 3 (1995), 87\u2013105.","journal-title":"Location Sci."},{"key":"9034_CR29","unstructured":"Zitzler, E., Laumanns, M. and Thiele, L.: SPEA2: Improving the strength Pareto evolutionary algorithm for multiobjective optimization, in K. Giannakoglou, D. Tsahalis, J. Periaux, K. Papaliliou and T. Fogarty (eds.), Evolutionary Methods for Design, Optimisation and Control with Application to Industrial Problems. Proceedings of the EUROGEN2001 Conference, International Center for Numerical Methods in Engineering (CIMNE), 2002, pp. 95\u2013100."},{"issue":"3","key":"9034_CR30","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1109\/4235.797969","volume":"4","author":"E. Zitzler","year":"1999","unstructured":"Zitzler, E. and Thiele, L.: Multiobjective evolutionary algorithms: A comparative case study and the strength Pareto approach. IEEE Trans. Evol. Comput. 4(3) (1999), 257\u2013271.","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"9034_CR31","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1109\/TEVC.2003.810758","volume":"7","author":"E. Zitzler","year":"2003","unstructured":"Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C. M. and Grunert da Fonseca, V.: Performance assessment of multiobjective optimizers: an analysis and review. IEEE Trans. Evol. Comput. 7(2) (2003), 117\u2013132.","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Journal of Mathematical Modelling and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-005-9034-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10852-005-9034-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-005-9034-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:26:29Z","timestamp":1559255189000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10852-005-9034-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,3,10]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,4]]}},"alternative-id":["9034"],"URL":"https:\/\/doi.org\/10.1007\/s10852-005-9034-x","relation":{},"ISSN":["1570-1166","1572-9214"],"issn-type":[{"value":"1570-1166","type":"print"},{"value":"1572-9214","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,3,10]]}}}