{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T06:15:26Z","timestamp":1726467326132},"reference-count":13,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Industrial Engineering"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1016\/j.cie.2019.06.050","type":"journal-article","created":{"date-parts":[[2019,6,28]],"date-time":"2019-06-28T03:37:14Z","timestamp":1561693034000},"page":"702-710","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"special_numbering":"C","title":["Maximizing the profit per unit time for the travelling salesman problem"],"prefix":"10.1016","volume":"135","author":[{"given":"Moshe","family":"Kaspi","sequence":"first","affiliation":[]},{"given":"Moshe","family":"Zofi","sequence":"additional","affiliation":[]},{"given":"Ron","family":"Teller","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"2006","series-title":"The travelling salesman problem","author":"Applegate","key":"10.1016\/j.cie.2019.06.050_b0005"},{"issue":"1\u20132","key":"10.1016\/j.cie.2019.06.050_b0010","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s10107-010-0364-8","article-title":"Approximating a class of combinatorial problems with rational objective function","volume":"124","author":"Correa","year":"2010","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.cie.2019.06.050_b0015","doi-asserted-by":"crossref","unstructured":"Dantzig, G. B, Blattner, W. D., and Rao, M. R. (1967) Finding a cycle in graph with minimum cost to time ratio with application to the ship routing problem; Theory of Graphs, Rosenstiehl, ed.","DOI":"10.21236\/AD0646553"},{"issue":"7","key":"10.1016\/j.cie.2019.06.050_b0020","doi-asserted-by":"crossref","first-page":"1700","DOI":"10.1016\/j.cor.2013.01.003","article-title":"Heuristics for the travelling repairman problem with profits","volume":"40","author":"Dewildea","year":"2013","journal-title":"Computers & Operations Research"},{"issue":"1","key":"10.1016\/j.cie.2019.06.050_b0025","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/4235.585892","article-title":"Ant colony system: A cooperative learning approach to the travelling salesman problem","volume":"1","author":"Dorigo","year":"1997","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"2","key":"10.1016\/j.cie.2019.06.050_b0030","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1287\/trsc.1030.0079","article-title":"Travelling salesman problems with profits","volume":"39","author":"Feillet","year":"2005","journal-title":"Transportation Science"},{"issue":"10","key":"10.1016\/j.cie.2019.06.050_b0035","doi-asserted-by":"crossref","first-page":"2418","DOI":"10.1016\/j.cor.2013.02.011","article-title":"Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits","volume":"40","author":"Filippi","year":"2013","journal-title":"Computers & Operations Research"},{"issue":"2","key":"10.1016\/j.cie.2019.06.050_b0040","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/j.ejor.2007.05.055","article-title":"Multi-objective vehicle routing problems","volume":"189","author":"Jozefowiez","year":"2008","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.cie.2019.06.050_b0045","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1023\/A:1006529012972","article-title":"Genetic algorithms for the travelling salesman problem: A review of representations and operators","volume":"13","author":"Larranaga","year":"1999","journal-title":"Artificial Intelligence Review"},{"key":"10.1016\/j.cie.2019.06.050_b0050","unstructured":"Lawler, E. L. (1967) Optimal cycles in doubly weighted linear graphs; Theory of Graphs, Rosenstiehl, ed."},{"issue":"4","key":"10.1016\/j.cie.2019.06.050_b0055","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1287\/moor.4.4.414","article-title":"Combinatorial optimization with rational objective functions","volume":"4","author":"Megiddo","year":"1979","journal-title":"Mathematics of Operations Research"},{"year":"1997","series-title":"Fractional programming: Theory, methods and applications","author":"Stancu-Minasian","key":"10.1016\/j.cie.2019.06.050_b0060"},{"issue":"10","key":"10.1016\/j.cie.2019.06.050_b0065","doi-asserted-by":"crossref","first-page":"1177","DOI":"10.1057\/s41274-016-0156-5","article-title":"Maximizing the profit per unit of time for the TSP with convex resource-dependent travelling times","volume":"68","author":"Zofi","year":"2017","journal-title":"Journal of the Operational Research Society (JORS)"}],"container-title":["Computers & Industrial Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0360835219303808?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0360835219303808?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T07:42:00Z","timestamp":1568101320000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0360835219303808"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9]]},"references-count":13,"alternative-id":["S0360835219303808"],"URL":"https:\/\/doi.org\/10.1016\/j.cie.2019.06.050","relation":{},"ISSN":["0360-8352"],"issn-type":[{"type":"print","value":"0360-8352"}],"subject":[],"published":{"date-parts":[[2019,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Maximizing the profit per unit time for the travelling salesman problem","name":"articletitle","label":"Article Title"},{"value":"Computers & Industrial Engineering","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cie.2019.06.050","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}]}}