A Pareto non-dominated solution approach for the vehicle routing problem with multiple time windows

Slim Belhaiza; Rym M'Hallah

doi:10.1109/CEC.2016.7744235

A Pareto non-dominated solution approach for the vehicle routing problem with multiple time windows

Slim Belhaiza, Rym M'Hallah

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

10 Scopus citations

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.

Original language	English
Title of host publication	2016 IEEE Congress on Evolutionary Computation, CEC 2016
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	3515-3524
Number of pages	10
ISBN (Electronic)	9781509006229
DOIs	https://doi.org/10.1109/CEC.2016.7744235
State	Published - 14 Nov 2016

Publication series

Name	2016 IEEE Congress on Evolutionary Computation, CEC 2016

Bibliographical note

Publisher Copyright:
© 2016 IEEE.

Keywords

Extreme Nash equilibrium
Heterogeneous vehicle routing with multiple time windows
Multiple criteria
Multiple-agent non-cooperative game
Tabu search
Variable neighborhood search

ASJC Scopus subject areas

Artificial Intelligence
Modeling and Simulation
Computer Science Applications
Control and Optimization

Access to Document

10.1109/CEC.2016.7744235

Cite this

Belhaiza, S., & M'Hallah, R. (2016). A Pareto non-dominated solution approach for the vehicle routing problem with multiple time windows. In 2016 IEEE Congress on Evolutionary Computation, CEC 2016 (pp. 3515-3524). Article 7744235 (2016 IEEE Congress on Evolutionary Computation, CEC 2016). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/CEC.2016.7744235

@inproceedings{c28932553e2f43408ef5595dabfe5428,

title = "A Pareto non-dominated solution approach for the vehicle routing problem with multiple time windows",

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.",

keywords = "Extreme Nash equilibrium, Heterogeneous vehicle routing with multiple time windows, Multiple criteria, Multiple-agent non-cooperative game, Tabu search, Variable neighborhood search",

author = "Slim Belhaiza and Rym M'Hallah",

note = "Publisher Copyright: {\textcopyright} 2016 IEEE.",

year = "2016",

month = nov,

day = "14",

doi = "10.1109/CEC.2016.7744235",

language = "English",

series = "2016 IEEE Congress on Evolutionary Computation, CEC 2016",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "3515--3524",

booktitle = "2016 IEEE Congress on Evolutionary Computation, CEC 2016",

address = "United States",

}

Belhaiza, S & M'Hallah, R 2016, A Pareto non-dominated solution approach for the vehicle routing problem with multiple time windows. in 2016 IEEE Congress on Evolutionary Computation, CEC 2016., 7744235, 2016 IEEE Congress on Evolutionary Computation, CEC 2016, Institute of Electrical and Electronics Engineers Inc., pp. 3515-3524. https://doi.org/10.1109/CEC.2016.7744235

A Pareto non-dominated solution approach for the vehicle routing problem with multiple time windows. / Belhaiza, Slim; M'Hallah, Rym.
2016 IEEE Congress on Evolutionary Computation, CEC 2016. Institute of Electrical and Electronics Engineers Inc., 2016. p. 3515-3524 7744235 (2016 IEEE Congress on Evolutionary Computation, CEC 2016).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A Pareto non-dominated solution approach for the vehicle routing problem with multiple time windows

AU - Belhaiza, Slim

AU - M'Hallah, Rym

PY - 2016/11/14

Y1 - 2016/11/14

N2 - 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.

AB - 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.

KW - Extreme Nash equilibrium

KW - Heterogeneous vehicle routing with multiple time windows

KW - Multiple criteria

KW - Multiple-agent non-cooperative game

KW - Tabu search

KW - Variable neighborhood search

UR - https://www.scopus.com/pages/publications/85008253501

U2 - 10.1109/CEC.2016.7744235

DO - 10.1109/CEC.2016.7744235

M3 - Conference contribution

AN - SCOPUS:85008253501

T3 - 2016 IEEE Congress on Evolutionary Computation, CEC 2016

SP - 3515

EP - 3524

BT - 2016 IEEE Congress on Evolutionary Computation, CEC 2016

PB - Institute of Electrical and Electronics Engineers Inc.

ER -

A Pareto non-dominated solution approach for the vehicle routing problem with multiple time windows

Abstract

Publication series

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this