表紙画像

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...

詳細記述

保存先:
書誌詳細
主要な著者: Nurul Izah, Anuar, Adi, Saptari
フォーマット: 論文
言語:English
出版事項: IOP Publishing 2016
主題:
T Technology (General)
オンライン･アクセス: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
タグ: タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
id my.utem.eprints.17261
record_format eprints
spelling my.utem.eprints.172612021-09-12T16:17:40Z http://eprints.utem.edu.my/id/eprint/17261/ Performance Evaluation Of Different Types Of Particle Representation Procedures Of Particle Swarm Optimization In Job-Shop Scheduling Problems Nurul Izah, Anuar Adi, Saptari T Technology (General) 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. IOP Publishing 2016 Article PeerReviewed text en 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 Nurul Izah, Anuar and Adi, Saptari (2016) Performance Evaluation Of Different Types Of Particle Representation Procedures Of Particle Swarm Optimization In Job-Shop Scheduling Problems. IOP Conference Series: Materials Science And Engineering, 114 (1). pp. 1-5. ISSN 1757-8981 http://iopscience.iop.org/article/10.1088/1757-899X/114/1/012055/pdf 10.1088/1757-899X/114/1/012055
institution Universiti Teknikal Malaysia Melaka
building UTEM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknikal Malaysia Melaka
content_source UTEM Institutional Repository
url_provider http://eprints.utem.edu.my/
language English
topic T Technology (General)
spellingShingle T Technology (General)
Nurul Izah, Anuar
Adi, Saptari
Performance Evaluation Of Different Types Of Particle Representation Procedures Of Particle Swarm Optimization In Job-Shop Scheduling Problems
description 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.
format Article
author Nurul Izah, Anuar
Adi, Saptari
author_facet Nurul Izah, Anuar
Adi, Saptari
author_sort Nurul Izah, Anuar
title Performance Evaluation Of Different Types Of Particle Representation Procedures Of Particle Swarm Optimization In Job-Shop Scheduling Problems
title_short Performance Evaluation Of Different Types Of Particle Representation Procedures Of Particle Swarm Optimization In Job-Shop Scheduling Problems
title_full Performance Evaluation Of Different Types Of Particle Representation Procedures Of Particle Swarm Optimization In Job-Shop Scheduling Problems
title_fullStr Performance Evaluation Of Different Types Of Particle Representation Procedures Of Particle Swarm Optimization In Job-Shop Scheduling Problems
title_full_unstemmed Performance Evaluation Of Different Types Of Particle Representation Procedures Of Particle Swarm Optimization In Job-Shop Scheduling Problems
title_sort performance evaluation of different types of particle representation procedures of particle swarm optimization in job-shop scheduling problems
publisher IOP Publishing
publishDate 2016
url 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
_version_ 1712288910936113152
score 13.250246

類似資料