Abstract

This paper presents a new framework for the optimization of real-life multiple-objective vehicle routing problems with multiple time windows. This framework uses a hybrid variable neighborhood tabu search heuristic that chooses Pareto nondominated solutions from the search space of solutions that satisfy a set of Nash equilibrium conditions for a multiple-agent game theory model. Even though the framework is general and can tackle different classes of vehicle routing problems, it is herein 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 on real-life instances provided by a Canadian transportation company highlight the benefits of the multiple-criteria model; an important motivation to the transportation industry for its real-life implementation.

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.