{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:28:10Z","timestamp":1750220890982,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,11,5]],"date-time":"2019-11-05T00:00:00Z","timestamp":1572912000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,11,5]]},"DOI":"10.1145\/3347146.3359375","type":"proceedings-article","created":{"date-parts":[[2019,11,13]],"date-time":"2019-11-13T22:08:16Z","timestamp":1573682896000},"page":"279-288","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Multi-Itinerary Optimization as Cloud Service (Industrial Paper)"],"prefix":"10.1145","author":[{"given":"Alexandru","family":"Cristian","sequence":"first","affiliation":[{"name":"Microsoft"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luke","family":"Marshall","sequence":"additional","affiliation":[{"name":"Microsoft Research"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mihai","family":"Negrea","sequence":"additional","affiliation":[{"name":"Microsoft"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Flavius","family":"Stoichescu","sequence":"additional","affiliation":[{"name":"Microsoft"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peiwei","family":"Cao","sequence":"additional","affiliation":[{"name":"Microsoft"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ishai","family":"Menache","sequence":"additional","affiliation":[{"name":"Microsoft Research"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,11,5]]},"reference":[{"unstructured":"2007. What Is the ROADEF Challenge? http:\/\/www.roadef.org\/challenge\/2007\/en\/.  2007. What Is the ROADEF Challenge? http:\/\/www.roadef.org\/challenge\/2007\/en\/.","key":"e_1_3_2_1_1_1"},{"unstructured":"2018. Resource Scheduling Optimization (RSO). https:\/\/docs.microsoft.com\/en-us\/dynamics365\/customer-engagement\/field-service\/rso-overview.  2018. Resource Scheduling Optimization (RSO). https:\/\/docs.microsoft.com\/en-us\/dynamics365\/customer-engagement\/field-service\/rso-overview.","key":"e_1_3_2_1_2_1"},{"unstructured":"2019. Azure pricing. Retrieved June 7 2019 from https:\/\/azure.microsoft.com\/en-us\/pricing\/details\/virtual-machines\/windows\/  2019. Azure pricing. Retrieved June 7 2019 from https:\/\/azure.microsoft.com\/en-us\/pricing\/details\/virtual-machines\/windows\/","key":"e_1_3_2_1_3_1"},{"unstructured":"2019. Bing Maps Multi-Itinerary Optimization. https:\/\/docs.microsoft.com\/en-us\/bingmaps\/rest-services\/routes\/optimized-itinerary.  2019. Bing Maps Multi-Itinerary Optimization. https:\/\/docs.microsoft.com\/en-us\/bingmaps\/rest-services\/routes\/optimized-itinerary.","key":"e_1_3_2_1_4_1"},{"unstructured":"2019. Calculate directions between locations using the Google Maps Directions API. https:\/\/developers.google.com\/maps\/documentation\/directions\/intro.  2019. Calculate directions between locations using the Google Maps Directions API. https:\/\/developers.google.com\/maps\/documentation\/directions\/intro.","key":"e_1_3_2_1_5_1"},{"unstructured":"2019. Routific Engine API. https:\/\/docs.routific.com\/.  2019. Routific Engine API. https:\/\/docs.routific.com\/.","key":"e_1_3_2_1_6_1"},{"unstructured":"2019. TomTom Routing API. https:\/\/developer.tomtom.com\/routing-api\/routing-api-documentation-routing\/calculate-route.  2019. TomTom Routing API. https:\/\/developer.tomtom.com\/routing-api\/routing-api-documentation-routing\/calculate-route.","key":"e_1_3_2_1_7_1"},{"doi-asserted-by":"crossref","unstructured":"Ittai Abraham Daniel Delling Andrew V. Goldberg and Renato F. Werneck. 2011. A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks. In Experimental Algorithms (Lecture Notes in Computer Science) Panos M. Pardalos and Steffen Rebennack (Eds.). Springer Berlin Heidelberg 230--241.  Ittai Abraham Daniel Delling Andrew V. Goldberg and Renato F. Werneck. 2011. A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks. In Experimental Algorithms (Lecture Notes in Computer Science) Panos M. Pardalos and Steffen Rebennack (Eds.). Springer Berlin Heidelberg 230--241.","key":"e_1_3_2_1_8_1","DOI":"10.1007\/978-3-642-20662-7_20"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1287\/opre.46.3.316"},{"doi-asserted-by":"crossref","unstructured":"Xi Chen Barrett W. Thomas and Mike Hewitt. 2016. The Technician Routing Problem with Experience-Based Service Times. Omega 61 (June 2016) 49--61. https:\/\/doi.org\/10.1016\/j.omega.2015.07.006  Xi Chen Barrett W. Thomas and Mike Hewitt. 2016. The Technician Routing Problem with Experience-Based Service Times. Omega 61 (June 2016) 49--61. https:\/\/doi.org\/10.1016\/j.omega.2015.07.006","key":"e_1_3_2_1_10_1","DOI":"10.1016\/j.omega.2015.07.006"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1007\/s10951-010-0188-7"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1016\/j.disopt.2010.04.002"},{"unstructured":"Brian C Dean. 2004. Shortest Paths in FIFO Time-Dependent Networks: Theory and Algorithms. Rapport technique (2004) 13.  Brian C Dean. 2004. Shortest Paths in FIFO Time-Dependent Networks: Theory and Algorithms. Rapport technique (2004) 13.","key":"e_1_3_2_1_13_1"},{"volume-title":"Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems, Ravindra K","author":"Delling Daniel","key":"e_1_3_2_1_14_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1287\/opre.43.2.367"},{"unstructured":"Pierre-Francois Dutot Alexandre Laugier and Anne-Marie Bustos. 2016. Technicians and Interventions Scheduling for Telecommunications. (2016) 7.  Pierre-Francois Dutot Alexandre Laugier and Anne-Marie Bustos. 2016. Technicians and Interventions Scheduling for Telecommunications. (2016) 7.","key":"e_1_3_2_1_16_1"},{"doi-asserted-by":"crossref","unstructured":"F. Errico G. Desaulniers M. Gendreau W. Rei and L.-M. Rousseau. 2016. The Vehicle Routing Problem with Hard Time Windows and Stochastic Service Times. EURO Journal on Transportation and Logistics (Nov. 2016) 1--29. https:\/\/doi.org\/10.1007\/s13676-016-0101-4  F. Errico G. Desaulniers M. Gendreau W. Rei and L.-M. Rousseau. 2016. The Vehicle Routing Problem with Hard Time Windows and Stochastic Service Times. EURO Journal on Transportation and Logistics (Nov. 2016) 1--29. https:\/\/doi.org\/10.1007\/s13676-016-0101-4","key":"e_1_3_2_1_17_1","DOI":"10.1007\/s13676-016-0101-4"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1007\/s00453-012-9714-7"},{"unstructured":"Robert Geisberger. 2010. Engineering Time-Dependent One-To-All Computation. arXiv:1010.0809 [cs] (Oct. 2010). arXiv:cs\/1010.0809  Robert Geisberger. 2010. Engineering Time-Dependent One-To-All Computation. arXiv:1010.0809 [cs] (Oct. 2010). arXiv:cs\/1010.0809","key":"e_1_3_2_1_19_1"},{"volume-title":"Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks","year":"2008","author":"Geisberger Robert","key":"e_1_3_2_1_20_1"},{"unstructured":"Edward He Natashia Boland George Nemhauser and Martin Savelsbergh. 2019. Computational Complexity of Time-Dependent Shortest Path Problems. Optimization Online (Feb. 2019) 12.  Edward He Natashia Boland George Nemhauser and Martin Savelsbergh. 2019. Computational Complexity of Time-Dependent Shortest Path Problems. Optimization Online (Feb. 2019) 12.","key":"e_1_3_2_1_21_1"},{"unstructured":"Keld Helsgaun. 2017. An Extension of the Lin-Kernighan-Helsgaun TSP Solver for Constrained Traveling Salesman and Vehicle Routing Problems. https:\/\/doi.org\/10.13140\/RG.2.2.25569.40807  Keld Helsgaun. 2017. An Extension of the Lin-Kernighan-Helsgaun TSP Solver for Constrained Traveling Salesman and Vehicle Routing Problems. https:\/\/doi.org\/10.13140\/RG.2.2.25569.40807","key":"e_1_3_2_1_22_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1007\/s10951-011-0246-9"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1287\/trsc.26.3.185"},{"doi-asserted-by":"crossref","unstructured":"Douglas Moura Miranda and Samuel Vieira Concei\u00e7\u00e3o. 2016. The Vehicle Routing Problem with Hard Time Windows and Stochastic Travel and Service Time. Expert Systems with Applications 64 (Dec. 2016) 104--116. https:\/\/doi.org\/10.1016\/j.eswa.2016.07.022  Douglas Moura Miranda and Samuel Vieira Concei\u00e7\u00e3o. 2016. The Vehicle Routing Problem with Hard Time Windows and Stochastic Travel and Service Time. Expert Systems with Applications 64 (Dec. 2016) 104--116. https:\/\/doi.org\/10.1016\/j.eswa.2016.07.022","key":"e_1_3_2_1_25_1","DOI":"10.1016\/j.eswa.2016.07.022"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1007\/s11590-012-0567-4"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.1016\/j.cor.2005.09.012"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_28_1","DOI":"10.1287\/trsc.22.1.1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_29_1","DOI":"10.1016\/j.cor.2012.06.008"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_30_1","DOI":"10.1002\/net.21808"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_31_1","DOI":"10.1287\/inte.29.1.112"}],"event":{"sponsor":["SIGSPATIAL ACM Special Interest Group on Spatial Information"],"acronym":"SIGSPATIAL '19","name":"SIGSPATIAL '19: 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","location":"Chicago IL USA"},"container-title":["Proceedings of the 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3347146.3359375","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3347146.3359375","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:44:29Z","timestamp":1750203869000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3347146.3359375"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,5]]},"references-count":31,"alternative-id":["10.1145\/3347146.3359375","10.1145\/3347146"],"URL":"https:\/\/doi.org\/10.1145\/3347146.3359375","relation":{},"subject":[],"published":{"date-parts":[[2019,11,5]]},"assertion":[{"value":"2019-11-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}