{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:15:03Z","timestamp":1761621303584,"version":"3.37.3"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2017,2,21]],"date-time":"2017-02-21T00:00:00Z","timestamp":1487635200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Polish National Science Center","award":["UMO-2013\/11\/B\/ST6\/01075"],"award-info":[{"award-number":["UMO-2013\/11\/B\/ST6\/01075"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1007\/s10479-017-2415-5","type":"journal-article","created":{"date-parts":[[2017,2,21]],"date-time":"2017-02-21T01:53:39Z","timestamp":1487642019000},"page":"111-130","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Proper balance between search towards and along Pareto front: biobjective TSP case study"],"prefix":"10.1007","volume":"254","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8337-888X","authenticated-orcid":false,"given":"Andrzej","family":"Jaszkiewicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thibaut","family":"Lust","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,2,21]]},"reference":[{"key":"2415_CR1","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1287\/mnsc.25.1.73","volume":"25","author":"Y Aneja","year":"1979","unstructured":"Aneja, Y., & Nair, K. (1979). Bicriteria transportation problem. Management Science, 25, 73\u201378.","journal-title":"Management Science"},{"key":"2415_CR2","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/978-3-642-17144-4_6","volume-title":"Metaheuristics for multiobjective optimisation. Lecture notes in economics and mathematical systems","author":"E Angel","year":"2004","unstructured":"Angel, E., Bampis, E., & Gourv\u00e8s, L. (2004). A dynasearch neighborhood for the bicriteria traveling salesman problem. In X. Gandibleux, M. Sevaux, K. S\u00f6rensen, & V. T\u2019kindt (Eds.), Metaheuristics for multiobjective optimisation. Lecture notes in economics and mathematical systems (Vol. 535, pp. 153\u2013176). Berlin: Springer."},{"key":"2415_CR3","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1287\/ijoc.15.1.82.15157","volume":"15","author":"D Applegate","year":"2003","unstructured":"Applegate, D. (2003). Chained Lin\u2013Kernighan for large traveling salesman problems. INFORMS Journal on Computing, 15, 82\u201392.","journal-title":"INFORMS Journal on Computing"},{"key":"2415_CR4","volume-title":"Reactive search and intelligent optimization, operations research\/Computer science interfaces","author":"R Battiti","year":"2008","unstructured":"Battiti, R., Brunato, M., & Mascia, F. (2008). Reactive search and intelligent optimization, operations research\/Computer science interfaces. Berlin: Springer. (ISBN 978-0-387-096 23-0)."},{"key":"2415_CR5","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/s10710-005-6164-x","volume":"6","author":"CAC Coello","year":"2005","unstructured":"Coello, C. A. C., & Cort\u00e9s, N. C. (2005). Solving multiobjective optimization problems using an artificial immune system. Genetic Programming and Evolvable Machines, 6, 163\u2013190.","journal-title":"Genetic Programming and Evolvable Machines"},{"key":"2415_CR6","doi-asserted-by":"crossref","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. (1998). Pareto simulated annealing\u2014A metaheuristic technique for multiple-objective combinatorial optimization. Journal of Multi-Criteria Decision Analysis, 7, 34\u201347.","journal-title":"Journal of Multi-Criteria Decision Analysis"},{"key":"2415_CR7","unstructured":"Deb, K., Agrawal, S., Pratab, A., & Meyarivan, T. (2000). A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. In Proceedings of the parallel problem solving from nature VI conference. Lecture notes in computer science no. 1917 (pp. 849\u2013858). Paris, France: Springer."},{"key":"2415_CR8","volume-title":"Multicriteria optimization","author":"M Ehrgott","year":"2005","unstructured":"Ehrgott, M. (2005). Multicriteria optimization (2nd ed.). Berlin: Springer.","edition":"2"},{"key":"2415_CR9","doi-asserted-by":"crossref","first-page":"2674","DOI":"10.1016\/j.cor.2005.10.003","volume":"34","author":"M Ehrgott","year":"2007","unstructured":"Ehrgott, M., & Gandibleux, X. (2007). Bound sets for biobjective combinatorial optimization problems. Computers & Operations Research, 34, 2674\u20132694.","journal-title":"Computers & Operations Research"},{"key":"2415_CR10","volume-title":"Mathematical statistics, a decision theoretic approach","author":"T Ferguson","year":"1967","unstructured":"Ferguson, T. (1967). Mathematical statistics, a decision theoretic approach. New York: Academic Press."},{"key":"2415_CR11","volume-title":"Evaluating the quality of approximations to the non-dominated set","author":"MP Hansen","year":"1998","unstructured":"Hansen, M. P., & Jaszkiewicz, A. (1998). Evaluating the quality of approximations to the non-dominated set. Lyngby: IMM, Department of Mathematical Modelling, Technical University of Denmark."},{"key":"2415_CR12","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1109\/TEVC.2002.802873","volume":"6","author":"A Jaszkiewicz","year":"2002","unstructured":"Jaszkiewicz, A. (2002). On the performance of multiple-objective genetic local search on the 0\/1 knapsack problem\u2014A comparative experiment. IEEE Transactions on Evolutionary Computation, 6, 402\u2013412.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"2415_CR13","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1023\/B:ANOR.0000039516.50069.5b","volume":"131","author":"A Jaszkiewicz","year":"2004","unstructured":"Jaszkiewicz, A. (2004). A comparative study of multiple-objective metaheuristics on the bi-objective set covering problem and the Pareto memetic algorithm. Annals of Operations Research, 131, 135\u2013158.","journal-title":"Annals of Operations Research"},{"key":"2415_CR14","doi-asserted-by":"crossref","first-page":"885","DOI":"10.1016\/j.ejor.2007.10.054","volume":"193","author":"A Jaszkiewicz","year":"2009","unstructured":"Jaszkiewicz, A., & Zielniewicz, P. (2009). Pareto memetic algorithm with path-relinking for biobjective traveling salesman problem. European Journal of Operational Research, 193, 885\u2013890.","journal-title":"European Journal of Operational Research"},{"key":"2415_CR15","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF02098290","volume":"61","author":"G Laporte","year":"1995","unstructured":"Laporte, G., & Osman, I. (1995). Routing problems: A bibliography. Annals of Operations Research, 61, 227\u2013262.","journal-title":"Annals of Operations Research"},{"key":"2415_CR16","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1109\/TEVC.2009.2024143","volume":"14","author":"A Lara","year":"2010","unstructured":"Lara, A., Sanchez, G., Coello, C. C., & Schutze, O. (2010). HCS: A new local search strategy for memetic multiobjective evolutionary algorithms. IEEE Transactions on Evolutionary Computation, 14, 112\u2013132.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"2415_CR17","doi-asserted-by":"crossref","first-page":"1808","DOI":"10.1109\/TCYB.2013.2295886","volume":"44","author":"K Liangjun","year":"2014","unstructured":"Liangjun, K., Qingfu, Z., & Battiti, R. (2014). Hybridization of decomposition and local search for multiobjective optimization. IEEE Transactions on Cybernetics, 44, 1808\u20131820.","journal-title":"IEEE Transactions on Cybernetics"},{"key":"2415_CR18","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin, S., & Kernighan, B. (1973). An effective heuristic algorithm for the traveling-salesman problem. Operations Research, 21, 498\u2013516.","journal-title":"Operations Research"},{"key":"2415_CR19","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1016\/j.cor.2009.01.005","volume":"37","author":"T Lust","year":"2010","unstructured":"Lust, T., & Jaszkiewicz, A. (2010). Speed-up techniques for solving large-scale biobjective TSP. Computers & Operations Research, 37, 521\u2013533.","journal-title":"Computers & Operations Research"},{"key":"2415_CR20","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1007\/s10732-009-9103-9","volume":"16","author":"T Lust","year":"2010","unstructured":"Lust, T., & Teghem, J. (2010). Two-phase Pareto local search for the biobjective traveling salesman problem. Journal of Heuristics, 16, 475\u2013510.","journal-title":"Journal of Heuristics"},{"key":"2415_CR21","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1111\/j.1475-3995.2011.00840.x","volume":"19","author":"T Lust","year":"2012","unstructured":"Lust, T., & Teghem, J. (2012). The multiobjective multidimensional knapsack problem: A survey and a new approach. International Transactions in Operational Research, 19, 495\u2013520.","journal-title":"International Transactions in Operational Research"},{"key":"2415_CR22","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s10732-013-9236-8","volume":"20","author":"T Lust","year":"2014","unstructured":"Lust, T., & Tuyttens, D. (2014). Variable and large neighborhood search to solve the multiobjective set covering problem. Journal of Heuristics, 20, 165\u2013188.","journal-title":"Journal of Heuristics"},{"key":"2415_CR23","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/s10479-007-0230-0","volume":"156","author":"L Paquete","year":"2007","unstructured":"Paquete, L., Schiavinotto, T., & St\u00fctzle, T. (2007). On local optima in multiobjective combinatorial optimization problems. Annals of Operations Research, 156, 83\u201397.","journal-title":"Annals of Operations Research"},{"key":"2415_CR24","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., & Stutzle, T. (2006). A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices. European Journal of Operational Research, 169, 943\u2013959.","journal-title":"European Journal of Operational Research"},{"key":"2415_CR25","volume-title":"Multiple criteria optimization: Theory, computation and applications","author":"R Steuer","year":"1986","unstructured":"Steuer, R. (1986). Multiple criteria optimization: Theory, computation and applications. New York: Wiley."},{"key":"2415_CR26","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1002\/(SICI)1099-1360(199907)8:4<221::AID-MCDA247>3.0.CO;2-O","volume":"8","author":"E Ulungu","year":"1999","unstructured":"Ulungu, E., Teghem, J., Fortemps, P., & Tuyttens, D. (1999). MOSA method: A tool for solving multiobjective combinatorial optimization problems. Journal of Multi-Criteria Decision Analysis, 8, 221\u2013236.","journal-title":"Journal of Multi-Criteria Decision Analysis"},{"key":"2415_CR27","unstructured":"Zitzler, E. (1999). Evolutionary algorithms for multiobjective optimization: Methods and applications. Ph.D. thesis, Zurich: Swiss Federal Institute of Technology (ETH)."},{"key":"2415_CR28","unstructured":"Zitzler, E., Laumanns, M., Thiele, L., Fonseca, C., & Grunert da Fonseca, V. (2002). Why quality assessment of multiobjective optimizers is difficult. In W. Langdon, E. Cant\u00fa-Paz, K. Mathias, R. Roy, D. Davis, R. Poli, K. Balakrishnan, V. Honavar, G. Rudolph, J. Wegener, L. Bull, M. Potter, A. Schultz, J. Miller, E. Burke, & N. Jonoska (Eds.), Proceedings of the Genetic and Evolutionary Computation Conference (GECCO\u20192002) (pp. 666\u2013673). San Francisco: Morgan Kaufmann Publishers."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-017-2415-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2415-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2415-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,22]],"date-time":"2017-06-22T02:33:11Z","timestamp":1498098791000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-017-2415-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,21]]},"references-count":28,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["2415"],"URL":"https:\/\/doi.org\/10.1007\/s10479-017-2415-5","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2017,2,21]]}}}