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

Saved in:
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:en
Published: United Kingdom Simulation Society 2014
Subjects:
Online Access:http://umpir.ump.edu.my/id/eprint/6412/1/Multi-State_Particle_Swarm_Optimization_for_Discrete_Combinatorial_Optimization_Problem.pdf
http://umpir.ump.edu.my/id/eprint/6412/
http://ijssst.info/Vol-15/No-1/paper3.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1831521950466310144
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
building UMPSA Library
collection Institutional Repository
content_provider Universiti Malaysia Pahang Al-Sultan Abdullah
content_source UMPSA Institutional Repository
continent Asia
country Malaysia
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
id my.ump.umpir.6412
institution Universiti Malaysia Pahang
language en
publishDate 2014
publisher United Kingdom Simulation Society
record_format eprints
spelling my.ump.umpir.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). (Published) http://ijssst.info/Vol-15/No-1/paper3.pdf
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
title 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_short Multi-State Particle Swarm Optimization for Discrete Combinatorial Optimization Problem
title_sort multi-state particle swarm optimization for discrete combinatorial optimization problem
topic TS Manufactures
TK Electrical engineering. Electronics Nuclear engineering
url http://umpir.ump.edu.my/id/eprint/6412/1/Multi-State_Particle_Swarm_Optimization_for_Discrete_Combinatorial_Optimization_Problem.pdf
http://umpir.ump.edu.my/id/eprint/6412/
http://ijssst.info/Vol-15/No-1/paper3.pdf
url_provider http://umpir.ump.edu.my/