Une heuristique de recherche à voisinage variable pour le problème du voyageur de commerce avec fenêtres de temps
We adapt a general variable neighborhood search heuristic to solve the traveling salesman problem with time windows (TSPTW) where the objective is to minimize the completion time. We use efficient methods to check the feasibility and the profitability of a movement. We use a specific order to reduce the search space while exploring the neighborhoods. The resulting method is competitive with the state-of-the-art. We improve the best known solutions for two classes of instances and provide the results of multiple instances of TSPTW for the first time.
General variable neighborhood search Traveling salesman problem Time windows Completion time minimization Feasibility Profitability Search space reduction