Cover Image

Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems

The majority of Combinatorial Optimization Problems (COPs) are defined in the discrete space. Hence, proposing an efficient algorithm to solve the problems has become an attractive subject in recent years. In this paper, a meta-heuristic algorithm based on Binary Particle Swarm Algorithm (BPSO) and...

Full description

Saved in:
Bibliographic Details
Main Authors: Beheshti, Zahra, Shamsuddin, Siti Mariyam, Yuhaniz, Siti Sophiayati
Format: Article
Published: Springer Science+Business Media New York 2012
Subjects:
T Technology
Online Access:http://eprints.utm.my/id/eprint/46648/
http://dx.doi.org/10.1007/s10898-012-0006-1
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.utm.46648
record_format eprints
spelling my.utm.466482018-11-13T06:55:07Z http://eprints.utm.my/id/eprint/46648/ Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems Beheshti, Zahra Shamsuddin, Siti Mariyam Yuhaniz, Siti Sophiayati T Technology The majority of Combinatorial Optimization Problems (COPs) are defined in the discrete space. Hence, proposing an efficient algorithm to solve the problems has become an attractive subject in recent years. In this paper, a meta-heuristic algorithm based on Binary Particle Swarm Algorithm (BPSO) and the governing Newtonian motion laws, so-called Binary Accelerated Particle Swarm Algorithm (BAPSA) is offered for discrete search spaces. The method is presented in two global and local topologies and evaluated on the 0–1 Multidimensional Knapsack Problem (MKP) as a famous problem in the class of COPs and NP-hard problems. Besides, the results are compared with BPSO for both global and local topologies as well as Genetic Algorithm (GA). We applied three methods of Penalty Function (PF) technique, Check-and-Drop (CD) and Improved Check-and-Repair Operator (ICRO) algorithms to solve the problem of infeasible solutions in the 0–1 MKP. Experimental results show that the proposed methods have better performance than BPSO and GA especially when ICRO algorithm is applied to convert infeasible solutions to feasible ones. Springer Science+Business Media New York 2012 Article PeerReviewed Beheshti, Zahra and Shamsuddin, Siti Mariyam and Yuhaniz, Siti Sophiayati (2012) Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems. Journal of Global Optimization . pp. 1-25. ISSN 0925-5001 http://dx.doi.org/10.1007/s10898-012-0006-1 DOI: 10.1007/s10898-012-0006-1
institution Universiti Teknologi Malaysia
building UTM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Malaysia
content_source UTM Institutional Repository
url_provider http://eprints.utm.my/
topic T Technology
spellingShingle T Technology
Beheshti, Zahra
Shamsuddin, Siti Mariyam
Yuhaniz, Siti Sophiayati
Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems
description The majority of Combinatorial Optimization Problems (COPs) are defined in the discrete space. Hence, proposing an efficient algorithm to solve the problems has become an attractive subject in recent years. In this paper, a meta-heuristic algorithm based on Binary Particle Swarm Algorithm (BPSO) and the governing Newtonian motion laws, so-called Binary Accelerated Particle Swarm Algorithm (BAPSA) is offered for discrete search spaces. The method is presented in two global and local topologies and evaluated on the 0–1 Multidimensional Knapsack Problem (MKP) as a famous problem in the class of COPs and NP-hard problems. Besides, the results are compared with BPSO for both global and local topologies as well as Genetic Algorithm (GA). We applied three methods of Penalty Function (PF) technique, Check-and-Drop (CD) and Improved Check-and-Repair Operator (ICRO) algorithms to solve the problem of infeasible solutions in the 0–1 MKP. Experimental results show that the proposed methods have better performance than BPSO and GA especially when ICRO algorithm is applied to convert infeasible solutions to feasible ones.
format Article
author Beheshti, Zahra
Shamsuddin, Siti Mariyam
Yuhaniz, Siti Sophiayati
author_facet Beheshti, Zahra
Shamsuddin, Siti Mariyam
Yuhaniz, Siti Sophiayati
author_sort Beheshti, Zahra
title Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems
title_short Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems
title_full Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems
title_fullStr Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems
title_full_unstemmed Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems
title_sort binary accelerated particle swarm algorithm (bapsa) for discrete optimization problems
publisher Springer Science+Business Media New York
publishDate 2012
url http://eprints.utm.my/id/eprint/46648/
http://dx.doi.org/10.1007/s10898-012-0006-1
_version_ 1643652097620574208
score 13.211869

Similar Items