Supporting fault-tolerance for time-critical events in distributed environments
Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis
PROJECT method for multiobjective optimization based on gradient projection and reference points
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Conservation of information in search: measuring the cost of success
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Risk assessment of malicious attacks against power systems
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Supporting fault-tolerance for time-critical events in distributed environments
Scientific Programming
Resource provisioning with budget constraints for adaptive applications in cloud environments
Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing
Integrating clustering and supervised learning for categorical data analysis
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
On convergence of the multi-objective particle swarm optimizers
Information Sciences: an International Journal
Engineering Applications of Artificial Intelligence
Correlative particle swarm optimization for multi-objective problems
ICSI'11 Proceedings of the Second international conference on Advances in swarm intelligence - Volume Part II
An innovation approach for achieving cost optimization in supply chain management
Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
Hi-index | 0.00 |
This paper proposes an interactive particle-swarm metaheuristic for multiobjective optimization (MOO) that seeks to encapsulate the positive aspects of the widely used approaches, namely, Pareto dominance and interactive decision making in its solution mechanism. Pareto dominance is adopted as the criterion to evaluate the particles found along the search process. Nondominated particles are stored in an external repository which updates continuously through the adaptive-grid mechanism proposed. The approach is further strengthened by the incorporation of a self-adaptive mutation operator. A decision maker (DM) is provided with the knowledge of an approximate Pareto optimal front, and his/her preference articulations are used to derive a utility function intended to calculate the utility of the existing and upcoming solutions. The incubation of particle-swarm mechanism for the MOO by incorporating an adaptive-grid mechanism, a self-adaptive mutation operator, and a novel decision-making strategy makes it a novel and efficient approach. Simulation results on various test functions indicate that the proposed metaheuristic identifies not only the best preferred solution with a greater accuracy but also presents a uniformly diverse high utility Pareto front without putting excessive cognitive load on the DM. The practical relevance of the proposed strategy is very high in the cases that involve the simultaneous use of decision making and availability of highly favored alternatives.