An improved genetic algorithm using the convex hull for traveling salesman problem.
Yoichi TakenakaNobuo FunabikiPublished in: SMC (1998)
Keyphrases
- convex hull
- traveling salesman problem
- combinatorial optimization
- optimization problems
- ant colony optimization
- combinatorial optimization problems
- valid inequalities
- job shop scheduling problem
- feasible solution
- traveling salesman
- point sets
- convex polyhedra
- vehicle routing problem
- mixed integer
- transportation networks
- hamiltonian cycle
- crossover operator
- genetic local search
- extreme points
- data points
- simple polygon
- face recognition
- integer points
- genetic algorithm