A Memetic Algorithm Based on Breakout Local Search for the Generalized Traveling Salesman Problem.
Mehdi El KrariBelaïd AhiodBouazza El BenaniPublished in: Appl. Artif. Intell. (2020)
Keyphrases
- memetic algorithm
- traveling salesman problem
- combinatorial optimization
- crossover operator
- vehicle routing problem
- tabu search
- job shop scheduling problem
- timetabling problem
- benchmark instances
- metaheuristic
- ant colony optimization
- optimization problems
- combinatorial optimization problems
- branch and bound
- combinatorial problems
- neighborhood search
- path relinking
- hamiltonian cycle
- discrete particle swarm optimization
- discrete optimization problems
- traveling salesman
- genetic local search
- branch and bound algorithm
- simulated annealing
- nature inspired
- genetic algorithm
- exact algorithms
- evolutionary computation
- particle swarm optimization
- lin kernighan
- test instances
- test problems
- quadratic assignment problem
- variable neighborhood search
- scheduling problem
- evolutionary algorithm
- subtour elimination