Parallel quantum-inspired genetic algorithm for combinatorial optimization problem.
Kuk-Hyun HanKui-Hong ParkCi-Ho LeeJong-Hwan KimPublished in: CEC (2001)
Keyphrases
- combinatorial optimization
- quantum inspired
- genetic algorithm
- simulated annealing
- metaheuristic
- binary gravitational search algorithm
- mutation operator
- combinatorial optimization problems
- traveling salesman problem
- quantum computing
- optimization problems
- branch and bound
- branch and bound algorithm
- hard combinatorial optimization problems
- combinatorial problems
- evolutionary algorithm
- principles of quantum computing
- crossover operator
- tabu search
- vehicle routing problem
- hybrid algorithm
- multi objective
- fitness function
- optimization method
- immune clonal
- genetic programming
- ant colony optimization
- job shop scheduling problem
- combinatorial search
- search space
- artificial neural networks
- lower bound
- neural network
- differential evolution
- search algorithm
- benchmark problems
- distributed systems