A new Hybrid Genetic Variable Neighborhood search heuristic for the Vehicle Routing Problem with Multiple Time Windows

Slim Belhaiza, Rym M'Hallah, Ghassen Ben Brahim

Research output: Contribution to journalArticlepeer-review

23 Citations (Scopus)

Abstract

The Vehicle Routing Problem (VRP) is a known optimization problems falling under the category of NP-Hard set of problems. VRP, along with its variations, continue to be extensively explored by the research community due to their large domain of application (environment, agriculture, industry, etc.) and economic impact on improving the overall performance, Quality of Services and reducing the operational cost. In this paper, we focus on VRPMTW; a variant of VRP with Multiple Time Windows constraints. We introduce a novel Hybrid Genetic Variable Neighborhood Search (HGVNS) based heuristic for the optimization of VRPMTW. The proposed framework uses genetic cross-over operators on a list of best parents and new implementations of local search operators. Computational results on benchmark data show substantial performance improvement when using the newly introduced heuristic.

Original languageEnglish
Pages (from-to)1319-1326
Number of pages8
Journal2017 IEEE Congress on Evolutionary Computation, CEC 2017 - Proceedings
DOIs
Publication statusPublished - 5 Jul 2017
Event2017 IEEE Congress on Evolutionary Computation, CEC 2017 - Donostia-San Sebastian, Spain
Duration: 5 Jun 20178 Jun 2017

Keywords

  • Genetic Algorithm
  • Variable Neighborhood Search
  • VRP with Multiple Time Windows

Fingerprint

Dive into the research topics of 'A new Hybrid Genetic Variable Neighborhood search heuristic for the Vehicle Routing Problem with Multiple Time Windows'. Together they form a unique fingerprint.

Cite this