Vehicle Routing Problem in Competitive Environment: Two-Person Nonzero Sum Game Approach

Vehicle routing problem is one of the most important issues in transportation. among vrp problems, the competitive vrp is more important because there is a tough competition between distributors and retailers. in this study we introduced new method for vrp in competitive environment. in these methods two-person nonzero sum games are defined to choose equilibrium solution. therefore, revenue given in each route is different. in this paper, two distributors has been considered in a city with a set of customers and the best route with maximum revenue has been determined. first we introduced the hawk-dove procedure for the vrp problem and then by using nash bargaining model the equilibrium strategy of the game is calculated. the result of this method is different based on the kind of the strategy that each distributor chooses. in the hawk-dove game, if both of distributors choose the dove procedure, they will get equal but less revenue. in the nash bargaining game, the equilibrium strategy will obtained when distance of revenues of both distributors form its breakdown payoff is maximum.