Multi-State Particle Swarm Optimization for Discrete Combinatorial Optimization Problem

The binary-based algorithms including the binary particle swarm optimization (BPSO) algorithm are proposed to solve discrete optimization problems. Many works have focused on the improvement of the binary-based algorithms. Yet, none of these works have been represented in states. In this paper, by...

Full description

Bibliographic Details
Main Authors:	Ismail, Ibrahim, Hamzah, Ahmad, Zuwairie, Ibrahim, Mohd Falfazli, Mat Jusof, Zulkifli, Md. Yusof, Sophan Wahyudi, Nawawi, Kamal, Khalil, Muhammad Arif, Abdul Rahim
Format:	Article
Language:	English
Published:	United Kingdom Simulation Society 2014
Subjects:	TS Manufactures TK Electrical engineering. Electronics Nuclear engineering
Online Access:	http://umpir.ump.edu.my/id/eprint/6412/ http://umpir.ump.edu.my/id/eprint/6412/ http://umpir.ump.edu.my/id/eprint/6412/1/Multi-State_Particle_Swarm_Optimization_for_Discrete_Combinatorial_Optimization_Problem.pdf

id	ump-6412
recordtype	eprints
spelling	ump-64122018-02-21T03:38:52Z http://umpir.ump.edu.my/id/eprint/6412/ Multi-State Particle Swarm Optimization for Discrete Combinatorial Optimization Problem Ismail, Ibrahim Hamzah, Ahmad Zuwairie, Ibrahim Mohd Falfazli, Mat Jusof Zulkifli, Md. Yusof Sophan Wahyudi, Nawawi Kamal, Khalil Muhammad Arif, Abdul Rahim TS Manufactures TK Electrical engineering. Electronics Nuclear engineering The binary-based algorithms including the binary particle swarm optimization (BPSO) algorithm are proposed to solve discrete optimization problems. Many works have focused on the improvement of the binary-based algorithms. Yet, none of these works have been represented in states. In this paper, by implementing the representation of state in particle swarm optimization (PSO), a variant of PSO called multi-state particle swarm optimization (MSPSO) algorithm is proposed. The proposed algorithm works based on a simplified mechanism of transition between two states. The performance of MSPSO algorithm is emperically compared to BPSO and other two binary-based algorithms on six sets of selected benchmarks instances of traveling salesman problem (TSP). The experimental results showed that the newly introduced approach manage to obtain comparable results, compared to other algorithms in consideration. United Kingdom Simulation Society 2014 Article PeerReviewed application/pdf en http://umpir.ump.edu.my/id/eprint/6412/1/Multi-State_Particle_Swarm_Optimization_for_Discrete_Combinatorial_Optimization_Problem.pdf Ismail, Ibrahim and Hamzah, Ahmad and Zuwairie, Ibrahim and Mohd Falfazli, Mat Jusof and Zulkifli, Md. Yusof and Sophan Wahyudi, Nawawi and Kamal, Khalil and Muhammad Arif, Abdul Rahim (2014) Multi-State Particle Swarm Optimization for Discrete Combinatorial Optimization Problem. International Journal of Simulation: Systems, Science & Technology (IJSSST), 15 (1). pp. 15-25. ISSN 1473-8031 (print); 1473-804x (online) http://ijssst.info/Vol-15/No-1/paper3.pdf
repository_type	Digital Repository
institution_category	Local University
institution	Universiti Malaysia Pahang
building	UMP Institutional Repository
collection	Online Access
language	English
topic	TS Manufactures TK Electrical engineering. Electronics Nuclear engineering
spellingShingle	TS Manufactures TK Electrical engineering. Electronics Nuclear engineering Ismail, Ibrahim Hamzah, Ahmad Zuwairie, Ibrahim Mohd Falfazli, Mat Jusof Zulkifli, Md. Yusof Sophan Wahyudi, Nawawi Kamal, Khalil Muhammad Arif, Abdul Rahim Multi-State Particle Swarm Optimization for Discrete Combinatorial Optimization Problem
description	The binary-based algorithms including the binary particle swarm optimization (BPSO) algorithm are proposed to solve discrete optimization problems. Many works have focused on the improvement of the binary-based algorithms. Yet, none of these works have been represented in states. In this paper, by implementing the representation of state in particle swarm optimization (PSO), a variant of PSO called multi-state particle swarm optimization (MSPSO) algorithm is proposed. The proposed algorithm works based on a simplified mechanism of transition between two states. The performance of MSPSO algorithm is emperically compared to BPSO and other two binary-based algorithms on six sets of selected benchmarks instances of traveling salesman problem (TSP). The experimental results showed that the newly introduced approach manage to obtain comparable results, compared to other algorithms in consideration.
format	Article
author	Ismail, Ibrahim Hamzah, Ahmad Zuwairie, Ibrahim Mohd Falfazli, Mat Jusof Zulkifli, Md. Yusof Sophan Wahyudi, Nawawi Kamal, Khalil Muhammad Arif, Abdul Rahim
author_facet	Ismail, Ibrahim Hamzah, Ahmad Zuwairie, Ibrahim Mohd Falfazli, Mat Jusof Zulkifli, Md. Yusof Sophan Wahyudi, Nawawi Kamal, Khalil Muhammad Arif, Abdul Rahim
author_sort	Ismail, Ibrahim
title	Multi-State Particle Swarm Optimization for Discrete Combinatorial Optimization Problem
title_short	Multi-State Particle Swarm Optimization for Discrete Combinatorial Optimization Problem
title_full	Multi-State Particle Swarm Optimization for Discrete Combinatorial Optimization Problem
title_fullStr	Multi-State Particle Swarm Optimization for Discrete Combinatorial Optimization Problem
title_full_unstemmed	Multi-State Particle Swarm Optimization for Discrete Combinatorial Optimization Problem
title_sort	multi-state particle swarm optimization for discrete combinatorial optimization problem
publisher	United Kingdom Simulation Society
publishDate	2014
url	http://umpir.ump.edu.my/id/eprint/6412/ http://umpir.ump.edu.my/id/eprint/6412/ http://umpir.ump.edu.my/id/eprint/6412/1/Multi-State_Particle_Swarm_Optimization_for_Discrete_Combinatorial_Optimization_Problem.pdf
first_indexed	2023-09-18T22:02:08Z
last_indexed	2023-09-18T22:02:08Z
_version_	1777414468966285312

Multi-State Particle Swarm Optimization for Discrete Combinatorial Optimization Problem

Similar Items