{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,10]],"date-time":"2026-05-10T00:24:32Z","timestamp":1778372672310,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540206378","type":"print"},{"value":"9783642171444","type":"electronic"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-642-17144-4_7","type":"book-chapter","created":{"date-parts":[[2011,1,15]],"date-time":"2011-01-15T07:56:07Z","timestamp":1295078167000},"page":"177-199","source":"Crossref","is-referenced-by-count":129,"title":["Pareto Local Optimum Sets in the Biobjective Traveling Salesman Problem: An Experimental Study"],"prefix":"10.1007","author":[{"given":"Luis","family":"Paquete","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Chiarandini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"St\u00fctzle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"7_CR1","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1287\/ijoc.4.4.387","volume":"4","author":"J.L. Bentley","year":"1992","unstructured":"J.L. Bentley. Fast algorithms for geometric traveling salesman problems. ORSA Journal on Computing,4(4):387\u2013411, 1992.","journal-title":"ORSA Journal on Computing"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"P.C. Borges and P. H. Hansen. A study of global convexity for a multiple objective travelling salesman problem. In C.C. Ribeiro and P. Hansen, editors, Essays and Surveys in Metaheuristics, pages 129\u2013150. Kluwer, 2000.","DOI":"10.1007\/978-1-4615-1507-4_6"},{"key":"7_CR3","volume-title":"Practical Nonparametric Statistics","author":"J. Conover","year":"1980","unstructured":"J. Conover. Practical Nonparametric Statistics. John Wiley & Sons, New York, 1980."},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"G.A. Croes","year":"1958","unstructured":"G.A. Croes. A method for solving traveling salesman problems. Operations Research, 6:791\u2013812, 1958.","journal-title":"Operations Research"},{"key":"7_CR5","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":"P. Czyzak and A. Jaszkiewicz. Pareto simulated annealing \u2014 a metaheuristic technique for multiple objective combinatorial optimization. Journal of Multi-Criteria Decision Analysis, 7:34\u201347, 1998.","journal-title":"Journal of Multi-Criteria Decision Analysis"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"V. G. da Fonseca, C. Fonseca, and A. Hall. Inferential performance assessment of stochastic optimisers and the attainment function. In E. Zitzler, K. Deb, L. Thiele, C. A. Coello Coello, and D. Corne, editors, Evolutionary Multi-Criterion Optimization (EMO 2001), Lecture Notes in Computer Science 1993, pages 213\u2013225. Springer Verlag, 2001.","DOI":"10.1007\/3-540-44719-9_15"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1111\/j.1475-3995.2000.tb00182.x","volume":"7","author":"M. Ehrgott","year":"2000","unstructured":"M. Ehrgott. Approximation algorithms for combinatorial multicriteria problems. International Transactions in Operations Research, 7:5\u201331, 2000.","journal-title":"International Transactions in Operations Research"},{"issue":"5","key":"7_CR8","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1515\/dma.1992.2.5.461","volume":"2","author":"V.A. Emelichev","year":"1992","unstructured":"V.A. Emelichev and V.A. Perepelitsa. On the cardinality of the set of alternatives in discrete many-criterion problems. Discrete Mathematics and Applications, 2(5):461\u2013471, 1992.","journal-title":"Discrete Mathematics and Applications"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1287\/opre.4.1.61","volume":"4","author":"M.M. Flood","year":"1956","unstructured":"M.M. Flood. The travelling salesman problem. Operations Research, 4:61\u201375, 1956.","journal-title":"Operations Research"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"C. Fonseca and P. Fleming. On the performance assessment and comparison of stochastic multiobjective optimizers. In W. Ebeling, I. Rechenberg, H.-P. Schwefel, and H.-M. Voigt, editors, Proceedings of the 4th Conference on Parallel Problem Solving from Nature (PPSN IV), Lecture Notes in Computer Science 1141, pages 584\u2013593. Springer Verlag, 1996.","DOI":"10.1007\/3-540-61723-X_1022"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1023\/A:1009682532542","volume":"6","author":"X. Gandibleux","year":"2000","unstructured":"X. Gandibleux and A. Freville. Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: the two objectives case. Journal of Heuristics, 6:361\u2013383, 2000.","journal-title":"Journal of Heuristics"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"P. Good. Permutation Tests: A Practical Guide to Resampling Methods for Testing Hypotheses. Springer-Verlag, Berlin, Germany, 1994.","DOI":"10.1007\/978-1-4757-2346-5_3"},{"key":"7_CR13","unstructured":"M.P. Hansen. Tabu search for multiobjective optimization: MOTS. In Proceedings of MCDM\u203297, Cape Town, South Africa, January 1997."},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1023\/A:1009690717521","volume":"6","author":"M.P. Hansen","year":"2000","unstructured":"M.P. Hansen. Use of subsitute scalarizing functions to guide a local search base heuristics: the case of moTSP. Journal of Heuristics, 6:419\u2013431, 2000. 198","journal-title":"Journal of Heuristics"},{"key":"7_CR15","volume-title":"Technical Report IMM-REP-1998-7","author":"M.P. Hansen","year":"1998","unstructured":"M.P. Hansen and A. Jaszkiewicz. 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":"7_CR16","first-page":"65","volume":"6","author":"S. Holm","year":"1979","unstructured":"S. Holm. A simple sequentially rejective multiple test procedure. Scandinavian Journal of Statistics, 6:65\u201370, 1979.","journal-title":"Scandinavian Journal of Statistics"},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1287\/opre.42.2.201","volume":"42","author":"J.N. Hooker","year":"1994","unstructured":"J.N. Hooker. Needed: an empirical science of algorithms. Operations Research, 42:201\u2013212, 1994.","journal-title":"Operations Research"},{"key":"7_CR18","first-page":"238","volume-title":"Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence (UAI-98)","author":"H.H. Hoos","year":"1998","unstructured":"H.H. Hoos and T. St\u00fctzle. Evaluating Las Vegas algorithms \u2014 pitfalls and remedies. In G. F. Cooper and S. Moral, editors, Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence (UAI-98), pages 238\u2013245. Morgan Kaufmann, San Francisco,USA, 1998."},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"J. Hsu. Multiple Comparisons \u2014 Theory and Methods. Chapman & Hall\/CR, 1996.","DOI":"10.1201\/b15074"},{"issue":"137","key":"7_CR20","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/S0377-2217(01)00104-7","volume":"l","author":"A. Jaszkiewicz","year":"2002","unstructured":"A. Jaszkiewicz. Genetic local search for multiple objective combinatorial optimization. European Journal of Operational Research, l(137):50\u201371, 2002.","journal-title":"European Journal of Operational Research"},{"key":"7_CR21","first-page":"215","volume-title":"Local Search in Combinatorial Optimization","author":"D. S. Johnson","year":"1997","unstructured":"D. S. Johnson and L. A. McGeoch. The travelling salesman problem: A case study in local optimization. In E.H.L. Aarts and J.K. Lenstra, editors, Local Search in Combinatorial Optimization, pages 215\u2013310. John Wiley & Sons, Chichester, UK, 1997."},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"D. S. Johnson and L. A. McGeoch. Experimental analysis of heuristics for the STSP. In G. Gutin and A. Punnen, editors, The Traveling Salesman Problem and its Variations, pages 369\u2013443. Kluwer Academic Publishers, 2002.","DOI":"10.1007\/0-306-48213-4_9"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"J. Knowles and D. Corne. The pareto archived evolution strategy: A new baseline algorithm for pareto multiobjective optimization. In Peter J. Angeline, Zbyszek Michalewicz, Marc Schoenauer, Xin Yao, and Ali Zalzala, editors, Proceedings of the Congress on Evolutionary Computation (CEC 99), pages 98\u2013105, 1999.","DOI":"10.1109\/CEC.1999.781913"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"M. Laumanns, L. Thiele, E. Zitzler, E. Welsi, and K. Deb. Running time analysis of Multiobjective evolutionary algorithms on a simple discrete optimization problem. In J.J. Merelo Guervos, P. Adamidis, H.-G. Beyer, J.-L. Fernandez-Villacanas, and H.-P. Schwefel, editors, Proceedings of the 7th Conference on Parallel Problem Solving from Nature (PPSN VI), Lecture Notes in Computer Science 2439, pages 44\u201353. Springer Verlag, 2002.","DOI":"10.1007\/3-540-45712-7_5"},{"key":"7_CR25","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S. Lin","year":"1965","unstructured":"S. Lin. Computer solutions for the traveling salesman problem. Bell Systems Technology Journal, 44:2245\u20132269, 1965.","journal-title":"Bell Systems Technology Journal"},{"key":"7_CR26","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S. Lin","year":"1973","unstructured":"S. Lin and B. Kernighan. An effective heuristic algorithm for the traveling salesman problem. Operations Research, 21:498\u2013516, 1973.","journal-title":"Operations Research"},{"key":"7_CR27","unstructured":"H. R. Louren\u00e7o O. Martin and T. St\u00fctzle. Iterated local search. In F. Glover and G. Kochenberger editors Handbook of Metaheuristics volume 57 of International Series in Operations Research & Management Science pages 321\u2013353. Kluwer Academic Publishers Norwell MA 2002"},{"key":"7_CR28","unstructured":"L. Paquete and C. Fonseca. A study of examination timetabling with multiobjective evolutionary algorithms. In Proceedings of the 4th Metaheuristics International Conference (MIC 2001), pages 149\u2013154, Porto, 2001."},{"key":"7_CR29","doi-asserted-by":"crossref","unstructured":"L. Paquete and T. Stiitzle. A two-phase local search for the biobjective traveling salesman problem. In C. M. Fonseca, P.J. Fleming, E. Zitzler, K. Deb, and L. Thiele, editors, Evolutionary Multi-criterion Optimization (EMO 2003), Lecture Notes in Coputer Science 2632. Springer Verlag, 2003. 479\u2013493.","DOI":"10.1007\/3-540-36970-8_34"},{"key":"7_CR30","unstructured":"G. Reinelt. The Traveling Salesman Problern: Computational Solutions for TSP applications.Lectures Notes in Computer Science 840. Springer Verlag, 1994."},{"key":"7_CR31","doi-asserted-by":"crossref","unstructured":"K. Shaw, C. Fonseca, A. Nortcliffe, M. Thompson, J. Love, and P. Fleming. Assessing the performance of multiobjetive genetic algorithms for optimization of a batch process scheduling problem. In Peter J. Angeline, Zbyszek Michalewicz, Marc Schoenauer, Xin Yao, and Ali Zalzala, editors, Proceedings of the Congress on Evolutionary Computation (CEC 99), pages 37\u201345, 1999.","DOI":"10.1109\/CEC.1999.781905"},{"key":"7_CR32","doi-asserted-by":"crossref","unstructured":"E. Talbi, M. Rahoual, M. Mabed, and C. Dhaenens. A hybrid evolutionary approach for multicriteria optimization problems: Application to the flow shop. In E. Zitzler, K. Deb, L, Thiele, C. A. Coello, and D. Come, editors, Evolutionary Multi-Criterion Optimization (EMO 2001), Lecture Notes in Computer Science 1993, pages 416\u2013428. Springer Verlag, 2001.","DOI":"10.1007\/3-540-44719-9_29"},{"issue":"3","key":"7_CR33","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"4","author":"E. Zitzler","year":"1999","unstructured":"E. Zitzler and L. Thiele. Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Transactions on Evolutionary Computation, 4(3):257\u2013271, 1999.","journal-title":"IEEE Transactions on Evolutionary Computation"}],"container-title":["Lecture Notes in Economics and Mathematical Systems","Metaheuristics for Multiobjective Optimisation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17144-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T20:36:47Z","timestamp":1740861407000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17144-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540206378","9783642171444"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17144-4_7","relation":{},"ISSN":["0075-8442"],"issn-type":[{"value":"0075-8442","type":"print"}],"subject":[],"published":{"date-parts":[[2004]]}}}