Reference Hub32
A Novel Particle Swarm Optimization Algorithm for Multi-Objective Combinatorial Optimization Problem

A Novel Particle Swarm Optimization Algorithm for Multi-Objective Combinatorial Optimization Problem

Rahul Roy, Satchidananda Dehuri, Sung Bae Cho
Copyright: © 2011 |Volume: 2 |Issue: 4 |Pages: 17
ISSN: 1947-8283|EISSN: 1947-8291|EISBN13: 9781613505700|DOI: 10.4018/jamc.2011100104
Cite Article Cite Article

MLA

Roy, Rahul, et al. "A Novel Particle Swarm Optimization Algorithm for Multi-Objective Combinatorial Optimization Problem." IJAMC vol.2, no.4 2011: pp.41-57. http://doi.org/10.4018/jamc.2011100104

APA

Roy, R., Dehuri, S., & Cho, S. B. (2011). A Novel Particle Swarm Optimization Algorithm for Multi-Objective Combinatorial Optimization Problem. International Journal of Applied Metaheuristic Computing (IJAMC), 2(4), 41-57. http://doi.org/10.4018/jamc.2011100104

Chicago

Roy, Rahul, Satchidananda Dehuri, and Sung Bae Cho. "A Novel Particle Swarm Optimization Algorithm for Multi-Objective Combinatorial Optimization Problem," International Journal of Applied Metaheuristic Computing (IJAMC) 2, no.4: 41-57. http://doi.org/10.4018/jamc.2011100104

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

The Combinatorial problems are real world decision making problem with discrete and disjunctive choices. When these decision making problems involve more than one conflicting objective and constraint, it turns the polynomial time problem into NP-hard. Thus, the straight forward approaches to solve multi-objective problems would not give an optimal solution. In such case evolutionary based meta-heuristic approaches are found suitable. In this paper, a novel particle swarm optimization based meta-heuristic algorithm is presented to solve multi-objective combinatorial optimization problems. Here a mapping method is considered to convert the binary and discrete values (solution encoded as particles) to a continuous domain and update it using the velocity and position update equation of particle swarm optimization to find new set of solutions in continuous domain and demap it to discrete values. The performance of the algorithm is compared with other evolutionary strategy like SPEA and NSGA-II on pseudo-Boolean discrete problems and multi-objective 0/1 knapsack problem. The experimental results confirmed the better performance of combinatorial particle swarm optimization algorithm.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.