A New Approach for Solving the Disruption in Vehicle Routing Problem during Delivery

Abstract

The purpose of this paper is to describe a new approach for solving the disruption in vehicle routing problem (DVRP) which deals with the disruptions that occur abruptly when executing the original plan. The paper then discusses further on the vehicle-breakdown problems, which is the most common and usually happening problem when delivering the goods and services to the customers. To handle these cases, we need to develop a new routing plans to reduce the negative impact and solution needs to be quickly produced to reduce the annual costs. Tabu Search algorithm is selected to solve these DVRP and is assessed with other meta-heuristics like ant colony optimization and genetic algorithms. The contribution of this paper is to determine a combination of meta-heuristics that produces new best-known solutions on the VRP benchmark problems. Numerical tests on a set of relevant benchmark problems have been produced and computational results from the experiments using the other meta-heuristic techniques are presented.

Keywords

• vehicle routing problem
• disruption
• vehicle breakdown
• meta-heuristics
• tabu search