On the Large Neighborhood Search Methods

EasyChair Preprint no. 2597

Abstract

In this paper, we provide a framework of metaheuristic designed to solve the vehicle routing problem
with time windows (VRP-TW).We integrate a new mechanism to deal with the Adaptive Large
Neighborhood Search (ALNS) algorithm applied to the problem. The main challenge is to highlight
intensification over diversification within the heuristic search process. In this context, we integrate
the process of the choice function into the ALNS algorithm. Therefore, several destroy/repair methods
is combined to explore multiple neighborhoods within the same search and defined implicitly
the large neighborhood. In order to study the quality of the resulting solution, a comparison between
the classical ALNS and the new Modified ALNS (MALNS) is subject to the experiment part of this
paper.

Keyphrases: ALNS, choice function, VRPTW

@Booklet{EasyChair:2597,
  author = {Mehdi Nasri and Imad Hafidi and Abdelmoutalib Metrane},
  title = {On the Large Neighborhood Search Methods},
  howpublished = {EasyChair Preprint no. 2597},

  year = {EasyChair, 2020}}