A Strength Pareto Evolutionary Algorithm for Solving the Capacitated Vehicle Routing Problem with Time Windows

Wissam Marrouche, Haidar M. Harmanani

2021

Abstract

The capacitated vehicle routing problem with time windows (CVRPTW) belongs to a set of complex combinatorial optimization problems that find major application in logistic systems and telecommunications. It is a complex variant of the well studied capacitated vehicle routing problem (CVRP). Few meta-heuristic approaches have been proposed to solve the CVRPTW problem in literature. In this paper, we examine a population based meta-heuristic algorithm, more precisely the strength Pareto evolutionary algorithm SPEA2 with hill climbing as a local search. The novelty of the approach lies in the choice of multi objective evolutionary algorithm namely SPEA2, its suggested evolutionary operators, and the optimization for three objectives: the number of routes, the total distance travelled, and the average time per route. The proposed algorithm is implemented using Python, and tested on the Solomon’s instances benchmark. Favorable results are reported and suggestions for further improvements are discussed.

Paper Citation

in Harvard Style

Marrouche W. and Harmanani H. (2021). A Strength Pareto Evolutionary Algorithm for Solving the Capacitated Vehicle Routing Problem with Time Windows. In Proceedings of the 13th International Joint Conference on Computational Intelligence (IJCCI 2021) - Volume 1: ECTA; ISBN 978-989-758-534-0, SciTePress, pages 96-106. DOI: 10.5220/0010640900003063

in Bibtex Style

@conference{ijcci21,
author={Wissam Marrouche and Haidar M. Harmanani},
title={A Strength Pareto Evolutionary Algorithm for Solving the Capacitated Vehicle Routing Problem with Time Windows},
booktitle={Proceedings of the 13th International Joint Conference on Computational Intelligence (IJCCI 2021) - Volume 1: ECTA},
year={2021},
pages={96-106},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0010640900003063},
isbn={978-989-758-534-0},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 13th International Joint Conference on Computational Intelligence (IJCCI 2021) - Volume 1: ECTA
TI - A Strength Pareto Evolutionary Algorithm for Solving the Capacitated Vehicle Routing Problem with Time Windows
SN - 978-989-758-534-0
AU - Marrouche W.
AU - Harmanani H.
PY - 2021
SP - 96
EP - 106
DO - 10.5220/0010640900003063
PB - SciTePress