{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:44:56Z","timestamp":1759063496088,"version":"3.37.3"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2019,8,12]],"date-time":"2019-08-12T00:00:00Z","timestamp":1565568000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,12]],"date-time":"2019-08-12T00:00:00Z","timestamp":1565568000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11771013","11531011"],"award-info":[{"award-number":["11771013","11531011"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61751303"],"award-info":[{"award-number":["61751303"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Zhejiang Provincial Natural Science Foundation of China","award":["LD19A010001","LY19A010018"],"award-info":[{"award-number":["LD19A010001","LY19A010018"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1007\/s11590-019-01463-4","type":"journal-article","created":{"date-parts":[[2019,8,12]],"date-time":"2019-08-12T17:03:51Z","timestamp":1565629431000},"page":"1701-1710","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Data mule scheduling on a path with handling time and time span constraints"],"prefix":"10.1007","volume":"14","author":[{"given":"Zhihao","family":"Chen","sequence":"first","affiliation":[]},{"given":"Zhao","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Yingli","family":"Ran","sequence":"additional","affiliation":[]},{"given":"Yishuo","family":"Shi","sequence":"additional","affiliation":[]},{"given":"Ding-Zhu","family":"Du","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,12]]},"reference":[{"key":"1463_CR1","doi-asserted-by":"crossref","unstructured":"Bhattacharya, B., Carmi, P., Hu, Y., Shi, Q.: Single vehicle routing problems on path\/tree\/cycle networks with release and handling times. In: ISAAC 2008, LNCS, vol. 5369, pp. 800\u2013811 (2008)","DOI":"10.1007\/978-3-540-92182-0_70"},{"key":"1463_CR2","doi-asserted-by":"crossref","unstructured":"Chakrabarti, A., Sabharwal, A., Aazhang, B.: Using predictable observer mobility for power efficient design of target networks. In: Proceedings of the 2nd International Workshop on Information Processing in Sensor Networks (IPSN 2003), pp. 129\u2013145 (2003)","DOI":"10.1007\/3-540-36978-3_9"},{"issue":"10","key":"1463_CR3","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TSMC.2014.2314675","volume":"44","author":"C-Y Chang","year":"2017","unstructured":"Chang, C.-Y., Yu, G.-J., Wang, T.-L.: Path construction and visit scheduling for targets by using data mules. IEEE Trans. Syst. Man Cybern. Syst. 44(10), 1289\u20131300 (2017)","journal-title":"IEEE Trans. Syst. Man Cybern. Syst."},{"key":"1463_CR4","doi-asserted-by":"crossref","unstructured":"Francesco, M.D., Das, S.K., Anastasi, G.: Data collection in wireless target networks with mobile elements: a survey. ACM Trans. Sensor Netw. 8(1), Article 7 (2011)","DOI":"10.1145\/1993042.1993049"},{"issue":"2","key":"1463_CR5","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0020-0190(02)00474-X","volume":"86","author":"DR Gaur","year":"2003","unstructured":"Gaur, D.R., Gupta, A., Krishnamurti, R.: A 5\/3-approximation algorithm for scheduling vehicles on a path with release and handling times. Inf. Process. Lett. 86(2), 87\u201391 (2003)","journal-title":"Inf. Process. Lett."},{"key":"1463_CR6","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1016\/S0166-218X(02)00596-6","volume":"129","author":"Y Karuno","year":"2003","unstructured":"Karuno, Y., Nagamochi, H.: 2-Approximation algorithms for the multi-vehicle routing problem on a path with release and handling times. Discrete Appl. Math. 129, 433\u2013447 (2003)","journal-title":"Discrete Appl. Math."},{"key":"1463_CR7","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1002\/net.10028","volume":"39","author":"Y Karuno","year":"2002","unstructured":"Karuno, Y., Nagamochi, H., Ibaraki, T.: Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks. Networks 39, 203\u2013209 (2002)","journal-title":"Networks"},{"issue":"2","key":"1463_CR8","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1002\/net.20435","volume":"59","author":"V Nagarajan","year":"2012","unstructured":"Nagarajan, V., Ravi, R.: Approximation algorithms for distance constrained vehicle routing problems. Networks 59(2), 209\u2013214 (2012)","journal-title":"Networks"},{"key":"1463_CR9","unstructured":"Somasundara, A.A., Ramamoorthy, A., Srivastava, M.B.: Mobile element scheduling for efficient data collection in wireless target networks with dynamic deadlines. In: Proceedings of the 25th IEEE International Real-Time Systems Symposium (RTSS 2004), Lisbon, pp. 296\u2013305 (2004)"},{"issue":"1","key":"1463_CR10","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1109\/TMC.2009.113","volume":"9","author":"R Sugihara","year":"2010","unstructured":"Sugihara, R., Gupta, R.K.: Optimal speed control of mobile node for data collection in target networks. IEEE Trans. Mob. Comput. 9(1), 127\u2013139 (2010)","journal-title":"IEEE Trans. Mob. Comput."},{"key":"1463_CR11","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1002\/net.3230220305","volume":"22","author":"JN Tsitsiklis","year":"1992","unstructured":"Tsitsiklis, J.N.: Special cases of traveling salesman and repairman problems with time windows. Networks 22, 263\u2013282 (1992)","journal-title":"Networks"},{"issue":"8","key":"1463_CR12","doi-asserted-by":"publisher","first-page":"2411","DOI":"10.1109\/TC.2015.2490060","volume":"65","author":"C Wang","year":"2016","unstructured":"Wang, C., Li, J., Ye, F., Yang, Y.: A mobile data gathering framework for wireless rechargeable target networks with vehicle movement costs and capacity constraints. IEEE Trans. Comput. 65(8), 2411\u20132427 (2016)","journal-title":"IEEE Trans. Comput."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-019-01463-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-019-01463-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-019-01463-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,14]],"date-time":"2020-09-14T13:06:49Z","timestamp":1600088809000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-019-01463-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,12]]},"references-count":12,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["1463"],"URL":"https:\/\/doi.org\/10.1007\/s11590-019-01463-4","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2019,8,12]]},"assertion":[{"value":"5 April 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 August 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}