UMP Institutional Repository

Global Optimum Distance Evaluated Particle Swarm Optimization for Combinatorial Optimization Problem

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

[img]
Preview
PDF
P126 pg943-950.pdf

Download (611kB) | Preview

Abstract

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.

Item Type: Conference or Workshop Item (Lecture)
Uncontrolled Keywords: Particle Swarm Optimization; Distance Evaluated; Combinatorial; Traveling Salesman Problems
Subjects: T Technology > TK Electrical engineering. Electronics Nuclear engineering
Faculty/Division: Faculty of Electrical & Electronic Engineering
Depositing User: Noorul Farina Arifin
Date Deposited: 28 Nov 2016 03:33
Last Modified: 08 Feb 2018 00:38
URI: http://umpir.ump.edu.my/id/eprint/15530
Download Statistic: View Download Statistics

Actions (login required)

View Item View Item