Abstract
This paper presents a hybrid tabu search variable neighborhood (HVNTS) heuristic that chooses Pareto non-dominated solutions from the search space of solutions that satisfy a set of Nash equilibrium conditions for a multiple-agent game theory model. The framework is general and can tackle different classes of Vehicle Routing Problems (VRP). It is herein applied to the VRP with Multiple Time Windows (VRPMTW) and tested on three objectives: minimizing the total travel cost (expressed in time units), maximizing the minimal customers' utility, and maximizing the minimal drivers' utility. The results for benchmark instances highlight the benefits of the multiple-criteria model; an important motivation to the transportation industry for its real life implementation.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
