{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T05:52:19Z","timestamp":1769925139706,"version":"3.49.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,8,4]],"date-time":"2007-08-04T00:00:00Z","timestamp":1186185600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2007,9,13]]},"DOI":"10.1007\/s10479-007-0230-0","type":"journal-article","created":{"date-parts":[[2007,8,3]],"date-time":"2007-08-03T12:11:31Z","timestamp":1186143091000},"page":"83-97","source":"Crossref","is-referenced-by-count":85,"title":["On local optima in multiobjective combinatorial optimization problems"],"prefix":"10.1007","volume":"156","author":[{"given":"Luis","family":"Paquete","sequence":"first","affiliation":[]},{"given":"Tommaso","family":"Schiavinotto","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"St\u00fctzle","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,8,4]]},"reference":[{"key":"230_CR1","volume-title":"Local search in combinatorial optimization","year":"1997","unstructured":"Aarts, E. H. L., & Lenstra, J. K. (Eds.). (1997). Local search in combinatorial optimization. Chichester: Wiley."},{"key":"230_CR2","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0304-3975(03)00376-1","volume":"310","author":"E. Angel","year":"2004","unstructured":"Angel, E., Bampis, E., & Gourv\u00e9s, L. (2004a). Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem. Theoretical Computer Science, 310, 135\u2013146.","journal-title":"Theoretical Computer Science"},{"key":"230_CR3","series-title":"Metaheuristics for multiobjective optimisation","first-page":"153","volume-title":"Lecture notes in economics and mathematical systems","author":"E. Angel","year":"2004","unstructured":"Angel, E., Bampis, E., & Gourv\u00e9s, L. (2004b). A dynasearch neighborhood for the bicriteria traveling salesman problem. In X. Gandibleux, M. Sevaux, K. S\u00f6rensen & V. T\u2019kindt (Eds.), Lecture notes in economics and mathematical systems : Vol. 535. Metaheuristics for multiobjective optimisation (pp. 153\u2013176). Berlin: Springer."},{"issue":"3","key":"230_CR4","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1162\/evco.1999.7.3.205","volume":"7","author":"K. Deb","year":"1999","unstructured":"Deb, K. (1999). Multi-objective genetic algorithms: problem difficulties and construction of test problems. Evolutionary Computation, 7(3), 205\u2013230.","journal-title":"Evolutionary Computation"},{"key":"230_CR5","series-title":"Lecture notes in economics and mathematical systems","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-22199-0","volume-title":"Multicriteria optimization","author":"M. Ehrgott","year":"2000","unstructured":"Ehrgott, M. (2000). Lecture notes in economics and mathematical systems: Vol.\u00a0491. Multicriteria optimization. Heidelberg: Springer."},{"issue":"1","key":"230_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02578918","volume":"12","author":"M. Ehrgott","year":"2004","unstructured":"Ehrgott, M., & Gandibleux, X. (2004). Approximative solution methods for combinatorial multicriteria optimization. TOP, 12(1), 1\u201390.","journal-title":"TOP"},{"key":"230_CR7","first-page":"903","volume":"6","author":"V. Emelichev","year":"1991","unstructured":"Emelichev, V., & Perepelitsa, V. (1991). Complexity of vector optimization problems on graphs. Optimization, 6, 903\u2013918.","journal-title":"Optimization"},{"issue":"5","key":"230_CR8","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1515\/dma.1992.2.5.461","volume":"2","author":"V. Emelichev","year":"1992","unstructured":"Emelichev, V., & Perepelitsa, V. (1992). On the cardinality of the set of alternatives in discrete many-criterion problems. Discrete Mathematics and Applications, 2(5), 461\u2013471.","journal-title":"Discrete Mathematics and Applications"},{"issue":"12","key":"230_CR9","doi-asserted-by":"crossref","first-page":"1603","DOI":"10.1287\/mnsc.48.12.1603.445","volume":"48","author":"T. Erlebach","year":"2002","unstructured":"Erlebach, T., Kellerer, H., & Pferschy, U. (2002). Approximating multiobjective knapsack problems. Management Science, 48(12), 1603\u20131612.","journal-title":"Management Science"},{"key":"230_CR10","volume-title":"Lecture notes in computer science: Vol. 2632. Evolutionary multi-criterion optimization (EMO 2003)","year":"2003","unstructured":"Fonseca, C., Fleming, P., Zitzler, E., Deb, K., & Thiele, L. (Eds.). (2003). Lecture notes in computer science: Vol. 2632. Evolutionary multi-criterion optimization (EMO 2003). Berlin: Springer."},{"key":"230_CR11","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF02032304","volume":"5","author":"H. Hamacher","year":"1994","unstructured":"Hamacher, H., & Ruhe, G. (1994). On spanning tree problems with multiple objectives. Annals of Operations Research, 5, 209\u2013230.","journal-title":"Annals of Operations Research"},{"key":"230_CR12","unstructured":"Hansen, M., & Jaszkiewicz, A. (1998). 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."},{"key":"230_CR13","series-title":"Lecture notes in economics and mathematical systems","first-page":"109","volume-title":"Multiple criteria decision making theory and application","author":"P. Hansen","year":"1979","unstructured":"Hansen, P. (1979). Bicriterion path problems. In Lecture notes in economics and mathematical systems : Vol. 177. Multiple criteria decision making theory and application (pp. 109\u2013127). Berlin: Springer."},{"key":"230_CR14","first-page":"145","volume-title":"Handbook of metaheuristics","author":"P. Hansen","year":"2002","unstructured":"Hansen, P., & Mladenovi\u0107, N. (2002). Variable neighborhood search. In F. Glover & G. Kochenberger (Eds.), Handbook of metaheuristics (pp. 145\u2013184). Norwell: Kluwer Academic."},{"key":"230_CR15","volume-title":"Stochastic local search\u2014foundations and applications","author":"H. H. Hoos","year":"2004","unstructured":"Hoos, H. H., & St\u00fctzle, T. (2004). Stochastic local search\u2014foundations and applications. San Francisco: Morgan Kaufmann."},{"issue":"12","key":"230_CR16","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1016\/S0305-0548(96)00026-3","volume":"23","author":"K. J\u00f6rnsten","year":"1996","unstructured":"J\u00f6rnsten, K., Andersen, K., & Lind, M. (1996). On bicriterion minimal spanning trees: an approximation. Computers & Operations Research, 23(12), 1171\u20131182.","journal-title":"Computers & Operations Research"},{"key":"230_CR17","doi-asserted-by":"crossref","unstructured":"Knowles, J., & Corne, D. (1999). The Pareto archived evolution strategy: a new base line algorithm for multiobjective optimisation. In Proceedings of the 1999 congress on evolutionary computation (CEC\u201999) (pp. 98\u2013105). Washington.","DOI":"10.1109\/CEC.1999.781913"},{"issue":"2","key":"230_CR18","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1162\/106365600568167","volume":"8","author":"J. Knowles","year":"2000","unstructured":"Knowles, J., & Corne, D. (2000). Approximating the nondominated front using the Pareto archived evolution strategy. Evolutionary Computation, 8(2), 149\u2013172.","journal-title":"Evolutionary Computation"},{"key":"230_CR19","series-title":"Metaheuristics for multiobjective optimisation","first-page":"39","volume-title":"Lecture notes in economics and mathematical systems","author":"J. Knowles","year":"2004","unstructured":"Knowles, J., & Corne, D. (2004). Bounded Pareto archiving: theory and practice. In X. Gandibleux, M. Sevaux, K. S\u00f6rensen & V. T\u2019kindt (Eds.), Lecture notes in economics and mathematical systems : Vol. 535. Metaheuristics for multiobjective optimisation (pp. 39\u201364). Berlin: Springer."},{"issue":"4","key":"230_CR20","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1145\/321906.321910","volume":"22","author":"H. Kung","year":"1975","unstructured":"Kung, H., Luccio, F., & Preparata, F. (1975). On finding the maxima of a set of vectors. Journal of the Association for Computing Machinery, 22(4), 469\u2013476.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"230_CR21","series-title":"Proceedings of PPSN-VII","first-page":"44","volume-title":"Lecture notes in computer science","author":"M. Laumanns","year":"2002","unstructured":"Laumanns, M., Thiele, L., Zitzler, E., Welzl, E., & Deb, K. (2002). Running time analysis of multi-objective evolutionary algorithms on a simple discrete optimization problem. In J. M. Guervos et al.\u00a0(Eds.), Lecture notes in computer science : Vol. 2439. Proceedings of PPSN-VII (pp. 44\u201353). Berlin: Springer."},{"key":"230_CR22","first-page":"219","volume-title":"New ideas in optimization","author":"P. Moscato","year":"1999","unstructured":"Moscato, P. (1999). Memetic algorithms: a short introduction. In D. Corne & M. Dorigo (Eds.), New ideas in optimization (pp. 219\u2013234). London: McGraw-Hill."},{"key":"230_CR23","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C. H., & Yannakakis, M. (2000). On the approximability of trade-offs and optimal access of web sources. In Proceedings of the 41st annual symposium on foundations of computer science (FOCS 2000) (pp. 86\u201392).","DOI":"10.1109\/SFCS.2000.892068"},{"key":"230_CR24","unstructured":"Paquete, L., Chiarandini, M., & St\u00fctzle, T. (2002). A study of local optima in the multiobjective traveling salesman problem (Technical report AIDA-02-07). Fachgebiet Intellektik, Fachbereich Informatik, Technische Universit\u00e4t Darmstadt. Presented at the multiobjective metaheuristics workshop (MOMH 2002), Paris, 4\u20135 November 2002."},{"key":"230_CR25","series-title":"Metaheuristics for multiobjective optimisation","first-page":"177","volume-title":"Lecture notes in economics and mathematical systems","author":"L. Paquete","year":"2004","unstructured":"Paquete, L., Chiarandini, M., & St\u00fctzle, T. (2004). Pareto local optimum sets in the biobjective traveling salesman problem: an experimental study. In X. Gandibleux, M. Sevaux K. S\u00f6rensen & V. T\u2019kindt (Eds.), Lecture notes in economics and mathematical systems : Vol. 535. Metaheuristics for multiobjective optimisation (pp. 177\u2013200). Berlin: Springer."},{"key":"230_CR26","series-title":"Evolutionary multi-criterion optimization (EMO 2003)","first-page":"479","volume-title":"Lecture notes in computer science","author":"L. Paquete","year":"2003","unstructured":"Paquete, L., & St\u00fctzle, T. (2003). A two-phase local search for the biobjective traveling salesman problem. In C. Fonseca, P. Fleming, E. Zitzler, K. Deb & L. Thiele (Eds.), Lecture notes in computer science : Vol. 2632. Evolutionary multi-criterion optimization (EMO 2003) (pp. 479\u2013493). New York: Springer."},{"issue":"3","key":"230_CR27","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., & St\u00fctzle, T. (2006). A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices. European Journal of Operational Research, 169(3), 943\u2013959.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"230_CR28","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF02247962","volume":"44","author":"G. Ruhe","year":"1990","unstructured":"Ruhe, G., & Fruhwirth, B. (1990). \u03b5-optimality for bicriteria programs and its application to minimum cost flows. Computing, 44(1), 21\u201334.","journal-title":"Computing"},{"key":"230_CR29","unstructured":"Schott, J. R. (1995). Fault tolerant design using single and multicriteria genetic algorithm optimization. Master\u2019s thesis, Department of Aeronautics and Astronautics, Massachusetts Institute of Technology, Cambridge, MA."},{"key":"230_CR30","series-title":"Recent advances and historical development of vector optimization","first-page":"222","volume-title":"Lecture notes in economics and mathematical systems","author":"P. Serafini","year":"1986","unstructured":"Serafini, P. (1986). Some considerations about computational complexity for multiobjective combinatorial problems. In Lecture notes in economics and mathematical systems : Vol. 294. Recent advances and historical development of vector optimization (pp. 222\u2013231). Berlin: Springer."},{"key":"230_CR31","series-title":"Evolutionary multi-criterion optimization (EMO 2003)","first-page":"416","volume-title":"Lecture notes in computer science","author":"E. G. Talbi","year":"2003","unstructured":"Talbi, E. G. (2003). A hybrid evolutionary approach for multicriteria optimization problems: application to the flow shop. In C. Fonseca, P. Fleming, E. Zitzler K. Deb & L. Thiele (Eds.), Lecture notes in computer science : Vol. 2632. Evolutionary multi-criterion optimization (EMO 2003) (pp. 416\u2013428). Berlin: Springer."},{"issue":"1","key":"230_CR32","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1287\/opre.35.1.70","volume":"35","author":"A. Warburton","year":"1987","unstructured":"Warburton, A. (1987). Approximation of Pareto optima in multi-objective shortest-path problems. Operations Research, 35(1), 70\u201379.","journal-title":"Operations Research"},{"key":"230_CR33","doi-asserted-by":"crossref","unstructured":"Zitzler, E., Deb, K., Thiele, L., Coello, C. A., & Corne, D. (Eds.). (2001). In Lecture notes in computer science: Vol. 1993. Evolutionary multi-criterion optimization (EMO 2001). Berlin: Springer.","DOI":"10.1007\/3-540-44719-9"},{"issue":"2","key":"230_CR34","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., & Fonseca, V. G. (2003). Performance assessment of multiobjective optimizers: an analysis and review. IEEE Transactions on Evolutionary Computation, 7(2), 117\u2013132.","journal-title":"IEEE Transactions on Evolutionary Computation"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-007-0230-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-007-0230-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-007-0230-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:07:42Z","timestamp":1559138862000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-007-0230-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,8,4]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,9,13]]}},"alternative-id":["230"],"URL":"https:\/\/doi.org\/10.1007\/s10479-007-0230-0","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,8,4]]}}}