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

Authors:
Rahul Roy;Satchidananda Dehuri;Sung Bae Cho
Affiliations:
KIIT University, India;Fakir Mohan University, India;Yonsei University, South Korea
Venue:
International Journal of Applied Metaheuristic Computing
Year:
2011

Citing 6
Cited 0

Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
Computers and Intractability; A Guide to the Theory of NP-Completeness

Computers and Intractability; A Guide to the Theory of NP-Completeness
MOPSO: a proposal for multiple objective particle swarm optimization

CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
A fast and elitist multiobjective genetic algorithm: NSGA-II

IEEE Transactions on Evolutionary Computation
Survey: Multi-criterion Pareto based particle swarm optimized polynomial neural network for classification: A review and state-of-the-art

Computer Science Review
A New Approach to Associative Classification Based on Binary Multi-objective Particle Swarm Optimization

International Journal of Applied Metaheuristic Computing

Quantified Score

Hi-index	0.00

Visualization

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.