Improved Ant Colony Optimization for One-Dimensional Bin Packing Problem with Precedence Constraints.
Zeqiang ZhangWenming ChengLiansheng TangYue ChengPublished in: ICNC (4) (2007)
Keyphrases
- ant colony optimization
- precedence constraints
- scheduling problem
- branch and bound algorithm
- metaheuristic
- swarm intelligence
- ant colony
- traveling salesman problem
- aco algorithm
- parallel machines
- particle swarm optimization
- nature inspired
- approximation algorithms
- partially ordered
- ant colony optimization algorithm
- ant colony algorithm
- single machine scheduling problem
- partial order
- combinatorial optimization problems
- artificial ants
- hybrid algorithm
- aco algorithms
- branch and bound
- global constraints
- optimization problems
- search space
- flowshop
- ant colonies
- foraging behavior
- processing times
- tabu search
- upper bound
- np hard
- search algorithm
- simulated annealing
- lower bound
- pheromone trails
- optimal solution
- objective function