PROJECT TITLE :

An Improved Benders Decomposition Algorithm for an Arc Interdiction Vehicle Routing Problem

ABSTRACT:

The vehicle routing drawback is one amongst the most important and well-known problems that's thought-about by researchers lately. There are some very important or expensive shipments, like fuel shipments, vehicles carrying money, prisoner transfer vehicles, and so on, that are being assassinated by some interdictors. The matter of routing in these types of shipments is additional difficult compared with the classical routing issues. During this paper, routing of these special types of shipments is integrated for the primary time into the network interdiction concepts. For this purpose, a bilevel programming model is proposed and a benders decomposition algorithm is developed for little-size problems. Two super-valid inequalities are proposed to enhance the efficiency of this algorithm. Also, 2 bilevel metaheuristics are advised to unravel this Stachelberg interdictor-evader game for large-size problems. To point out the applicability and efficiency of the solution methods, some randomly generated and additionally benchmark instances are used. The computational results show that the 2 proposed metaheuristic algorithms may be effective for solving these issues.