Publication | Closed Access

A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods

Mathematical ProgrammingEngineeringLocal Search (Optimization)Traveling Salesman ProblemComputer EngineeringCombinatorial ProblemDouble-loop Hybrid AlgorithmVehicle Routing ProblemSalesman ProblemDiscrete MathematicsArbitrary NeighbourhoodsCombinatorial OptimizationDiscrete OptimizationVariable Neighborhood SearchOperations Research