Results of different experiences with local search applied to routing problems

Abstract

In combinatorial optimization problems, Local Search Algorithms (or Neighborhood Search Algorithms) have always played a significant role within heuristic techniques. This importance has grown, especially with the emergence of recent metaheuristic techniques that heavily rely on these local neighborhood movements. In the context of the Mixed Vehicle Routing Problem with Time Windows (VRPTW), this work delves into several experiences related to local search algorithms. These experiences include: Definition and Comparison of Different Neighborhood Types: The study examines various neighborhood structures to determine the most suitable one for the problem at hand, Solution Selection During Movements: It investigates how to choose the best solution during each movement within the local search process y  Rapid Local Search Strategy: The use of a rapid local search strategy is explored, aiming to significantly reduce computation time for large-scale problems.

These experiments are conducted using simulated instances