PSO algorithm for a scheduling parallel unit batch process with batching

Authors:
Ping Yan;Lixin Tang
Affiliations:
The Key Laboratory of Integrated Automation of Process Industry, Northeastern University, Shenyang, China;Liaoning Key Laboratory of Manufacturing System and Logistics, The Logistics Institute, Northeastern University, Shenyang, China
Venue:
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
Year:
2009

Citing 1
Cited 1

Differential Evolution – A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces

Journal of Global Optimization

Convergence time analysis of particle swarm optimization based on particle interaction

Advances in Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a parallel unit batch process scheduling problem (PBPSP) integrating batching decision is investigated. The batch scheduling problem is to convert the demands for products into sets of batches and schedule these batches on the units such that makespan is minimized. We propose a Particle Swarm Optimization (PSO) algorithm to solve this problem where a novel particle solution representation is designed for representing a batching scheme for PBPSP and a scale-based repair procedure is introduced to make particles feasible. In addition, the proposed PSO is combined with a relatively current evolutionary algorithm known as Differential Evolution (DE) for enhance the performance of PSO. A mixed integer linear programming (MILP) formulation is also given and used to calculate a lower bound for comparison with the PSO solutions. Computational results indicated the validity and effectiveness of the proposed PSO.