A genetic algorithm with jumping gene and heuristic operators for traveling salesman problem.
Panli ZhangJiquan WangZhanwei TianShengzhi SunJianting LiJingnan YangPublished in: Appl. Soft Comput. (2022)
Keyphrases
- traveling salesman problem
- genetic algorithm
- combinatorial optimization
- lin kernighan
- ant colony optimization
- crossover operator
- traveling salesman
- simulated annealing
- benchmark instances
- variable neighborhood search
- metaheuristic
- neighborhood search
- tabu search
- job shop scheduling problem
- minimum spanning tree
- optimization problems
- combinatorial optimization problems
- combinatorial problems
- evolutionary algorithm
- path relinking
- satisfy the triangle inequality
- hybrid algorithm
- multi objective
- vehicle routing problem
- valid inequalities
- ant colony optimization algorithm
- optimal solution
- memetic algorithm
- hamiltonian cycle
- genetic local search
- ant colony algorithm
- neural network
- swarm intelligence
- branch and bound
- genetic algorithm ga
- fitness function
- exact algorithms
- quadratic assignment problem
- hyper heuristics
- branch and bound algorithm
- search space
- heuristic search
- discrete optimization problems
- subtour elimination
- np hard