{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T01:20:09Z","timestamp":1773883209483,"version":"3.50.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,6,25]],"date-time":"2014-06-25T00:00:00Z","timestamp":1403654400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1007\/s10898-014-0213-z","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T09:23:56Z","timestamp":1403601836000},"page":"515-536","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":85,"title":["Multi-objective variable neighborhood search: an application to combinatorial optimization problems"],"prefix":"10.1007","volume":"63","author":[{"given":"Abraham","family":"Duarte","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan J.","family":"Pantrigo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduardo G.","family":"Pardo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nenad","family":"Mladenovic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,6,25]]},"reference":[{"key":"213_CR1","doi-asserted-by":"crossref","unstructured":"Abdelaziz, F.B., Krichen, S.: A tabu search heuristic for multiobjective knapsack problems. In: Computational Engineering in Systems applications (CESA\u201998). IEEE Systems Man and Cybernetics, vol. 2, pp. 212\u2013216 (1998)","DOI":"10.1007\/978-1-4615-5775-3_14"},{"key":"213_CR2","doi-asserted-by":"crossref","unstructured":"Abdelaziz, F.B., Krichen, S., Chaouachi, J.: A hybrid heuristic for multiobjective knapsack problems. In: Vo\u00df, S., Martello, S., Osman, I.H., Roucairol, C. (eds.) Meta-heuristics. Springer, Berlin, pp. 205\u2013212. ISBN:978-1-4613-7646-0 (1999)","DOI":"10.1007\/978-1-4615-5775-3_14"},{"key":"213_CR3","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/j.entcs.2011.11.022","volume":"281","author":"JE Claudio","year":"2011","unstructured":"Claudio, J.E., dos Santos, R., de Paiva, A.: Multi-objective variable neighborhood search algorithms for a single machine scheduling problem with distinct due windows. Electron. Notes Theor. Comput. Sci. 281, 5\u201319 (2011)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"213_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-5184-0","volume-title":"Evolutionary Algorithms for Solving Multi-objective Problems","author":"C Coello","year":"2002","unstructured":"Coello, C., Veldhuizen, D.A.V., Lamont, G.B.: Evolutionary Algorithms for Solving Multi-objective Problems. Kluwer, Dordrecht (2002)"},{"key":"213_CR5","doi-asserted-by":"crossref","unstructured":"Czyz\u017cak, P., Jaszkiewicz, A.: Pareto simulated annealing\u2014a metaheuristic technique for multiple-objective combinatorial optimization. J. Multi-Criteria Decis. Anal. 7(1), 34\u201347. ISSN:1099-1360 (1998)","DOI":"10.1002\/(SICI)1099-1360(199801)7:1<34::AID-MCDA161>3.0.CO;2-6"},{"key":"213_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-45356-3_83","volume-title":"A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimization: NSGA-II","author":"K Deb","year":"2000","unstructured":"Deb, K., Agrawal, S., Pratap, A., Meyarivan, T.: A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimization: NSGA-II. Springer, Berlin (2000)"},{"key":"213_CR7","doi-asserted-by":"crossref","unstructured":"Duarte, A., S\u00e1nchez, A., Fern\u00e1ndez, F., Cabido, R.: A low-level hybridization between memetic algorithm and vns for the max-cut problem. In: ACM Genetic and Evolutionary Computation Conference (GECCO 05), pp. 999\u20131006, Washington. ACM (2005)","DOI":"10.1145\/1068009.1068178"},{"key":"213_CR8","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1002\/net.20418","volume":"58","author":"A Duarte","year":"2011","unstructured":"Duarte, A., Mart\u00ed, R., Resende, M.G.C., Silva, R.M.A.: Grasp with path relinking heuristics for the antibandwidth problem. Networks 58, 171\u2013189 (2011)","journal-title":"Networks"},{"key":"213_CR9","doi-asserted-by":"crossref","first-page":"3247","DOI":"10.1016\/j.cor.2012.04.017","volume":"39","author":"A Duarte","year":"2012","unstructured":"Duarte, A., Escudero, L.F., Mart\u00ed, R., Mladenovic, N., Pantrigo, J.J., S\u00e1nchez-Oro, J.: Variable neighborhood search for the vertex separation problem. Comput. Oper. Res. 39, 3247\u20133255 (2012)","journal-title":"Comput. Oper. Res."},{"key":"213_CR10","doi-asserted-by":"crossref","unstructured":"Durillo, J.J., Nebro, A.J.: jMetal: a java framework for multi-objective optimization. Adv. Eng. Softw. 42, 760\u2013771. ISSN:0965-9978 (2011)","DOI":"10.1016\/j.advengsoft.2011.05.014"},{"key":"213_CR11","doi-asserted-by":"crossref","unstructured":"Gandibleux, X., Freville, A.: Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: the two objectives case. J. Heuristics 6(3), 361\u2013383. ISSN:1381-1231 (2000)","DOI":"10.1023\/A:1009682532542"},{"key":"213_CR12","doi-asserted-by":"crossref","unstructured":"Gandibleux, X., Morita, H., Katoh, N.: The supported solutions used as a genetic information in a population heuristic. In: Zitzler, E., Thiele, L., Deb, K., Coello Coello, C.A., Corne, D. (eds.) Evolutionary Multi-criterion Optimization, vol. 1993 of Lecture Notes in Computer Science, pp. 429\u2013442. Springer, Berlin. ISBN:978-3-540-41745-3 (2001)","DOI":"10.1007\/3-540-44719-9_30"},{"key":"213_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-17144-4","volume-title":"Metaheuristics for Multi-objective Optimization","author":"X Gandibleux","year":"2004","unstructured":"Gandibleux, X., Sevaux, M., Sorensen, K., T\u2019kindt, V.: Metaheuristics for Multi-objective Optimization. Springer, Berlin (2004)"},{"key":"213_CR14","unstructured":"Geiger, M.J.: Randomised variable neighbourhood search for multi objective optimisation. In: Proceedings of EU\/ME Workshop: Design and Evaluation of Advanced Hybrid Meta-heuristics, pp. 34\u201342 (2004)"},{"key":"213_CR15","doi-asserted-by":"crossref","unstructured":"Gomes Da Silva, C., Cl\u00edmaco, J., Figueira, J.: A scatter search method for bi-criteria 0-1-knapsack problems. Eur. J. Oper. Res. 169(2), 373\u2013391. ISSN:0377-2217 (2006)","DOI":"10.1016\/j.ejor.2004.08.005"},{"key":"213_CR16","doi-asserted-by":"crossref","unstructured":"Gomes Da Silva, C., Figueira, J., Cl\u00edmaco, J.: Integrating partial optimization with scatter search for solving bi-criteria 0,1-knapsack problems. Eur. J. Oper. Res. 177(3), 1656\u20131677. ISSN:0377-2217 (2007)","DOI":"10.1016\/j.ejor.2005.10.013"},{"key":"213_CR17","unstructured":"Hansen, M.P., Jaszkiewicz, A.: Evaluating the quality of approximations to the non-dominated set. Technical report, Technical University of Denmark. IMM-REP-1998-7 (1998)"},{"key":"213_CR18","doi-asserted-by":"crossref","unstructured":"Hansen, P., Mladenovi\u0107, N., Moreno P\u00e9rez, J.A.: Variable neighbourhood search: methods and applications. 4OR Q. J. Oper. Res. 6, 319\u2013360. ISSN:1619-4500 (2008)","DOI":"10.1007\/s10288-008-0089-1"},{"key":"213_CR19","doi-asserted-by":"crossref","unstructured":"Hansen, P., Mladenovi\u0107, N., Moreno P\u00e9rez, J.A.: Variable neighbourhood search: algorithms and applications. Ann. Oper. Res. 175, 367\u2013407 (2010)","DOI":"10.1007\/s10479-009-0657-6"},{"key":"213_CR20","unstructured":"Knowles, J.: Local-search and hybrid evolutionary algorithms for Pareto optimization. Ph.D. thesis (2002). http:\/\/dbkgroup.org\/knowles\/thesis.html"},{"key":"213_CR21","unstructured":"Knowles, J., Thiele, L., Zitzler, E.: A tutorial on the performance assessment of stochastic multiobjective optimizers, 214. Computer Engineering and Networks Laboratory (TIK), ETH Zurich, Switzerland (revised version) (2006)"},{"key":"213_CR22","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1007\/s10732-009-9108-4","volume":"16","author":"Y-C Liang","year":"2010","unstructured":"Liang, Y.-C., Lo, M.-H.: Multi-objective redundancy allocation optimization using a variable neighborhood search algorithm. J. Heuristics 16, 511\u2013535 (2010)","journal-title":"J. Heuristics"},{"key":"213_CR23","unstructured":"Liang, Y.-C., Chen, H.-L.A., Tien, C.-Y.: Variable neighborhood search for multi-objective parallel machine scheduling problems. In: Proceedings of the 8th International Conference on Information and Management Sciences, pp. 519\u2013522 (2009)"},{"key":"213_CR24","doi-asserted-by":"crossref","first-page":"919","DOI":"10.1007\/s10732-012-9213-7","volume":"18","author":"M Lozano","year":"2012","unstructured":"Lozano, M., Duarte, A., Gort\u00e1zar, F., Mart\u00ed, R.: Variable neighborhood search with ejection chains for the antibandwidth problem. J. Heuristics 18, 919\u2013938 (2012)","journal-title":"J. Heuristics"},{"key":"213_CR25","doi-asserted-by":"crossref","unstructured":"Lust, T., Teghem, J.: The multiobjective multidimensional knapsack problem: a survey and a new approach. Int. Trans. Oper. Res. 19(4), 495\u2013520. ISSN:1475-3995 (2012)","DOI":"10.1111\/j.1475-3995.2011.00840.x"},{"key":"213_CR26","doi-asserted-by":"crossref","unstructured":"Lust, T., Teghem, J., Tuyttens, D.: Very large-scale neighborhood search for solving multiobjective combinatorial optimization problems. In: Takahashi, R.H.C., Deb, K., Wanner, E.F., Greco, S. (eds.) Evolutionary Multi-criterion Optimization, vol. 6576 of Lecture Notes in Computer Science, pp. 254\u2013268. Springer, Berlin. ISBN:978-3-642-19892-2 (2011)","DOI":"10.1007\/978-3-642-19893-9_18"},{"issue":"11","key":"213_CR27","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"key":"213_CR28","doi-asserted-by":"crossref","unstructured":"Mladenovic, N., Urosevic, D., P\u00e9rez-Brito, D., Garc\u00eda-Gonz\u00e1lez, C.G.: Variable neighbourhood search for bandwidth reduction. Eur. J. Oper. Res. 200(1), 14\u201327. ISSN:0377-2217 (2010)","DOI":"10.1016\/j.ejor.2008.12.015"},{"key":"213_CR29","doi-asserted-by":"crossref","unstructured":"Pantrigo, J.J., Mart\u00ed, R., Duarte, A., Pardo, E.G.: Scatter search for the cutwidth minimization problem. Ann. Oper. Res. 199. ISSN:0254-5330 (2012)","DOI":"10.1007\/s10479-011-0907-2"},{"key":"213_CR30","doi-asserted-by":"crossref","first-page":"2242","DOI":"10.1016\/j.asoc.2013.01.016","volume":"13","author":"EG Pardo","year":"2013","unstructured":"Pardo, E.G., Mladenovic, N., Duarte, A., Pantrigo, J.J.: Variable formulation search for the cutwidth minimization problem. Appl. Soft Comput. 13, 2242\u20132252 (2013)","journal-title":"Appl. Soft Comput."},{"key":"213_CR31","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1016\/j.cor.2008.05.011","volume":"37","author":"MGC Resende","year":"2010","unstructured":"Resende, M.G.C., Mart\u00ed, R., Gallego, M., Duarte, A.: Grasp and path relinking for the max\u2013min diversity problem. Comput. Oper. Res. 37, 498\u2013508 (2010)","journal-title":"Comput. Oper. Res."},{"key":"213_CR32","doi-asserted-by":"crossref","unstructured":"Rodriguez-Tello, E., Hao, J.K., Torres-Jimenez, J.: An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem. Comput. Oper. Res. 35(10), 3331\u20133346. ISSN:0305-0548 (2008)","DOI":"10.1016\/j.cor.2007.03.001"},{"key":"213_CR33","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/s11721-009-0029-5","volume":"3","author":"M Schilde","year":"2009","unstructured":"Schilde, M., Doerner, K.F., Hartl, R.F., Kiechle, G.: Metaheuristics for the bi-objective orienteering problem. Swarm Intell. 3, 179\u2013201 (2009)","journal-title":"Swarm Intell."},{"key":"213_CR34","unstructured":"Ulungu, E.L.: Optimisation Combinatoire Multicrit\u00e8re : D\u00e9termination de l\u2019Ensemble des solutions Efficaces et M\u00e9thodes Interactives. Ph.D. thesis, Universit\u00e9 de Mons-Hainaut (Mons, Belgium) (1993)"},{"issue":"4","key":"213_CR35","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Trans. Evolut. Comput. 3(4), 257\u2013271 (1999)","journal-title":"IEEE Trans. Evolut. Comput."},{"key":"213_CR36","unstructured":"Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: improving the strength Pareto evolutionary algorithm for multiobjective optimization. In: Giannakoglou, K.C. (ed.) Evolutionary Methods for Design, Optimisation and Control with Application to Industrial Problems (EUROGEN 2001), pp. 95\u2013100. International Center for Numerical Methods in Engineering (CIMNE), Barcelona (2002)"},{"issue":"2","key":"213_CR37","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., Grunert da Fonseca, V.: Performance assessment of multiobjective optimizers: an analysis and review. IEEE Trans. Evolut. Comput. 7(2), 117\u2013132 (2003)","journal-title":"IEEE Trans. Evolut. Comput."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-014-0213-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-014-0213-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-014-0213-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,11]],"date-time":"2019-08-11T21:23:30Z","timestamp":1565558610000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-014-0213-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,25]]},"references-count":37,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["213"],"URL":"https:\/\/doi.org\/10.1007\/s10898-014-0213-z","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6,25]]}}}