Global Optimum Distance Evaluated Particle Swarm Optimization for Combinatorial Optimization Problem

Global Optimum Distance Evaluated Particle Swarm Optimization for Combinatorial Optimization Problem

Based on the mechanism of Particle Swarm Optimization (PSO) measurement process, every particle estimates the global minimum/maximum. Particles communicate among them to update and improve the solution during the search process. However, the PSO is only capable to solve continuous numerical optimiza...

Full description

Bibliographic Details
Main Authors: Ainizar, Mustapa, Zuwairie, Ibrahim, Zulkifli, Md. Yusof, Ismail, Ibrahim
Format: Conference or Workshop Item
Language:English
Published: Universiti Malaysia Pahang 2016
Subjects:
TK Electrical engineering. Electronics Nuclear engineering
Online Access:http://umpir.ump.edu.my/id/eprint/15530/
http://umpir.ump.edu.my/id/eprint/15530/
http://umpir.ump.edu.my/id/eprint/15530/1/P126%20pg943-950.pdf
id ump-15530
recordtype eprints
spelling ump-155302018-02-08T00:38:06Z http://umpir.ump.edu.my/id/eprint/15530/ Global Optimum Distance Evaluated Particle Swarm Optimization for Combinatorial Optimization Problem Ainizar, Mustapa Zuwairie, Ibrahim Zulkifli, Md. Yusof Ismail, Ibrahim TK Electrical engineering. Electronics Nuclear engineering Based on the mechanism of Particle Swarm Optimization (PSO) measurement process, every particle estimates the global minimum/maximum. Particles communicate among them to update and improve the solution during the search process. However, the PSO is only capable to solve continuous numerical optimization problem. In order to solve discrete optimization problems, a new global optimum distance evaluated approach is proposed and combined with PSO. A set of traveling salesman problems (TSP) are used to evaluate the performance of the proposed global optimum distance evaluated PSO (GO-DEPSO). Based on the analysis of experimental results, we found that the proposed DEPSO is capable to solve discrete optimization problems using TSP. Universiti Malaysia Pahang 2016 Conference or Workshop Item PeerReviewed application/pdf en http://umpir.ump.edu.my/id/eprint/15530/1/P126%20pg943-950.pdf Ainizar, Mustapa and Zuwairie, Ibrahim and Zulkifli, Md. Yusof and Ismail, Ibrahim (2016) Global Optimum Distance Evaluated Particle Swarm Optimization for Combinatorial Optimization Problem. In: Proceedings of The National Conference for Postgraduate Research (NCON-PGR 2016), 24-25 September 2016 , Universiti Malaysia Pahang (UMP), Pekan, Pahang. pp. 943-950.. http://ee.ump.edu.my/ncon/wp-content/uploads/2016/10/Proceeding-NCON-PGR-2016.zip
repository_type Digital Repository
institution_category Local University
institution Universiti Malaysia Pahang
building UMP Institutional Repository
collection Online Access
language English
topic TK Electrical engineering. Electronics Nuclear engineering
spellingShingle TK Electrical engineering. Electronics Nuclear engineering
Ainizar, Mustapa
Zuwairie, Ibrahim
Zulkifli, Md. Yusof
Ismail, Ibrahim
Global Optimum Distance Evaluated Particle Swarm Optimization for Combinatorial Optimization Problem
description Based on the mechanism of Particle Swarm Optimization (PSO) measurement process, every particle estimates the global minimum/maximum. Particles communicate among them to update and improve the solution during the search process. However, the PSO is only capable to solve continuous numerical optimization problem. In order to solve discrete optimization problems, a new global optimum distance evaluated approach is proposed and combined with PSO. A set of traveling salesman problems (TSP) are used to evaluate the performance of the proposed global optimum distance evaluated PSO (GO-DEPSO). Based on the analysis of experimental results, we found that the proposed DEPSO is capable to solve discrete optimization problems using TSP.
format Conference or Workshop Item
author Ainizar, Mustapa
Zuwairie, Ibrahim
Zulkifli, Md. Yusof
Ismail, Ibrahim
author_facet Ainizar, Mustapa
Zuwairie, Ibrahim
Zulkifli, Md. Yusof
Ismail, Ibrahim
author_sort Ainizar, Mustapa
title Global Optimum Distance Evaluated Particle Swarm Optimization for Combinatorial Optimization Problem
title_short Global Optimum Distance Evaluated Particle Swarm Optimization for Combinatorial Optimization Problem
title_full Global Optimum Distance Evaluated Particle Swarm Optimization for Combinatorial Optimization Problem
title_fullStr Global Optimum Distance Evaluated Particle Swarm Optimization for Combinatorial Optimization Problem
title_full_unstemmed Global Optimum Distance Evaluated Particle Swarm Optimization for Combinatorial Optimization Problem
title_sort global optimum distance evaluated particle swarm optimization for combinatorial optimization problem
publisher Universiti Malaysia Pahang
publishDate 2016
url http://umpir.ump.edu.my/id/eprint/15530/
http://umpir.ump.edu.my/id/eprint/15530/
http://umpir.ump.edu.my/id/eprint/15530/1/P126%20pg943-950.pdf
first_indexed 2023-09-18T22:20:17Z
last_indexed 2023-09-18T22:20:17Z
_version_ 1777415610898055168

Similar Items