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.
| Original language | English |
|---|---|
| Article number | 7562445 |
| Journal | IEEE Systems Journal |
| Volume | PP |
| Issue number | 99 |
| State | Published - 7 Sep 2016 |
Bibliographical note
Publisher Copyright:© 2007-2012 IEEE.
Keywords
- Extreme Nash equilibrium
- heterogeneous vehicle routing with multiple time windows
- multiple criteria
- multiple-Agent noncooperative game
- tabu search
- variable neighborhood search (VNS)
ASJC Scopus subject areas
- Control and Systems Engineering
- Information Systems
- Computer Science Applications
- Computer Networks and Communications
- Electrical and Electronic Engineering