Cooperation between Branch and Bound and Evolutionary Approaches to Solve a Bi-objective Flow Shop Problem.
Matthieu BasseurJulien LemesreClarisse DhaenensEl-Ghazali TalbiPublished in: WEA (2004)
Keyphrases
- branch and bound
- bi objective
- flowshop
- evolutionary approaches
- scheduling problem
- lower bound
- branch and bound algorithm
- search algorithm
- scatter search
- ant colony optimization
- search space
- combinatorial optimization
- optimal solution
- column generation
- metaheuristic
- upper bound
- tabu search
- efficient solutions
- multi objective
- evolutionary computation
- genetic programming
- special case
- network design
- search strategies
- integer program
- multi objective optimization
- genetic algorithm
- multistage
- np hard
- nsga ii
- shortest path problem
- computational intelligence
- knapsack problem
- evolutionary algorithm
- test problems
- optimization problems
- lagrangian relaxation
- feasible solution