On the effectiveness of genetic search in combinatorial optimization.
Kihong ParkBob CarterPublished in: SAC (1995)
Keyphrases
- combinatorial optimization
- genetic search
- simulated annealing
- genetic algorithm
- metaheuristic
- combinatorial optimization problems
- traveling salesman problem
- branch and bound
- combinatorial problems
- branch and bound algorithm
- mathematical programming
- hard combinatorial optimization problems
- genetic programming
- job shop scheduling problem
- quadratic assignment problem
- optimization problems
- tabu search
- single machine scheduling problem
- genetic operators
- exact algorithms
- path relinking
- upper bound