Performance Evaluation Of Different Types Of Particle Representation Procedures Of Particle Swarm Optimization In Job-Shop Scheduling Problems
This paper addresses the types of particle representation (encoding) procedures in a population-based stochastic optimization technique in solving scheduling problems known in the job-shop manufacturing environment. It intends to evaluate and compare the performance of different particle representat...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IOP Publishing
2016
|
| Subjects: | |
| Online Access: | http://eprints.utem.edu.my/id/eprint/17261/1/Performance%20Evaluation%20Of%20Different%20Types%20Of%20Particle%20Representation%20Procedures%20Of%20Particle%20Swarm%20Optimization%20In%20Job-Shop%20Scheduling%20Problems.pdf http://eprints.utem.edu.my/id/eprint/17261/ http://iopscience.iop.org/article/10.1088/1757-899X/114/1/012055/pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | This paper addresses the types of particle representation (encoding) procedures in a population-based stochastic optimization technique in solving scheduling problems known in the job-shop manufacturing environment. It intends to evaluate and compare the performance of different particle representation procedures in Particle Swarm Optimization (PSO) in the case of solving Job-shop Scheduling Problems (JSP). Particle representation procedures refer to the mapping between the particle position in PSO and the scheduling solution in JSP. It is an important step to be carried out so that each particle in PSO can represent a schedule in JSP. Three procedures such as Operation and Particle Position Sequence (OPPS), random keys representation and random-key encoding scheme are used in this study. These procedures have been tested on FT06 and FT10 benchmark problems available in the OR-Library, where the objective function is to minimize the makespan by the use of MATLAB software. Based on the experimental results, it is discovered that OPPS gives the best performance in solving both benchmark problems. The contribution of this paper is the fact that it demonstrates to the practitioners involved in complex scheduling problems that different particle representation procedures can have significant effects on the performance of PSO in solving JSP. |
|---|