A Multi-Start Iterated Local Search Algorithm for the Maximum Scatter Traveling Salesman Problem.
Pandiri VenkateshAlok SinghRammohan MallipeddiPublished in: CEC (2019)
Keyphrases
- traveling salesman problem
- multi start
- path relinking
- search algorithm
- tabu search
- combinatorial optimization
- metaheuristic
- global optimization
- ant colony optimization
- vehicle routing problem with time windows
- vehicle routing problem
- search procedure
- branch and bound
- search space
- optimization problems
- combinatorial problems
- valid inequalities
- combinatorial optimization problems
- crossover operator
- heuristic search
- traveling salesman
- discrete particle swarm optimization
- routing problem
- stochastic approximation
- optimal solution
- simulated annealing
- memetic algorithm
- heuristic methods
- search strategies
- search methods
- neural network