VNS with Path Relinking for the Profitable Close-Enough Arc Routing Problem.
Miguel ReulaConsuelo Parreño-TorresAnna Martínez-GavaraRafael MartíPublished in: MIC (1) (2024)
Keyphrases
- path relinking
- variable neighborhood search
- metaheuristic
- tabu search
- scatter search
- search procedure
- max min
- traveling salesman problem
- neighborhood search
- multi start
- combinatorial optimization
- solution quality
- nature inspired
- simulated annealing
- hybrid metaheuristic
- genetic algorithm
- solution space
- greedy randomized adaptive search procedure
- optimal solution
- feasible solution
- optimization problems
- search algorithm
- benchmark instances
- computational efficiency
- ant colony optimization
- vehicle routing problem
- memetic algorithm
- heuristic methods
- search space
- grasp with path relinking
- single machine scheduling problem
- search methods
- scheduling problem