Biased random-key genetic algorithms for combinatorial optimization.
José Fernando GonçalvesMauricio G. C. ResendePublished in: J. Heuristics (2011)
Keyphrases
- combinatorial optimization
- simulated annealing
- metaheuristic
- genetic algorithm
- combinatorial optimization problems
- traveling salesman problem
- memetic algorithm
- branch and bound
- combinatorial problems
- evolutionary algorithm
- mathematical programming
- branch and bound algorithm
- vehicle routing problem
- optimization problems
- tabu search
- hard combinatorial optimization problems
- artificial neural networks
- job shop scheduling problem
- search space
- fitness function
- optimal solution
- ant colony optimization
- hybrid algorithm
- np complete
- single machine scheduling problem
- initial population
- particle swarm optimization
- optimization algorithm
- benchmark problems
- constraint satisfaction problems
- evolutionary computation
- graph theory
- pairwise
- scheduling problem
- estimation of distribution algorithms
- quadratic assignment problem
- scatter search
- combinatorial search
- neural network