{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T22:12:01Z","timestamp":1773699121350,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,5,25]],"date-time":"2020-05-25T00:00:00Z","timestamp":1590364800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,25]],"date-time":"2020-05-25T00:00:00Z","timestamp":1590364800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Chongqing Social Science Planning Project","award":["2016BS085"],"award-info":[{"award-number":["2016BS085"]}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["71702016"],"award-info":[{"award-number":["71702016"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Humanities and Social Science Research Project of Chongqing Education Commission","award":["17SKJ034"],"award-info":[{"award-number":["17SKJ034"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s10878-020-00585-1","type":"journal-article","created":{"date-parts":[[2020,5,25]],"date-time":"2020-05-25T20:03:07Z","timestamp":1590436987000},"page":"2143-2166","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Online traveling salesman problem with time cost and non-zealous server"],"prefix":"10.1007","volume":"44","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8169-2675","authenticated-orcid":false,"given":"Tengyu","family":"Wu","sequence":"first","affiliation":[]},{"given":"Lin","family":"He","sequence":"additional","affiliation":[]},{"given":"Haiyan","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,25]]},"reference":[{"issue":"2\u20133","key":"585_CR1","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.tcs.2008.08.003","volume":"408","author":"L Allulli","year":"2008","unstructured":"Allulli L, Ausiello G, Bonifaci V, Laura L (2008) On the power of lookahead in on-line server routing problems. Theor Comput Sci 408(2\u20133):116\u2013128","journal-title":"Theor Comput Sci"},{"issue":"6","key":"585_CR2","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.ipl.2008.03.002","volume":"107","author":"G Ausiello","year":"2008","unstructured":"Ausiello G, Bonifaci V, Laura L (2008) The online prize-collecting traveling salesman problem. Inf Process Lett 107(6):199\u2013204","journal-title":"Inf Process Lett"},{"issue":"2","key":"585_CR3","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1287\/ijoc.13.2.138.10517","volume":"13","author":"M Blom","year":"2001","unstructured":"Blom M, Krumke SO, De Paepe WE, Stougie L (2001) The online TSP against fair adversaries. INFORMS J Comput 13(2):138\u2013148","journal-title":"INFORMS J Comput"},{"issue":"1","key":"585_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.1070.0203","volume":"42","author":"AM Campbell","year":"2008","unstructured":"Campbell AM, Thomas BW (2008) Probabilistic traveling salesman problem with deadlines. Transp Sci 42(1):1\u201321","journal-title":"Transp Sci"},{"key":"585_CR5","doi-asserted-by":"publisher","first-page":"697C707","DOI":"10.1080\/07408170490447366","volume":"36","author":"K Charnsirisakskul","year":"2004","unstructured":"Charnsirisakskul K, Griffin PM, Keskinocak P (2004) Order selection and scheduling with leadtime flexibility. IEE Trans 36:697C707","journal-title":"IEE Trans"},{"key":"585_CR6","unstructured":"FedEx, (2005) Rules\/accessorial tariff via all motor routes naming Rules, Regulations and claims procedures applying on surface expedited services between points in North America (Except Mexico). http:\/\/customcritical.fedex.com\/us\/serviceinfo\/documents\/pdf\/tarifffdcc101g.pdf?link=4, accessed on April 11"},{"issue":"2\u20133","key":"585_CR7","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/j.tcs.2006.05.017","volume":"361","author":"S Guti\u00e9rrez","year":"2006","unstructured":"Guti\u00e9rrez S, Krumke S, Megow N, Vredeveld T (2006) How to whack moles. Theor Comput Sci 361(2\u20133):329\u2013341","journal-title":"Theor Comput Sci"},{"issue":"3","key":"585_CR8","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1023\/B:JOSH.0000019683.85186.57","volume":"7","author":"S Irani","year":"2004","unstructured":"Irani S, Lu X, Regan A (2004) On-line algorithms for the dynamic traveling repair problem. J. Sched 7(3):243\u2013258","journal-title":"J. Sched"},{"issue":"2","key":"585_CR9","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1002\/net.20454","volume":"58","author":"P Jaillet","year":"2011","unstructured":"Jaillet P, Lu X (2011) Online traveling salesman problems with service flexibility. Networks 58(2):137\u2013146","journal-title":"Networks"},{"key":"585_CR10","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/S0304-3975(02)00409-7","volume":"295","author":"SO Krumke","year":"2003","unstructured":"Krumke SO, Paepe WD, Poensgen D, Stougie L (2003) News from the online traveling repairman. Theor Comput Sci 295:279\u2013294","journal-title":"Theor Comput Sci"},{"key":"585_CR11","unstructured":"Lipmann M (2003) On-line routing. PhD Thesis, Technische Universiteit Eindhoven"},{"key":"585_CR12","doi-asserted-by":"crossref","unstructured":"Simroth A, Souza A (2009) On an online traveling repairman problem with flowtimes: worst-case and average-case analysis. COCOON, pp 168-177","DOI":"10.1007\/978-3-642-02882-3_18"},{"key":"585_CR13","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1016\/j.ejor.2003.07.023","volume":"163","author":"SA Slotnick","year":"2005","unstructured":"Slotnick SA, Sobel MJ (2005) Manufacturing lead-time rules: customer retention versus tardiness costs. Eur J Oper Res 163:825\u2013856","journal-title":"Eur J Oper Res"},{"issue":"4","key":"585_CR14","doi-asserted-by":"publisher","first-page":"1048","DOI":"10.1016\/j.cie.2012.07.003","volume":"63","author":"X Wen","year":"2012","unstructured":"Wen X, Xu Y, Zhang H (2012) Online traveling salesman problem with deadline and advanced information. Comput Ind Eng 63(4):1048\u20131053","journal-title":"Comput Ind Eng"},{"issue":"3","key":"585_CR15","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s10878-013-9654-4","volume":"30","author":"X Wen","year":"2015","unstructured":"Wen X, Xu Y, Zhang H (2015) Online traveling salesman problem with deadlines and service flexibility. J Comb Optim 30(3):545\u2013562","journal-title":"J Comb Optim"},{"issue":"3","key":"585_CR16","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1016\/j.ejor.2014.04.037","volume":"238","author":"W Yu","year":"2014","unstructured":"Yu W, Liu Z et al (2014) Optimal deterministic algorithms for some variants of online quota traveling salesman problem. Eur J Oper Res 238(3):735\u2013740","journal-title":"Eur J Oper Res"},{"issue":"3","key":"585_CR17","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.tre.2016.12.011","volume":"99","author":"Y Zhou","year":"2017","unstructured":"Zhou Y, Liu J, Zhang Y, Gan X (2017) A multi-objective evolutionary algorithm for multi-period dynamic emergency resource scheduling problems. Transp Res E-Log 99(3):77\u201395","journal-title":"Transp Res E-Log"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00585-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-020-00585-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00585-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,28]],"date-time":"2022-09-28T08:50:25Z","timestamp":1664355025000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-020-00585-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,25]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["585"],"URL":"https:\/\/doi.org\/10.1007\/s10878-020-00585-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,25]]},"assertion":[{"value":"25 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}