Many day-to-day routing problems are dynamic in nature: new orders are received as time progresses and must be incorporated into an evolving schedule. Taxis and parcel delivery couriers are examples. However, there is very little work available on these problems in the Operations Research literature. This paper is a look at some of the issues raised by dynamic problems. We introduce some benchmark data derived fromclassic VRP benchmarks, and dis- cuss some of the complications in creating this data. We look how the cost of the system is affected by the degree of dynamicity, defined here to be the proportionof the parcels which are known beforehand. We look also at the cost ofmaintaining a commit horizon where the schedule is fixed ahead of time for communications or other business reasons.
Mendeley saves you time finding and organizing research
There are no full text links
Choose a citation style from the tabs below