{"id":366,"date":"2023-09-25T16:27:24","date_gmt":"2023-09-25T14:27:24","guid":{"rendered":"https:\/\/tommasoadamo.it\/wp\/?page_id=366"},"modified":"2025-03-13T18:29:05","modified_gmt":"2025-03-13T17:29:05","slug":"real-time-schedule-adjustments-for-conflict-free-vehicle-routing","status":"publish","type":"page","link":"https:\/\/tommasoadamo.it\/wp\/real-time-schedule-adjustments-for-conflict-free-vehicle-routing\/","title":{"rendered":"Real-time schedule adjustments for conflict-free vehicle routing"},"content":{"rendered":"<p>Conflict-Free Vehicle Routing Problems (CFVRPs) arise in manufacturing, transportation and logistics applications where Automated Guided Vehicles (AGVs)are utilized to move pallets and containers. A peculiar feature of these problems is that collision avoidance among vehicles must be considered explicitly. To makethings more complex, the uncertainty affecting both travel times and machine ready times often results in vehicle delays or anticipations that require real-timemodifications to the fleet nominal plan. In this paper, we model the CFVRP schedule adjustment problem as a sequential decision problem for which we developa tailored fast exact algorithm suitable for any objective function that is non-decreasing in the arrival times. Computational results show that optimalsolutions can be found within 1 millisecond for instances with up to 300 vehicles with improvements of various performance measures up to 74% compared to state-of-the-art solution algorithms.<\/p>\n<p><strong>Authors<\/strong>: Tommaso Adamo;\u00a0Gianpaolo Ghiani;\u00a0Emanuela Guerriero<\/p>\n<p>Computers &amp; Operations Research<br \/>\nVolume 166, June 2024, 106625<\/p>\n<p><a href=\"http:\/\/dx.doi.org\/10.1016\/j.cor.2024.106625\" target=\"_blank\" rel=\"noopener\">http:\/\/dx.doi.org\/10.1016\/j.cor.2024.106625<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Conflict-Free Vehicle Routing Problems (CFVRPs) arise in manufacturing, transportation and logistics applications where Automated Guided Vehicles (AGVs)are utilized to move pallets and containers. A peculiar feature of these problems is that collision avoidance among vehicles must be considered explicitly. To makethings more complex, the uncertainty affecting both travel times and machine ready times often results [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_mi_skip_tracking":false,"_exactmetrics_sitenote_active":false,"_exactmetrics_sitenote_note":"","_exactmetrics_sitenote_category":0,"jetpack_post_was_ever_published":false,"footnotes":""},"aioseo_notices":[],"jetpack_sharing_enabled":true,"jetpack_shortlink":"https:\/\/wp.me\/P9MOXw-5U","jetpack_likes_enabled":true,"jetpack-related-posts":[{"id":338,"url":"https:\/\/tommasoadamo.it\/wp\/recovering-feasibility-in-real-time-conflict-free-vehicle-routing\/","url_meta":{"origin":366,"position":0},"title":"Recovering feasibility in real-time conflict-free vehicle routing","author":"Tommaso Adamo","date":"9 November 2022","format":false,"excerpt":"Authors: Tommaso Adamo, Gianpaolo Ghiani, Emanuela Guerriero Abstract: Conflict-Free Vehicle Routing Problems (CF-VRPs) arise in manufacturing, transportation and logistics facilities where Automated Guided Vehicles (AGVs) are utilized to move loads. Unlike \\textit{Vehicle Routing Problems} arising in distribution management, CF-VRPs explicitly consider the limited capacity of the arcs of the guide\u2026","rel":"","context":"Similar post","block_context":{"text":"Similar post","link":""},"img":{"alt_text":"","src":"","width":0,"height":0},"classes":[]},{"id":83,"url":"https:\/\/tommasoadamo.it\/wp\/path-speed-optimization-conflict-free\/","url_meta":{"origin":366,"position":1},"title":"Path and Speed Optimization for Conflict-Free Pickup and Delivery under Time Windows","author":"Tommaso Adamo","date":"17 February 2016","format":false,"excerpt":"Authors: Tommaso Adamo, Tolga Bektas, Gianpaolo Ghiani, Emanuela Guerriero, Emanuele Manni Abstract: This article deals with the Speed Optimization Problem (SOP) for the Pickup and Delivery Routing Problem under Track Contention, a particular vehicle routing problem in which loads have to be transported between origin-destination pairs by means of vehicles\u2026","rel":"","context":"Similar post","block_context":{"text":"Similar post","link":""},"img":{"alt_text":"","src":"","width":0,"height":0},"classes":[]},{"id":317,"url":"https:\/\/tommasoadamo.it\/wp\/properties-and-bounds-for-the-single-vehicle-capacitated-routing-problem-with-time-dependent-travel-times-and-multiple-trips\/","url_meta":{"origin":366,"position":2},"title":"Properties and bounds for the single-vehicle capacitated routing problem with time-dependent travel times and multiple trips","author":"Tommaso Adamo","date":"5 February 2021","format":false,"excerpt":"Abstract: This paper deals with a problem where the same vehicle performs several routes to serve a set of customers and arc traversal times vary along the planning horizon. The relationship with its time-invariant counterpart is investigated and a procedure to compute lower and upper bounds on the optimal solution\u2026","rel":"","context":"Similar post","block_context":{"text":"Similar post","link":""},"img":{"alt_text":"","src":"","width":0,"height":0},"classes":[]},{"id":329,"url":"https:\/\/tommasoadamo.it\/wp\/learned-upper-bounds-for-the-time-dependent-travelling-salesman-problem\/","url_meta":{"origin":366,"position":3},"title":"Learned upper bounds for the Time-Dependent Travelling Salesman Problem","author":"Tommaso Adamo","date":"2 August 2021","format":false,"excerpt":"Tommaso Adamo,\u00a0Gianpaolo Ghiani,\u00a0Pierpaolo Greco,\u00a0Emanuela Guerriero Abstract: Fleet management plays a central role in several application contexts such as distribution planning, mail delivery, garbage collection, salt gritting, field service routing. Since road congestion has a big impact on driving times, fleet management can be enhanced by taking into account data on\u2026","rel":"","context":"Similar post","block_context":{"text":"Similar post","link":""},"img":{"alt_text":"","src":"","width":0,"height":0},"classes":[]},{"id":382,"url":"https:\/\/tommasoadamo.it\/wp\/a-review-of-recent-advances-in-time-dependent-vehicle-routing\/","url_meta":{"origin":366,"position":4},"title":"A review of recent advances in time-dependent vehicle routing","author":"Tommaso Adamo","date":"15 June 2024","format":false,"excerpt":"In late 2015 three of the co-authors of this paper published the first review on time-dependent routing problems. Since then, there have been several important algorithmic developments in the field. These include travel time prediction methods, real-time re-optimization by operating directly on the road graph, efficient exploration of solution neighborhoods,\u2026","rel":"","context":"Similar post","block_context":{"text":"Similar post","link":""},"img":{"alt_text":"","src":"","width":0,"height":0},"classes":[]},{"id":311,"url":"https:\/\/tommasoadamo.it\/wp\/on-path-ranking-in-time-dependent-graphs\/","url_meta":{"origin":366,"position":5},"title":"On path ranking in time-dependent graphs","author":"Tommaso Adamo","date":"5 February 2021","format":false,"excerpt":"Abstract: In this paper we study a property of time-dependent graphs, dubbed \u201cpath ranking invariance\u201d. Broadly speaking, a time-dependent graph is \u201cpath ranking invariant\u201d if the ordering of its paths (w.r.t. travel time) is independent of the start time. In this paper we show that, if a graph is path\u2026","rel":"","context":"Similar post","block_context":{"text":"Similar post","link":""},"img":{"alt_text":"","src":"","width":0,"height":0},"classes":[]}],"_links":{"self":[{"href":"https:\/\/tommasoadamo.it\/wp\/wp-json\/wp\/v2\/pages\/366"}],"collection":[{"href":"https:\/\/tommasoadamo.it\/wp\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/tommasoadamo.it\/wp\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/tommasoadamo.it\/wp\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/tommasoadamo.it\/wp\/wp-json\/wp\/v2\/comments?post=366"}],"version-history":[{"count":6,"href":"https:\/\/tommasoadamo.it\/wp\/wp-json\/wp\/v2\/pages\/366\/revisions"}],"predecessor-version":[{"id":455,"href":"https:\/\/tommasoadamo.it\/wp\/wp-json\/wp\/v2\/pages\/366\/revisions\/455"}],"wp:attachment":[{"href":"https:\/\/tommasoadamo.it\/wp\/wp-json\/wp\/v2\/media?parent=366"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}