Preference incorporation into many-objective optimization: An Ant colony algorithm based on interval outranking
نویسندگان
چکیده
In this paper, we enriched Ant Colony Optimization (ACO) with interval outranking to develop a novel multi-objective ACO optimizer approach problems many objective functions. This proposal is suitable if the preferences of Decision Maker (DM) can be modeled through relations. The introduced algorithm (Interval Outranking-based ACO, IO-ACO) first ant-colony that embeds an model bear vagueness and ill-definition DM's preferences. capacity most differentiating feature IO-ACO because issue highly relevant in practice. biases search towards Region Interest (RoI), privileged zone Pareto frontier containing solutions better match Two widely studied benchmarks were utilized measure efficiency IO-ACO, i.e., DTLZ WFG test suites. Accordingly, was compared four competitive optimizers: Indicator-based Many-Objective Multi-objective Evolutionary Algorithm Based on Decomposition, Reference Vector-Guided using Improved Growing Neural Gas, Point Adaptation. numerical results show approximates RoI than leading metaheuristics based approximating alone.
منابع مشابه
An Ant Colony Optimization Algorithm for Network Vulnerability Analysis
Intruders often combine exploits against multiple vulnerabilities in order to break into the system. Each attack scenario is a sequence of exploits launched by an intruder that leads to an undesirable state such as access to a database, service disruption, etc. The collection of possible attack scenarios in a computer network can be represented by a directed graph, called network attack gra...
متن کاملMulti-Objective Multicast Routing based on Ant Colony Optimization
This work presents a new multiobjective algorithm based on ant colonies, which is used in the construction of the multicast tree for data transmission in a computer network. The proposed algorithm simultaneously optimizes cost of the multicast tree, average delay and maximum end-to-end delay. In this way, a set of optimal solutions, know as Pareto set, is calculated in only one run of the algor...
متن کاملAnt Colony Optimization Algorithm
Hybrid algorithm is proposed to solve combinatorial optimization problem by using Ant Colony and Genetic programming algorithms. Evolutionary process of Ant Colony Optimization algorithm adapts genetic operations to enhance ant movement towards solution state. The algorithm converges to the optimal final solution, by accumulating the most effective sub-solutions.
متن کاملAnt Colony Optimization for Multi-objective Digital Convergent Product Network
Convergent product is an assembly shape concept integrating functions and sub-functions to form a final product. To conceptualize the convergent product problem, a web-based network is considered in which a collection of base functions and sub-functions configure the nodes and each arc in the network is considered to be a link between two nodes. The aim is to find an optimal tree of functionali...
متن کاملMulti-objective Reconfiguration of Distribution Network Using a Heuristic Modified Ant Colony Optimization Algorithm
In this paper, a multi-objective reconfiguration problem has been solved simultaneously by a modified ant colony optimization algorithm. Two objective functions, real power loss and energy not supplied index (ENS), were utilized. Multi-objective modified ant colony optimization algorithm has been generated by adding non-dominated sorting technique and changing the pheromone updating rule of ori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Swarm and evolutionary computation
سال: 2022
ISSN: ['2210-6502', '2210-6510']
DOI: https://doi.org/10.1016/j.swevo.2021.101024