Evolving solutions of mixed-model assembly line balancing problems by chaining heuristic optimization methods: track: evolutionary combinatorial optimization and meta-heuristics.
Santiago Enrique Conant-PablosHalley Jarumy Ferrer-SorianoHugo Terashima-MarínPublished in: GECCO (Companion) (2011)
Keyphrases
- combinatorial optimization
- metaheuristic
- optimization problems
- simulated annealing
- optimization methods
- combinatorial problems
- combinatorial optimization problems
- optimization method
- objective function
- benchmark problems
- traveling salesman problem
- branch and bound
- hard combinatorial optimization problems
- tabu search
- search methods
- genetic algorithm
- mathematical programming
- memetic algorithm
- assembly line balancing
- benchmark instances
- exact algorithms
- optimal solution
- goal programming
- evolutionary algorithm
- cost function
- path relinking
- ant colony optimization
- heuristic methods
- vehicle routing problem
- solution quality
- job shop scheduling problem
- search algorithm
- multiple criteria decision making
- branch and bound algorithm
- special case
- simulated annealing and tabu search