Ensuring service level in dynamic vehicle routing problem

摘要

We studied dynamic vehicle routing problem with some requests to be acknowledged during the execution of transportation plan. We divided the time span into several slices and perform re-optimization with updated data at the beginning of each slice. To predict the arrivals of dynamic customers, we sampled number of scenarios. Each scenario is solved by the novel algorithm named selective service with limited resource (SSLR). Service level is ensured by maximizing the number of served customers and giving in-time response. Simulation results show the effectiveness of our proposed method.