Incremental Rerouting Algorithm for single-vehicle VRPPD

Abstract

Transportation of goods and transportation of persons routing algorithms are extensively studied since early 80's as a subtype of a Traveling Salesman Problem. This subtype includes VRPPD (Vehicle Routing Problem with Pickup and Delivery), courier systems and DARP (dial-a-ride problem). But for these systems to be effective in real world situations, they have to react quickly and efficiently to unexpected circumstances like dense traffic or road closing. With this in mind we developed an incremental rerouting algorithm which modifies initial solution route according to the new traffic conditions.