{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T22:59:02Z","timestamp":1781045942715,"version":"3.54.1"},"publisher-location":"Singapore","reference-count":14,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819572502","type":"print"},{"value":"9789819572519","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-95-7251-9_12","type":"book-chapter","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T22:30:07Z","timestamp":1781044207000},"page":"165-176","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Interval Based Constrained Path Optimization in\u00a0Time-Dependent Road Networks"],"prefix":"10.1007","author":[{"given":"Kousik Kumar","family":"Dutta","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Venkata M. V.","family":"Gunturi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,1]]},"reference":[{"issue":"2","key":"12_CR1","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/s11704-019-8364-1","volume":"14","author":"C Chen","year":"2019","unstructured":"Chen, C., et al.: Enjoy the most beautiful scene now: a memetic algorithm to solve two-fold time-dependent arc orienteering problem. Front. Comp. Sci. 14(2), 364\u2013377 (2019)","journal-title":"Front. Comp. Sci."},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Ding, B., et\u00a0al.: Finding time-dependent shortest paths over large graphs, p. 205\u2013216. EDBT \u201908 (2008)","DOI":"10.1145\/1353343.1353371"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Dutta, K.K., et\u00a0al.: A multi-threading algorithm for constrained path optimization problem on road networks. In: WISE 2022, pp. 110\u2013118 (2022)","DOI":"10.1007\/978-3-031-20891-1_9"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Dutta, K.K., Gunturi, V.M.V.: Constrain path optimization on time-dependent road networks. In: WISE 2024 (2024)","DOI":"10.1007\/978-981-96-1483-7_24"},{"key":"12_CR5","volume-title":"Genetic Algorithms in Search","author":"DE Goldberg","year":"1989","unstructured":"Goldberg, D.E.: Genetic Algorithms in Search. Optimization and Machine Learning. Addison-Wesley Longman Publishing Co., Inc (1989)"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Gong, Z., et\u00a0al.: Querying shortest path on large time-dependent road networks with shortcuts. In: 2024 IEEE 40th ICDE, pp. 4532\u20134544 (2024)","DOI":"10.1109\/ICDE60146.2024.00345"},{"issue":"11","key":"12_CR7","first-page":"10922","volume":"35","author":"FT Islam","year":"2023","unstructured":"Islam, F.T., et al.: A crowd-enabled approach for privacy-enhanced and personalized safe route planning for fixed or flexible destinations. TKDE 35(11), 10922\u201310936 (2023)","journal-title":"TKDE"},{"issue":"1","key":"12_CR8","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s10707-020-00428-5","volume":"25","author":"R Kaur","year":"2021","unstructured":"Kaur, R., et al.: Finding the most navigable path in road networks. GeoInformatica 25(1), 207\u2013240 (2021)","journal-title":"GeoInformatica"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Lu, Y., et\u00a0al.: Scenic routes now: efficiently solving the time-dependent arc orienteering problem. In: Proc. of the 2017 ACM CIKM, pp. 487\u2013496 (2017)","DOI":"10.1145\/3132847.3132874"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Lu, Y., Shahabi, C.: An arc orienteering algorithm to find the most scenic path on a large-scale road network. In: Proc. of the 23rd SIGSPATIAL (2015)","DOI":"10.1145\/2820783.2820835"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Verbeeck, C., et\u00a0al.: An extension of the arc orienteering problem and its application to cycle trip planning. Trans. Res. Part E: Logi. Trans. Rev. 68, 64\u201378 (2014)","DOI":"10.1016\/j.tre.2014.05.006"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Wang, Y., et\u00a0al.: Constrained route planning over large multi-modal time-dependent networks. In: Proc. of the 37th IEEE ICDE, pp. 313\u2013324 (2021)","DOI":"10.1109\/ICDE51399.2021.00034"},{"issue":"10","key":"12_CR13","doi-asserted-by":"publisher","first-page":"1058","DOI":"10.14778\/3339490.3339491","volume":"12","author":"Y Yuan","year":"2019","unstructured":"Yuan, Y., et al.: Constrained shortest path query in a large time-dependent graph. Proc. VLDB Endow. 12(10), 1058\u20131070 (2019a)","journal-title":"Proc. VLDB Endow."},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Yuan, Y., et\u00a0al.: Weight-constrained route planning over time-dependent graphs. In: 2019 IEEE 35th ICDE, pp. 914\u2013925 (2019)","DOI":"10.1109\/ICDE.2019.00086"}],"container-title":["Lecture Notes in Computer Science","Web Information Systems Engineering \u2013 WISE 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-7251-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T22:30:10Z","timestamp":1781044210000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-7251-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819572502","9789819572519"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-7251-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"1 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WISE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web Information Systems Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Marrakech","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wise2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wise2025.ficloud.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}