Scheduling single batching machine with non-identical job sizes using adaptive ant colony simulated annealing algorithm
不同尺寸工件批调度问题的自适应蚁群退火算法

This paper considerd the problem of minimizing makespan with non-identical job sizes on a single batch processing machine. Presented an adaptive ant colony simulated annealing algorithm. The algorithm adopted simulated annealing policy to implement a new mixed strategy to update pheromone, and also presented an adaptive state transition probability. This adaptive state transition probability could effectively avoid search stagnation of the algorithm. The experimental results show that AACSA has better performance than BACO(batch ant colony optimization algorithm),SA(simulated annealing) and the heuristic BFLPT.