# How to improve the solution in ALNS metaheuristic

I am solving the CVRP with Adaptive Large Neighborhood Search (ALNS) .

I used the following construction operators: GreedyInsertion and regretHeuristique, and the following destruction operators: relaxShawDeletion , RoutePortionOperator, and LongestDetourOperator.

But the solutions I get are very far from the solutions that are in the literature.

Do you have an idea on how I can improve the solution? Are there any other operators that give better solutions?

• Are you trying to implement the exact same algorithm as one from the literature? Here is a recent LNS algorithm for the CVRP, you might find some inspiration doi.org/10.1287/trsc.2019.0914 – fontanf Mar 1 at 19:55