Branch-and-bound and simulated annealing algorithms for a two-agent scheduling problem.
Wen-Chiung LeeShiuan-Kang ChenChin-Chia WuPublished in: Expert Syst. Appl. (2010)
Keyphrases
- branch and bound
- combinatorial optimization
- simulated annealing
- scheduling problem
- search algorithm
- branch and bound algorithm
- lower bound
- beam search
- depth first search
- upper bound
- tree search
- column generation
- optimization problems
- branch and bound search
- np hard
- evolutionary algorithm
- multi agent systems
- multi agent
- genetic algorithm
- randomly generated problems
- tabu search
- search space
- computational complexity
- hybrid algorithm
- optimal solution
- tree search algorithm
- partial solutions
- worst case
- multi objective
- bayesian networks