{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T20:38:07Z","timestamp":1760647087818,"version":"3.37.3"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,10,10]],"date-time":"2019-10-10T00:00:00Z","timestamp":1570665600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,10,10]],"date-time":"2019-10-10T00:00:00Z","timestamp":1570665600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002322","name":"CAPES","doi-asserted-by":"crossref","award":["001"],"award-info":[{"award-number":["001"]}],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003593","name":"CNPq","doi-asserted-by":"crossref","award":["303144\/2014-9","303736\/2018-6"],"award-info":[{"award-number":["303144\/2014-9","303736\/2018-6"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001807","name":"FAPESP","doi-asserted-by":"crossref","award":["2018\/15417-8"],"award-info":[{"award-number":["2018\/15417-8"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003593","name":"CNPq","doi-asserted-by":"crossref","award":["423694\/2018-9"],"award-info":[{"award-number":["423694\/2018-9"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s40314-019-0976-4","type":"journal-article","created":{"date-parts":[[2019,10,10]],"date-time":"2019-10-10T10:26:50Z","timestamp":1570703210000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["The multicommodity traveling salesman problem with priority prizes: a mathematical model and metaheuristics"],"prefix":"10.1007","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0700-3445","authenticated-orcid":false,"given":"Tiago Tiburcio","family":"da Silva","sequence":"first","affiliation":[]},{"given":"Ant\u00f4nio Augusto","family":"Chaves","sequence":"additional","affiliation":[]},{"given":"Horacio Hideki","family":"Yanasse","sequence":"additional","affiliation":[]},{"given":"Henrique Pacca Loureiro","family":"Luna","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,10,10]]},"reference":[{"key":"976_CR1","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1287\/mnsc.18.6.B279","volume":"18","author":"RD Angel","year":"1972","unstructured":"Angel RD, Caudle WL, Noonan R, Whinston A (1972) Computer assisted school bus scheduling. Manag Sci 18:279\u201388","journal-title":"Manag Sci"},{"key":"976_CR2","volume-title":"The traveling salesman problem: a computational study","author":"DL Applegate","year":"2006","unstructured":"Applegate DL, Bixby RE, Chvatal V, Cook WJ (2006) The traveling salesman problem: a computational study. Princeton University Press, Princeton"},{"key":"976_CR3","doi-asserted-by":"crossref","unstructured":"Archetti C, Speranza MG, Vigo D (2014) Vehicle routing problems with profits. In: Toth P, Vigo D (eds) Vehicle routing: problems, methods, and applications, 2nd edn, MOS-SIAM Series on optimization","DOI":"10.1137\/1.9781611973594.ch10"},{"key":"976_CR4","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1002\/net.3230190602","volume":"19","author":"E Balas","year":"1987","unstructured":"Balas E (1987) The prize collecting travelling salesman problem. Networks 19:621\u2013636","journal-title":"Networks"},{"key":"976_CR5","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"JC Bean","year":"1994","unstructured":"Bean JC (1994) Genetic algorithms and random keys for sequencing and optimization. ORSA J Comput 6:154\u2013160","journal-title":"ORSA J Comput"},{"key":"976_CR6","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1016\/j.cor.2015.10.009","volume":"67","author":"AA Chaves","year":"2016","unstructured":"Chaves AA, Lorena LAN, Senne ELF, Resende MGC (2016) Hybrid method with CS and BRKGA applied to the minimization of tool switches problem. Comput Oper Res 67:174\u2013183","journal-title":"Comput Oper Res"},{"key":"976_CR7","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.cie.2018.07.031","volume":"124","author":"AA Chaves","year":"2018","unstructured":"Chaves AA, Gon\u00e7alves JF, Lorena LAN (2018) Adaptive biased random-key genetic algorithm with local search for the capacitated centered clustering problem. Comput Ind Eng 124:331\u2013346","journal-title":"Comput Ind Eng"},{"key":"976_CR8","first-page":"393","volume":"2","author":"R Dantzig","year":"1954","unstructured":"Dantzig R, Fulkerson R, Johnson S (1954) Solution of a large-scale traveling salesman problem. Oper Res 2:393\u2013410","journal-title":"Oper Res"},{"issue":"1","key":"976_CR9","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1287\/opre.4.1.61","volume":"4","author":"MM Flood","year":"1956","unstructured":"Flood MM (1956) The traveling-salesman problem. Oper Res 4(1):61\u201375","journal-title":"Oper Res"},{"issue":"1","key":"976_CR10","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1214\/aoms\/1177731944","volume":"11","author":"M Friedman","year":"1940","unstructured":"Friedman M (1940) A comparison of alternative tests of significance for the problem of m rankings. Ann Math Stat 11(1):86\u201392","journal-title":"Ann Math Stat"},{"issue":"5","key":"976_CR11","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F Glover","year":"1986","unstructured":"Glover F (1986) Future paths for integer programming and links to artificial intelligence. Comput Oper Res 13(5):533\u2013549","journal-title":"Comput Oper Res"},{"key":"976_CR12","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s10732-010-9143-1","volume":"17","author":"J Gon\u00e7alves","year":"2011","unstructured":"Gon\u00e7alves J, Resende M (2011) Biased random-key genetic algorithms for combinatorial optimization. J Heuristics 17:487\u2013525","journal-title":"J Heuristics"},{"key":"976_CR13","doi-asserted-by":"crossref","unstructured":"Gon\u00e7alves JF, Resende MGC (2016) Random-key genetic algorithms. Springer International Publishing, Handbook of Heuristics, Ch. 1, pp 1\u201313","DOI":"10.1007\/978-3-319-07153-4_30-1"},{"issue":"1","key":"976_CR14","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BF01415960","volume":"35","author":"M Grotschel","year":"1991","unstructured":"Grotschel M, Junger M, Reinelt G (1991) Optimal control of plotting and drilling machines: a case study. Math Methods Oper Res 35(1):61\u201384","journal-title":"Math Methods Oper Res"},{"key":"976_CR15","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","volume":"175","author":"P Hansen","year":"2010","unstructured":"Hansen P, Mladenovi\u0107 N, Moreno P\u00e9rez JA (2010) Variable neighbourhood search: methods and applications. Ann Oper Res 175:367\u2013407","journal-title":"Ann Oper Res"},{"key":"976_CR16","unstructured":"ILOG Using the CPLEX Callable Library, Copyright, ILOG (2006)"},{"issue":"11","key":"976_CR17","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0895-7177(93)90204-C","volume":"18","author":"L Ingber","year":"1993","unstructured":"Ingber L (1993) Simulated annealing: practice versus theory. Math Comput Model 18(11):29\u201357","journal-title":"Math Comput Model"},{"issue":"1","key":"976_CR18","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1057\/jors.1993.3","volume":"44","author":"Y-D Kim","year":"1993","unstructured":"Kim Y-D (1993) Heuristics for flowshop scheduling problems minimizing mean tardiness. J Oper Res Soc 44(1):19\u201328","journal-title":"J Oper Res Soc"},{"issue":"1","key":"976_CR19","doi-asserted-by":"publisher","first-page":"53","DOI":"10.2307\/1907742","volume":"25","author":"T Koopmans","year":"1957","unstructured":"Koopmans T, Beckmann MJ (1957) Assignment problems and the location of economic activities. Econometrica 25(1):53\u201376","journal-title":"Econometrica"},{"key":"976_CR20","volume-title":"The traveling salesman problem: a guided tour of combinatorial optimization","author":"EL Lawler","year":"1985","unstructured":"Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB (1985) The traveling salesman problem: a guided tour of combinatorial optimization. Wiley, New York"},{"key":"976_CR21","doi-asserted-by":"crossref","unstructured":"Louren\u00e7o HR, Martin O, St\u00fctzle T (2003) Iterated local search. In: Glover F, Kochenberger G (eds) Handbook of metaheuristics. Kluwer Academic Publishers, International Series in Operations Research & Management Science, pp 321\u2013353","DOI":"10.1007\/0-306-48056-5_11"},{"issue":"3","key":"976_CR22","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1016\/j.orl.2017.02.007","volume":"45","author":"L Lozano","year":"2017","unstructured":"Lozano L, Smith JC, Kurz ME (2017) Solving the traveling salesman problem with interdiction and fortification. Oper Res Lett 45(3):210\u2013216","journal-title":"Oper Res Lett"},{"key":"976_CR23","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.omega.2017.01.005","volume":"74","author":"E Malaguti","year":"2018","unstructured":"Malaguti E, Martello S, Santini A (2018) The traveling salesman problem with pickups, deliveries, and draft limits. Omega 74:50\u201358","journal-title":"Omega"},{"key":"976_CR24","doi-asserted-by":"crossref","unstructured":"Prasetyo H, Fauza G, Amer Y, Lee SH (2015) Survey on applications of biased-random key genetic algorithms for solving optimization problems. In: International conference on industrial engineering and engineering management (IEEM), pp 863\u2013870","DOI":"10.1109\/IEEM.2015.7385771"},{"issue":"3","key":"976_CR25","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1590\/0101-7438.2018.038.03.0499","volume":"38","author":"V Pureza","year":"2018","unstructured":"Pureza V, Morabito R, Luna HP (2018) Modeling and solving the traveling salesman problem with priority prizes. Pesqui Oper 38(3):499\u2013522","journal-title":"Pesqui Oper"},{"issue":"3","key":"976_CR26","first-page":"036106-1","volume":"76","author":"UN Raghavan","year":"2007","unstructured":"Raghavan UN, Albert R, Kumara S (2007) Near linear time algorithm to detect community structures in large-scale networks. Phys Rev E APS 76(3):036106-1\u2013036106-11","journal-title":"Phys Rev E APS"},{"issue":"3","key":"976_CR27","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1287\/opre.31.3.507","volume":"31","author":"HD Ratliff","year":"1983","unstructured":"Ratliff HD, Rosenthal AS (1983) Order-picking in a rectangular warehouse: a solvable case for the traveling salesman problem. Oper Res 31(3):507\u2013521","journal-title":"Oper Res"},{"issue":"1","key":"976_CR28","first-page":"59","volume":"42","author":"JL Rodgers","year":"1988","unstructured":"Rodgers JL, Nicewander WA (1988) Thirteen ways to look at the correlation coefficient. Am Stat Taylor Francis 42(1):59\u201366","journal-title":"Am Stat Taylor Francis"},{"key":"976_CR29","unstructured":"Sarubbi JFM (2003) Um modelo linear para o problema do caixeiro viajante com demandas heterog\u00eaneas. Dissertation, Federal University of Minas Gerais"},{"key":"976_CR30","unstructured":"Sarubbi JFM (2008) Problemas de Roteamento com Custos de Carga. Ph.D Thesis, Federal University of Minas Gerais"},{"key":"976_CR31","doi-asserted-by":"crossref","unstructured":"Sarubbi JFM, Luna HPL (2007) The multicommodity traveling salesman problem. In: INOC\u2013internacional network optimization conference, Belgian","DOI":"10.1109\/ICHIS.2007.4344037"},{"key":"976_CR32","unstructured":"Sarubbi JFM, Mateus GR, Luna HP, Miranda GD (2007) Model and algorithms for the multicommodity traveling salesman problem. In: 7th international conference on hybrid intelligent systems, Germany, pp 113\u2013119"},{"key":"976_CR33","unstructured":"Sarubbi JFM, Miranda G, Luna HPL, Mateus G (2008) A cut-and-branch algorithm for the multicommodity traveling salesman problem. In: 2008 IEEE international conference on service operations and logistics and informatics, Beijing. Service operations and logistics and informatics, vol 2, pp 1806\u20131811"},{"key":"976_CR34","unstructured":"Silva AA (2017) Abordagens de Otimiza\u00e7\u00e3o para apoiar a Elabora\u00e7\u00e3o e An\u00e1lise de Roteiros Tur\u00edsticos. Ph.D Thesis, Federal University of S\u00e3o Carlos"},{"issue":"1","key":"976_CR35","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/j.eswa.2018.06.045","volume":"112","author":"AA Silva","year":"2018","unstructured":"Silva AA, Morabito R, Pureza V (2018) Optimization approaches to support the planning and analysis of travel itineraries. Expert Syst Appl 112(1):321\u2013330","journal-title":"Expert Syst Appl"},{"key":"976_CR36","unstructured":"Spears WM, Jong KAD (1991) On the virtues of parameterized uniform crossover. In: Proceedings of the fourth international conference on genetic algorithms. Morgan Kaufman, San Mateo, pp 230\u2013236"},{"key":"976_CR37","unstructured":"TSPLib Homepage. \n                    https:\/\/www.iwr.uni-heidelberg.de\/groups\/comopt\/software\/TSPLIB95\/\n                    \n                  . Accessed 7 Jan 2019"},{"key":"976_CR38","unstructured":"TSP Test Data Homepage, \n                    http:\/\/www.math.uwaterloo.ca\/tsp\/data\/index.html\n                    \n                  . Accessed 7 Jan 2019"},{"issue":"6","key":"976_CR39","doi-asserted-by":"publisher","first-page":"80","DOI":"10.2307\/3001968","volume":"1","author":"F Wilcoxon","year":"1945","unstructured":"Wilcoxon F (1945) Individual comparisons by ranking methods. Biom Bull 1(6):80\u201383","journal-title":"Biom Bull"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-019-0976-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s40314-019-0976-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-019-0976-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,8]],"date-time":"2020-10-08T23:16:34Z","timestamp":1602198994000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s40314-019-0976-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,10]]},"references-count":39,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["976"],"URL":"https:\/\/doi.org\/10.1007\/s40314-019-0976-4","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"type":"print","value":"2238-3603"},{"type":"electronic","value":"1807-0302"}],"subject":[],"published":{"date-parts":[[2019,10,10]]},"assertion":[{"value":"4 February 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 May 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 September 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 October 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"188"}}