{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:54:07Z","timestamp":1743144847652,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642198922"},{"type":"electronic","value":"9783642198939"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19893-9_18","type":"book-chapter","created":{"date-parts":[[2011,3,25]],"date-time":"2011-03-25T13:00:35Z","timestamp":1301058035000},"page":"254-268","source":"Crossref","is-referenced-by-count":8,"title":["Very Large-Scale Neighborhood Search for Solving Multiobjective Combinatorial Optimization Problems"],"prefix":"10.1007","author":[{"given":"Thibaut","family":"Lust","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacques","family":"Teghem","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Tuyttens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-3","key":"18_CR1","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0166-218X(01)00338-9","volume":"123","author":"R.K. Ahuja","year":"2002","unstructured":"Ahuja, R.K., Ergun, \u00d6., Orlin, J.B., Punnen, A.P.: A survey of very large-scale neighborhood search techniques. Discrete Appl. Math.\u00a0123(1-3), 75\u2013102 (2002)","journal-title":"Discrete Appl. Math."},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Alsheddy, A., Tsang, E.P.K.: Guided Pareto local search and its application to the 0\/1 multi-objective knapsack problems. In: Proceedings of the Eighth Metaheuristic International Conference (MIC 2009), Hamburg (2009)","DOI":"10.1109\/CEC.2010.5585983"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Alsheddy, A., Tsang, E.P.K.: Guided Pareto local search based frameworks for Pareto optimization. In: Proceedings of the WCCCI IEEE World Congress on Computational Intelligence, Barcelona (2010)","DOI":"10.1109\/CEC.2010.5585983"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"3458","DOI":"10.1016\/j.cor.2006.02.008","volume":"34","author":"M.J. Alves","year":"2007","unstructured":"Alves, M.J., Almeida, M.: MOTGA: A multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem. Computers & Operations Research\u00a034, 3458\u20133470 (2007)","journal-title":"Computers & Operations Research"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1287\/mnsc.25.1.73","volume":"25","author":"Y.P. Aneja","year":"1979","unstructured":"Aneja, Y.P., Nair, K.P.K.: Bicriteria transportation problem. Management Science\u00a025, 73\u201378 (1979)","journal-title":"Management Science"},{"key":"18_CR6","series-title":"Lecture Notes in Economics and Mathematical Systems","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-642-17144-4_6","volume-title":"Metaheuristics for Multiobjective Optimisation","author":"E. Angel","year":"2004","unstructured":"Angel, E., Bampis, E., Gourv\u00e9s, L.: A dynasearch neighborhood for the bicriteria traveling salesman problem. In: Gandibleux, X., Sevaux, M., S\u00f6rensen, K., T\u2019kindt, V. (eds.) Metaheuristics for Multiobjective Optimisation. Lecture Notes in Economics and Mathematical Systems, vol.\u00a0535, pp. 153\u2013176. Springer, Berlin (2004)"},{"key":"18_CR7","unstructured":"Barichard, V., Hao, J.K.: An empirical study of tabu search for the MOKP. In: Proceedings of the First International Workshop on Heuristics, China. Series of Information & Management Sciences, vol.\u00a04, pp. 47\u201356 (2002)"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s10479-007-0199-8","volume":"157","author":"R.P. Beausoleil","year":"2008","unstructured":"Beausoleil, R.P., Baldoquin, G., Montejo, R.A.: Multi-start and path relinking methods to deal with multiobjective knapsack problems. Annals of Operations Research\u00a0157, 105\u2013133 (2008)","journal-title":"Annals of Operations Research"},{"key":"18_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-5184-0","volume-title":"Evolutionary Algorithms for Solving Multi-Objective Problems","author":"C.A. Coello Coello","year":"2002","unstructured":"Coello Coello, C.A., Van Veldhuizen, D.A., Lamont, G.B.: Evolutionary Algorithms for Solving Multi-Objective Problems. Kluwer Academic Publishers, New York (2002)"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1002\/(SICI)1099-1360(199801)7:1<34::AID-MCDA161>3.0.CO;2-6","volume":"7","author":"P. Czyzak","year":"1998","unstructured":"Czyzak, P., Jaszkiewicz, A.: Pareto simulated annealing\u2014a metaheuristic technique for multiple-objective combinatorial optimization. Journal of Multi-Criteria Decision Analysis\u00a07, 34\u201347 (1998)","journal-title":"Journal of Multi-Criteria Decision Analysis"},{"issue":"3","key":"18_CR11","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1023\/B:JMMA.0000038617.09620.02","volume":"3","author":"C. Gomes da Silva","year":"2004","unstructured":"Gomes da Silva, C., Cl\u00edmaco, J., Figueira, J.R.: Scatter search method for the bi-criteria multi-dimensional {0,1}-knapsack problem using surrogate relaxation. Journal of Mathematical Modelling and Algorithms\u00a03(3), 183\u2013208 (2004)","journal-title":"Journal of Mathematical Modelling and Algorithms"},{"key":"18_CR12","volume-title":"Multi-objective optimization using evolutionary algorithms","author":"K. Deb","year":"2001","unstructured":"Deb, K.: Multi-objective optimization using evolutionary algorithms. Wiley, New York (2001)"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/0-306-48107-3_8","volume-title":"Multiple Criteria Optimization \u2013 State of the Art Annotated Bibliographic Surveys","author":"M. Ehrgott","year":"2002","unstructured":"Ehrgott, M., Gandibleux, X.: Multiobjective combinatorial optimization. In: Ehrgott, M., Gandibleux, X. (eds.) Multiple Criteria Optimization \u2013 State of the Art Annotated Bibliographic Surveys, vol.\u00a052, pp. 369\u2013444. Kluwer Academic Publishers, Boston (2002)"},{"key":"18_CR14","unstructured":"Gandibleux, X., Vancoppenolle, D., Tuyttens, D.: A first making use of GRASP for solving MOCO problems. In: 14th International Conference in Multiple Criteria Decision-Making, Charlottesville (1998)"},{"key":"18_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/b101874","volume-title":"Handbook of Metaheuristics","author":"F. Glover","year":"2003","unstructured":"Glover, F., Kochenberger, G.: Handbook of Metaheuristics. Kluwer, Boston (2003)"},{"issue":"3","key":"18_CR16","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P. Hansen","year":"2001","unstructured":"Hansen, P., Mladenovic, N.: Variable neighborhood search: Principles and applications. European Journal of Operational Research\u00a0130(3), 449\u2013467 (2001)","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"18_CR17","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1109\/5326.704576","volume":"28","author":"H. Ishibuchi","year":"1998","unstructured":"Ishibuchi, H., Murada, T.: A multi-objective genetic local search algorithm and its application to flow shop scheduling. IEEE Transactions on Systems, Man, and Cybernetics - Part C: Applications and Reviews\u00a028(3), 392\u2013403 (1998)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics - Part C: Applications and Reviews"},{"key":"18_CR18","unstructured":"Jaszkiewicz, A.: Experiments done with the MOMHLIB: Technical report, Institute of Computing Science, Pozna\u0144 University of Technology (2000), http:\/\/www-idss.cs.put.poznan.pl\/jaszkiewicz\/momhlib\/"},{"key":"18_CR19","unstructured":"Jaszkiewicz, A.: On the Performance of Multiple-Objective Genetic Local Search on the 0\/1 Knapsack Problem\u2014A Comparative Experiment. Technical Report RA-002\/2000, Institute of Computing Science, Pozna\u0144 University of Technology, Pozna\u0144, Poland (July 2000)"},{"key":"18_CR20","unstructured":"Jaszkiewicz, A.: A comparative study of multiple-objective metaheuristics on the bi-objective set covering problem and the Pareto memetic algorithm. Technical Report RA-003\/01, Institute of Computing Science, Pozna\u0144 University of Technology, Pozna\u0144, Poland (2001)"},{"issue":"4","key":"18_CR21","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1109\/TEVC.2002.802873","volume":"6","author":"A. Jaszkiewicz","year":"2002","unstructured":"Jaszkiewicz, A.: On the Performance of Multiple-Objective Genetic Local Search on the 0\/1 Knapsack Problem\u2014A Comparative Experiment. IEEE Transactions on Evolutionary Computation\u00a06(4), 402\u2013412 (2002)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"2","key":"18_CR22","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1016\/j.ejor.2003.06.015","volume":"158","author":"A. Jaszkiewicz","year":"2004","unstructured":"Jaszkiewicz, A.: On the Computational Efficiency of Multiple Objective Metaheuristics. The Knapsack Problem Case Study. European Journal of Operational Research\u00a0158(2), 418\u2013433 (2004)","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"18_CR23","doi-asserted-by":"publisher","first-page":"1387","DOI":"10.1016\/j.ejor.2005.09.028","volume":"176","author":"G. Lan","year":"2007","unstructured":"Lan, G., DePuy, G.W., Whitehouse, G.E.: An effective and simple heuristic for the set covering problem. European Journal of Operational Research\u00a0176(3), 1387\u20131403 (2007)","journal-title":"European Journal of Operational Research"},{"key":"18_CR24","unstructured":"Laumanns, M., Thiele, L., Zitzler, E.: An adaptative scheme to generate the Pareto front based on the epsilon-constraint method. Technical Report 199, Technischer Bericht, Computer Engineering and Networks Laboratory (TIK), Swiss Federal Institute of Technology, ETH (2004)"},{"key":"18_CR25","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S. Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling-salesman problem. Operations Research\u00a021, 498\u2013516 (1973)","journal-title":"Operations Research"},{"issue":"1","key":"18_CR26","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1051\/ro:2008003","volume":"42","author":"T. Lust","year":"2008","unstructured":"Lust, T., Teghem, J.: Memots: a memetic algorithm integrating tabu search for combinatorial multiobjective optimization. RAIRO: Operations Research\u00a042(1), 3\u201333 (2008)","journal-title":"RAIRO: Operations Research"},{"key":"18_CR27","unstructured":"Lust, T., Teghem, J.: The multiobjective multidimensionnal knapsack problem: a survey and a new approach. Technical Report arXiv:1007.4063v1, arXiv (2010)"},{"issue":"3","key":"18_CR28","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s10732-009-9103-9","volume":"16","author":"T. Lust","year":"2010","unstructured":"Lust, T., Teghem, J.: Two-phase Pareto local search for the biobjective traveling salesman problem. Journal of Heuristics\u00a016(3), 475\u2013510 (2010)","journal-title":"Journal of Heuristics"},{"issue":"7","key":"18_CR29","doi-asserted-by":"publisher","first-page":"2502","DOI":"10.1016\/j.amc.2009.08.045","volume":"215","author":"G. Mavrotas","year":"2009","unstructured":"Mavrotas, G., Figueira, J.R., Florios, K.: Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core. Applied Mathematics and Computation\u00a0215(7), 2502\u20132514 (2009)","journal-title":"Applied Mathematics and Computation"},{"key":"18_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/3-540-58495-1_14","volume-title":"Methodologies for Intelligent Systems","author":"Z. Michalewicz","year":"1994","unstructured":"Michalewicz, Z., Arabas, J.: Genetic algorithms for the 0\/1 knapsack problem. In: Ra\u015b, Z.W., Zemankova, M. (eds.) ISMIS 1994. LNCS, vol.\u00a0869, pp. 134\u2013143. Springer, Heidelberg (1994)"},{"key":"18_CR31","series-title":"Lecture Notes in Economics and Mathematical Systems","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-17144-4_7","volume-title":"Metaheuristics for Multiobjective Optimisation","author":"L. Paquete","year":"2004","unstructured":"Paquete, L., Chiarandini, M., St\u00fctzle, T.: Pareto Local Optimum Sets in the Biobjective Traveling Salesman Problem: An Experimental Study. In: Gandibleux, X., Sevaux, M., S\u00f6rensen, K., T\u2019kindt, V. (eds.) Metaheuristics for Multiobjective Optimisation. Lecture Notes in Economics and Mathematical Systems, vol.\u00a0535, pp. 177\u2013199. Springer, Berlin (2004)"},{"issue":"1","key":"18_CR32","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10479-006-0060-5","volume":"147","author":"C. Prins","year":"2006","unstructured":"Prins, C., Prodhon, C., Wolfler Calvo, R.: Two-phase method and lagrangian relaxation to solve the bi-objective set covering problem. Annals OR\u00a0147(1), 23\u201341 (2006)","journal-title":"Annals OR"},{"key":"18_CR33","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/mcda.4020030204","volume":"3","author":"E.L. Ulungu","year":"1994","unstructured":"Ulungu, E.L., Teghem, J.: Multiobjective combinatorial optimization problems: A survey. Journal of Multi-Criteria Decision Analysis\u00a03, 83\u2013104 (1994)","journal-title":"Journal of Multi-Criteria Decision Analysis"},{"key":"18_CR34","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1109\/QEST.2004.2","volume-title":"QEST 2004: Proceedings of the The Quantitative Evaluation of Systems, First International Conference","author":"D.S. Vianna","year":"2004","unstructured":"Vianna, D.S., Arroyo, J.E.C.: A GRASP algorithm for the multi-objective knapsack problem. In: QEST 2004: Proceedings of the The Quantitative Evaluation of Systems, First International Conference, pp. 69\u201375. IEEE Computer Society, Washington, DC (2004)"},{"key":"18_CR35","unstructured":"Zitzler, E.: Evolutionary Algorithms for Multiobjective Optimization: Methods and Applications. PhD thesis, Swiss Federal Institute of Technology (ETH), Zurich, Switzerland (November 1999)"},{"key":"18_CR36","unstructured":"Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: Improving the Strength Pareto Evolutionary Algorithm. Technical Report 103, Computer Engineering and Networks Laboratory (TIK), Swiss Federal Institute of Technology (ETH) Zurich, Gloriastrasse 35, CH-8092 Zurich, Switzerland (May 2001)"},{"issue":"4","key":"18_CR37","doi-asserted-by":"publisher","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 Transactions on Evolutionary Computation\u00a03(4), 257\u2013271 (1999)","journal-title":"IEEE Transactions on Evolutionary Computation"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Multi-Criterion Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19893-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T17:48:59Z","timestamp":1741110539000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19893-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642198922","9783642198939"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19893-9_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}