Evolving ant colony system for large-sized integrated process planning and scheduling problem considering sequence-dependent setup times

摘要

This paper proposes a new ant colony optimization (ACO) algorithm suitable for integrated process planning and scheduling (IPPS) that optimizes both process planning and scheduling simultaneously. The IPPS covered in this study, when compared to the conventional IPPS, is more flexible and complicated because sequence-dependent setups and tool-related capacity constraints are additionally considered. Traditional ACOs have limitations in improving the solution quality and computation time for IPPS. The high flexibility and complexity of IPPS requires a large size of repository for pheromone trails and it causes the long computation time for updating them, excessive evaporation of pheromones, and unbalancing between pheromones and desirability. In the proposed ACO, each ant agent improves their own incumbent solution or finds a new solution using the pheromone trails that is composed of the experience information of the colony. Therefore, the proposed ACO conducts individual and cooperative evolving at the same time. Furthermore, we propose a simplified updating rule for pheromone trails and standardization of the transition probability to increase efficiency of the algorithm. Experimental results show that the proposed ACO is superior to recently proposed meta-heuristics for benchmark problems of different sizes in terms of both solution quality and computation time.