{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T08:43:06Z","timestamp":1774687386938,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,2,23]],"date-time":"2008-02-23T00:00:00Z","timestamp":1203724800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Math Model Algor"],"published-print":{"date-parts":[[2008,6]]},"DOI":"10.1007\/s10852-008-9080-2","type":"journal-article","created":{"date-parts":[[2008,2,22]],"date-time":"2008-02-22T13:06:02Z","timestamp":1203685562000},"page":"177-195","source":"Crossref","is-referenced-by-count":50,"title":["Multi-objective Meta-heuristics for the Traveling Salesman Problem with Profits"],"prefix":"10.1007","volume":"7","author":[{"given":"Nicolas","family":"Jozefowiez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fred","family":"Glover","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"Laguna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,2,23]]},"reference":[{"key":"9080_CR1","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1137\/S009753979528826X","volume":"28","author":"B. Awerbuch","year":"1998","unstructured":"Awerbuch, B., Azar, Y., Blum, A., Vempala, S.: New approximation guarantees for minimum-weight k-trees and prize-collection salesmen. SIAM J. Comput. 28, 254\u2013262 (1998)","journal-title":"SIAM J. Comput."},{"key":"9080_CR2","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1002\/net.3230190602","volume":"19","author":"E. Balas","year":"1989","unstructured":"Balas, E.: The prize-collecting traveling salesman problem. Networks 19, 621\u2013636 (1989)","journal-title":"Networks"},{"key":"9080_CR3","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BF02568585","volume":"3","author":"B. Boffey","year":"1995","unstructured":"Boffey, B.: Multiobjective routing problems. Top 3, 167\u2013220 (1995)","journal-title":"Top"},{"key":"9080_CR4","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K. Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarvan, T.: A fast and elitist multiobjective genetic algorithm: NSGA II. IEEE Trans. Evolution. Comput. 6, 182\u2013197 (2002)","journal-title":"IEEE Trans. Evolution. Comput."},{"key":"9080_CR5","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1111\/j.1475-3995.1995.tb00023.x","volume":"2","author":"M. Dell\u2019Amico","year":"1995","unstructured":"Dell\u2019Amico, M., Maffioli, F., V\u00e4rbrand, P.: On prize-collecting tours and the asymmetric travelling salesman problem. Int. Trans. Oper. Res. 2, 297\u2013308 (1995)","journal-title":"Int. Trans. Oper. Res."},{"key":"9080_CR6","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/s002910000046","volume":"22","author":"M. Ehrgott","year":"2000","unstructured":"Ehrgott, M., Gandibleux, X.: A survey and annotated bibliography of multi-objective combinatorial optimization. OR Spektrum 22, 425\u2013460 (2000)","journal-title":"OR Spektrum"},{"key":"9080_CR7","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1287\/trsc.1030.0079","volume":"39","author":"D. Feillet","year":"2005","unstructured":"Feillet, D., Dejax, P., Gendreau, M.: Traveling salesman problems with profits. Trans. Sci. 39, 188\u2013205 (2005)","journal-title":"Trans. Sci."},{"key":"9080_CR8","doi-asserted-by":"crossref","first-page":"1086","DOI":"10.1287\/opre.40.6.1086","volume":"40","author":"M. Gendreau","year":"1992","unstructured":"Gendreau, M., Hertz, A., Laporte, G.: New insertion and postoptimization procedures for the traveling salesman problem. Oper. Res. 40, 1086\u20131094 (1992)","journal-title":"Oper. Res."},{"key":"9080_CR9","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1016\/S0377-2217(97)00289-0","volume":"106","author":"M. Gendreau","year":"1998","unstructured":"Gendreau, M., Laporte, G., Semet, F.: A tabu search heuristic for the undirected selective travelling salesman problem. Eur. J. Oper. Res. 106, 539\u2013545 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"9080_CR10","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","volume":"8","author":"F. Glover","year":"1977","unstructured":"Glover, F.: Heuristics for integer programming using surrogate constraints. Decis. Sci. 8, 156\u2013166 (1977)","journal-title":"Decis. Sci."},{"key":"9080_CR11","doi-asserted-by":"crossref","unstructured":"Glover, F.: New ejection chain and alternating path methods for the traveling salesman problems. Comput. Sci. Oper. Res. 449\u2013509 (1992)","DOI":"10.1016\/B978-0-08-040806-4.50037-X"},{"key":"9080_CR12","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0166-218X(94)90211-9","volume":"49","author":"F. Glover","year":"1994","unstructured":"Glover, F.: Tabu search for nonlinear and parametric optimization (with links to genetic algorithms). Discrete Appl. Math. 49, 231\u2013255 (1994)","journal-title":"Discrete Appl. Math."},{"key":"9080_CR13","unstructured":"Glover, F., Laguna, M.: Modern heuristic techniques for combinatorial problems. Chapt. Tabu search, pp. 71\u2013140. Blackwell Scientific Publishing (1993)"},{"key":"9080_CR14","doi-asserted-by":"crossref","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Press (1997)","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"9080_CR15","doi-asserted-by":"crossref","first-page":"515","DOI":"10.15807\/jorsj.31.515","volume":"31","author":"S. Kataoka","year":"1988","unstructured":"Kataoka, S., Morito, S.: An algorithm for the single constraint maximum collection problem. J. Oper. Res. Soc. Jpn. 31, 515\u2013530 (1988)","journal-title":"J. Oper. Res. Soc. Jpn."},{"key":"9080_CR16","unstructured":"Keller, C.P.: Multiobjective routing through space and time: the MVP and TDVRP problems. Ph.D. thesis, Department of Geography, University of Western Ontario. London, Ontario, Canada (1985)"},{"key":"9080_CR17","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1068\/b150447","volume":"15","author":"C.P. Keller","year":"1988","unstructured":"Keller, C.P., Goodchild, M.: The multiobjective vending problem: a generalization of the traveling salesman problem. Environ. Plann., B. Plann. Des. 15, 447\u2013460 (1988)","journal-title":"Environ. Plann., B. Plann. Des."},{"key":"9080_CR18","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0166-218X(90)90100-Q","volume":"26","author":"G. Laporte","year":"1990","unstructured":"Laporte, G., Martello, S.: The selective traveling salesman problem. Discrete Appl. Math. 26, 193\u2013207 (1990)","journal-title":"Discrete Appl. Math."},{"key":"9080_CR19","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1016\/S0377-2217(97)00288-9","volume":"106","author":"C. Rego","year":"1998","unstructured":"Rego, C.: Relaxed tours and path ejections for the traveling salesman problem. Eur. J. Oper. Res. 106, 522\u2013538 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"9080_CR20","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1137\/0206041","volume":"6","author":"D.J. Rosenkrantz","year":"1977","unstructured":"Rosenkrantz, D.J., Stearns, R.E., Lewis II, P.M.: An analysis of several heuristics for the traveling salesman problem. SIAM J. Comput. 6, 563\u2013581 (1977)","journal-title":"SIAM J. Comput."},{"key":"9080_CR21","unstructured":"Whitley, D., Starkweather, T., Fuquay, D.: Scheduling problems and traveling salesman: the genetic edge recombination operator. In: Schaffer J. (ed.) Proceedings of the Third International Conference on Genetic Algorithms, pp. 133\u2013140 (1989)"},{"key":"9080_CR22","unstructured":"Zitzler, E.: Evolutionary algorithm for multiobjective optimization: methods and applications. Ph.D. thesis, Swiss Federal Institute of Technology (ETH). Zurich, Switzerland (1999)"}],"container-title":["Journal of Mathematical Modelling and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-008-9080-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10852-008-9080-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-008-9080-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T02:26:30Z","timestamp":1559269590000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10852-008-9080-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,2,23]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,6]]}},"alternative-id":["9080"],"URL":"https:\/\/doi.org\/10.1007\/s10852-008-9080-2","relation":{},"ISSN":["1570-1166","1572-9214"],"issn-type":[{"value":"1570-1166","type":"print"},{"value":"1572-9214","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,2,23]]}}}