{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T09:53:31Z","timestamp":1762509211157,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T00:00:00Z","timestamp":1735948800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1952011"],"award-info":[{"award-number":["1952011"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,1,4]]},"DOI":"10.1145\/3700838.3700854","type":"proceedings-article","created":{"date-parts":[[2025,1,2]],"date-time":"2025-01-02T12:58:12Z","timestamp":1735822692000},"page":"73-83","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["PDPTW-DB: MILP-Based Offline Route Planning for PDPTW with Driver Breaks"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-1821-141X","authenticated-orcid":false,"given":"Agrima","family":"Khanna","sequence":"first","affiliation":[{"name":"Vanderbilt University, Nashville, Tennessee, United States"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-9868-6268","authenticated-orcid":false,"given":"Fangqi","family":"Liu","sequence":"additional","affiliation":[{"name":"Vanderbilt University, Nashville, Tennessee, United States"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-6804-8771","authenticated-orcid":false,"given":"Samir","family":"Gupta","sequence":"additional","affiliation":[{"name":"Vanderbilt University, Nashville, Tennessee, United States"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9015-8906","authenticated-orcid":false,"given":"Sophie","family":"Pavia","sequence":"additional","affiliation":[{"name":"Vanderbilt University, Nashville, Tennessee, United States"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8355-0950","authenticated-orcid":false,"given":"Ayan","family":"Mukhopadhyay","sequence":"additional","affiliation":[{"name":"Vanderbilt University, Nashville, Tennessee, United States"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0168-4948","authenticated-orcid":false,"given":"Abhishek","family":"Dubey","sequence":"additional","affiliation":[{"name":"Vanderbilt University, Nashville, Tennessee, United States"}]}],"member":"320","published-online":{"date-parts":[[2025,1,4]]},"reference":[{"key":"e_1_3_3_2_2_2","doi-asserted-by":"publisher","unstructured":"Mohammed Bazirha. 2023. A novel MILP formulation and an efficient heuristic for the vehicle routing problem with lunch break. Annals of Operations Research (12 2023). 10.1007\/s10479-023-05742-3","DOI":"10.1007\/s10479-023-05742-3"},{"key":"e_1_3_3_2_3_2","doi-asserted-by":"publisher","unstructured":"A.M. Benjamin and J.E. Beasley. 2010. Metaheuristics for the waste collection vehicle routing problem with time windows driver rest period and multiple disposal facilities. Computers and Operations Research 37 12 (2010) 2270\u20132280. 10.1016\/j.cor.2010.03.019","DOI":"10.1016\/j.cor.2010.03.019"},{"key":"e_1_3_3_2_4_2","doi-asserted-by":"publisher","unstructured":"Thierry Benoist Bertrand Estellon Fr\u00e9d\u00e9ric Gardi Romain Megel and Karim Nouioua. 2011. LocalSolver 1.x: A black-box local-search solver for 0-1 programming. 4OR 9 (09 2011) 299\u2013316. 10.1007\/s10288-011-0165-9","DOI":"10.1007\/s10288-011-0165-9"},{"key":"e_1_3_3_2_5_2","doi-asserted-by":"publisher","unstructured":"Kris Braekers An Caris and Gerrit Janssens. 2014. Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots. Transportation Research Part B: Methodological 67 (09 2014) 166\u2013186. 10.1016\/j.trb.2014.05.007","DOI":"10.1016\/j.trb.2014.05.007"},{"key":"e_1_3_3_2_6_2","doi-asserted-by":"publisher","unstructured":"Katja Buhrkal Allan Larsen and Stefan Ropke. 2012. The Waste Collection Vehicle Routing Problem with Time Windows in a City Logistics Context. Procedia - Social and Behavioral Sciences 39 (12 2012) 241\u2013254. 10.1016\/j.sbspro.2012.03.105","DOI":"10.1016\/j.sbspro.2012.03.105"},{"key":"e_1_3_3_2_7_2","doi-asserted-by":"publisher","unstructured":"\u00d6mer \u00c7am and Hayrettin Sezen. 2020. Linear Programming Formulation For Vehicle Routing Problem Which Is Minimized Idle Time. Decision Making: Applications in Management and Engineering 3 (03 2020). 10.31181\/dmame2003132h","DOI":"10.31181\/dmame2003132h"},{"key":"e_1_3_3_2_8_2","doi-asserted-by":"publisher","unstructured":"Leandro Coelho Jean-Philippe Gagliardi Jacques Renaud and Angel Ruiz. 2015. Solving the vehicle routing problem with lunch break arising in the furniture delivery industry. Journal of the Operational Research Society 67 (2015). 10.1057\/jors.2015.90","DOI":"10.1057\/jors.2015.90"},{"key":"e_1_3_3_2_9_2","unstructured":"European Commission. 2015. Driving time and rest periods. https:\/\/transport.ec.europa.eu\/transport-modes\/road\/social-provisions\/driving-time-and-rest-periods_en."},{"key":"e_1_3_3_2_10_2","unstructured":"Federal Motor Carrier Safety Administration. 2020. Large Truck and Bus Crash Facts 2020. https:\/\/www.fmcsa.dot.gov\/safety\/data-and-statistics\/large-truck-and-bus-crash-facts-2020"},{"key":"e_1_3_3_2_11_2","unstructured":"Federal Motor Carrier Safety Administration. 2022. Hours of Service (HOS). https:\/\/www.fmcsa.dot.gov\/regulations\/hours-of-service."},{"key":"e_1_3_3_2_12_2","unstructured":"Federal Motor Carrier Safety Administration (FMCSA). 2024. Driver Fatigue and Distraction Monitoring and Warning System Phase I. https:\/\/www.fmcsa.dot.gov\/safety\/research-and-analysis\/driver-fatigue-and-distraction-monitoring-and-warning-system."},{"key":"e_1_3_3_2_13_2","doi-asserted-by":"publisher","unstructured":"Asvin Goel. 2009. Vehicle Scheduling and Routing with Drivers\u2019 Working Hours. Transportation Science 43 1 (February 2009) 17\u201326. 10.1287\/trsc.1070.0226","DOI":"10.1287\/trsc.1070.0226"},{"key":"e_1_3_3_2_14_2","unstructured":"Gurobi Optimization LLC. 2022. Gurobi Optimizer Reference Manual. https:\/\/www.gurobi.com"},{"key":"e_1_3_3_2_15_2","volume-title":"10th Symposium of the European Association for Research in Transportation","author":"Karademir C.","year":"2022","unstructured":"C. Karademir, B. Alves Beirigo, R.R. Negenborn, and B. Atasoy. 2022. Two-echelon Multi-trip Vehicle Routing Problem with Synchronization for An Integrated Water- and Land-based Transportation System. In 10th Symposium of the European Association for Research in Transportation."},{"key":"e_1_3_3_2_16_2","volume-title":"Proceedings of the 2020 USENIX Annual Technical Conference (USENIX ATC \u201920)","author":"Keahey Kate","year":"2020","unstructured":"Kate Keahey, Jason Anderson, Zhuo Zhen, Pierre Riteau, Paul Ruth, Dan Stanzione, Mert Cevik, Jacob Colleran, Haryadi\u00a0S. Gunawi, Cody Hammock, Joe Mambretti, Alexander Barnes, Fran\u00e7ois Halbach, Alex Rocha, and Joe Stubbs. 2020. Lessons Learned from the Chameleon Testbed. In Proceedings of the 2020 USENIX Annual Technical Conference (USENIX ATC \u201920). USENIX Association."},{"key":"e_1_3_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i4.25644"},{"key":"e_1_3_3_2_18_2","doi-asserted-by":"publisher","unstructured":"A.\u00a0L. Kok E.\u00a0W. Hans J.\u00a0M.\u00a0J. Schutten and W.\u00a0H.\u00a0M. Zijm. 2011. A dynamic programming heuristic for vehicle routing with time-dependent travel times and required breaks. Flexible Services and Manufacturing Journal 22 1 (2011) 83\u2013108. 10.1007\/s10696-011-9077-4","DOI":"10.1007\/s10696-011-9077-4"},{"key":"e_1_3_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11996-5_12"},{"key":"e_1_3_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2024\/822"},{"key":"e_1_3_3_2_21_2","volume-title":"OR-Tools","author":"Perron Laurent","year":"2024","unstructured":"Laurent Perron and Vincent Furnon. 2024. OR-Tools. Google. https:\/\/developers.google.com\/optimization\/"},{"key":"e_1_3_3_2_22_2","doi-asserted-by":"publisher","unstructured":"Eric Prescott-Gagnon Guy Desaulniers and Louis-Martin Rousseau. 2009. A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows. Networks 54 (12 2009) 190\u2013204. 10.1002\/net.20332","DOI":"10.1002\/net.20332"},{"key":"e_1_3_3_2_23_2","doi-asserted-by":"publisher","unstructured":"Yves Rochat and Eric Taillard. 2015. Probabilistic Diversification and Intensification in Local Search for Vehicle Routing. Journal of Heuristics 1 1 (September 2015) 147\u2013167. 10.1007\/BF02430370","DOI":"10.1007\/BF02430370"},{"key":"e_1_3_3_2_24_2","doi-asserted-by":"publisher","unstructured":"Carlo\u00a0S. Sartori and Luciana\u00a0S. Buriol. 2020. A study on the pickup and delivery problem with time windows: Matheuristics and new instances. Computers and Operations Research 124 (2020) 105065. 10.1016\/j.cor.2020.105065","DOI":"10.1016\/j.cor.2020.105065"},{"key":"e_1_3_3_2_25_2","volume-title":"The impact of synchronizing driver breaks and recharging operations for electric vehicles","author":"Schiffer Maximilian","year":"2017","unstructured":"Maximilian Schiffer, Gilbert Laporte, Michael Schneider, and Grit Walther. 2017. The impact of synchronizing driver breaks and recharging operations for electric vehicles. Technical Report G-2017-46. Les Cahiers du GERAD."},{"key":"e_1_3_3_2_26_2","doi-asserted-by":"crossref","unstructured":"Amutheezan Sivagnanam Salah Kadir Ayan Mukhopadhyay Philip Pugliese Abhishek Dubey Samitha Samaranayake and Aron Laszka. 2022. Offline Vehicle Routing Problem with Online Bookings: A Novel Problem Formulation with Applications to Paratransit. Preprint submitted to Elsevier (2022). Accepted for publication in the proceedings of the 31st International Joint Conference on Artificial Intelligence (IJCAI 2022).","DOI":"10.24963\/ijcai.2022\/546"},{"key":"e_1_3_3_2_27_2","unstructured":"Zifei Su and Pingen Chen. 2024. Driver-Centric Capacitated Electric Vehicle Routing Problem: A Human Energy-Aware Approach. SSRN (2024)."},{"key":"e_1_3_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718515"},{"key":"e_1_3_3_2_29_2","volume-title":"Twenty-Eighth International Conference on Automated Planning and Scheduling (ICAPS 2018)","author":"Tuin Marieke","year":"2018","unstructured":"Marieke Tuin, Mathijs de Weerdt, and G.\u00a0Veit Batz. 2018. Route Planning with Breaks and Truck Driving Bans Using Time-Dependent Contraction Hierarchies. In Twenty-Eighth International Conference on Automated Planning and Scheduling (ICAPS 2018). Association for the Advancement of Artificial Intelligence."},{"key":"e_1_3_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1145\/3576841.3589625"},{"key":"e_1_3_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1145\/3427796.3427820"},{"key":"e_1_3_3_2_32_2","doi-asserted-by":"publisher","unstructured":"Jingyi Zhao Mark Poon Vincent Tan and Zhenzhen Zhang. 2024. A hybrid genetic search and dynamic programming-based split algorithm for the multi-trip time-dependent vehicle routing problem. European Journal of Operational Research 317 (04 2024). 10.1016\/j.ejor.2024.04.011","DOI":"10.1016\/j.ejor.2024.04.011"}],"event":{"name":"ICDCN 2025: 26th International Conference on Distributed Computing and Networking","acronym":"ICDCN 2025","location":"Hyderabad India"},"container-title":["Proceedings of the 26th International Conference on Distributed Computing and Networking"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3700838.3700854","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3700838.3700854","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3700838.3700854","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:10:22Z","timestamp":1750295422000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3700838.3700854"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,4]]},"references-count":31,"alternative-id":["10.1145\/3700838.3700854","10.1145\/3700838"],"URL":"https:\/\/doi.org\/10.1145\/3700838.3700854","relation":{},"subject":[],"published":{"date-parts":[[2025,1,4]]},"assertion":[{"value":"2025-01-04","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}