A New Approach to Solve Traveling Salesman Problem Using Genetic Algorithm Based on Heuristic Crossover and Mutation Operator.
Gohar VahdatiMahdi YaghoobiMahdieh PoostchiMohammad-Bagher Naghibi-SistaniPublished in: SoCPaR (2009)
Keyphrases
- traveling salesman problem
- discrete optimization problems
- combinatorial optimization
- crossover and mutation
- lin kernighan
- traveling salesman
- crossover operator
- genetic operators
- ant colony optimization
- combinatorial optimization problems
- genetic algorithm
- mutation operator
- simulated annealing
- fitness function
- metaheuristic
- multi objective optimization
- optimization problems
- vehicle routing problem
- satisfy the triangle inequality
- search algorithm
- hamiltonian cycle
- selection operator
- premature convergence
- lower bound
- optimal solution
- subtour elimination
- branch and bound method
- optimization methods
- branch and bound
- optimization algorithm
- genetic programming
- multi objective