Memetic Algorithm based on Improved Inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem.
Yu-Ting WangJunqing LiKaizhou GaoQuan-Ke PanPublished in: Comput. Math. Appl. (2011)
Keyphrases
- traveling salesman problem
- memetic algorithm
- lin kernighan
- combinatorial optimization
- crossover operator
- vehicle routing problem
- traveling salesman
- tabu search
- metaheuristic
- ant colony optimization
- benchmark instances
- combinatorial optimization problems
- optimization problems
- job shop scheduling problem
- combinatorial problems
- timetabling problem
- ant colony optimization algorithm
- simulated annealing
- hamiltonian cycle
- genetic algorithm
- neighborhood search
- valid inequalities
- branch and bound
- evolutionary computation
- branch and bound algorithm
- cost function
- evolutionary algorithm
- machine learning
- subtour elimination
- genetic local search