GARIMA SINGH - Academia.edu (original) (raw)
Related Authors
Universidad Nacional de Colombia (National University of Colombia)
Uploads
Papers by GARIMA SINGH
Non Dominated Sets always plays vital role in solution strategies for multi objective optimizatio... more Non Dominated Sets always plays vital role in solution strategies for multi objective optimization, as the appropriateness of
the solution is dependent on the selection of the sets hence efficient search for the optimal solution is dependent on the Non
Dominated Sets. Finding Non Dominated set from the set of solutions is very time consuming so to increase the overall
performance of the solution strategy an efficient approach is highly in demand. In this paper we have proposed a Selection
Based Algorithm which finds effective Non Dominated sets among the set of solutions by establishing dominance among
solutions in very less time as compared to the previous approaches
Non Dominated Sets always plays vital role in solution strategies for multi objective optimizatio... more Non Dominated Sets always plays vital role in solution strategies for multi objective optimization, as the appropriateness of
the solution is dependent on the selection of the sets hence efficient search for the optimal solution is dependent on the Non
Dominated Sets. Finding Non Dominated set from the set of solutions is very time consuming so to increase the overall
performance of the solution strategy an efficient approach is highly in demand. In this paper we have proposed a Selection
Based Algorithm which finds effective Non Dominated sets among the set of solutions by establishing dominance among
solutions in very less time as compared to the previous approaches.
Keywords: Non Dominated Sorting, Multi Objective Optimization, Non Dominated Set, Selection Based Approach, Non
Dominance
Ant Colony Optimization (ACO) is a paradigm for designing metaheuristic algorithm for combination... more Ant Colony Optimization (ACO) is a paradigm for designing metaheuristic algorithm for combinational optimization problems. It is a way to solve optimization problems based on the way that ants indirectly communicate directions to each other. The behavior of ants has been documented and the subject of easily writing and fables passed from one century to another century. The successful techniques used by ant colonies have been studied in computer science and robotics to produce distributed and fault tolerance system for solving problems as well as used in fault tolerance storage and networking algorithm. Metaheuristic algorithms are algorithms which, in order to escape from local optima, drive some basic heuristic: either a constructive heuristic, starting from the null solution and adding elements to build a good complete one, or local search heuristic, starting from a complete solution and iteratively modifying some of its elements in order to achieve a better one.
Non Dominated Sets always plays vital role in solution strategies for multi objective optimizatio... more Non Dominated Sets always plays vital role in solution strategies for multi objective optimization, as the appropriateness of
the solution is dependent on the selection of the sets hence efficient search for the optimal solution is dependent on the Non
Dominated Sets. Finding Non Dominated set from the set of solutions is very time consuming so to increase the overall
performance of the solution strategy an efficient approach is highly in demand. In this paper we have proposed a Selection
Based Algorithm which finds effective Non Dominated sets among the set of solutions by establishing dominance among
solutions in very less time as compared to the previous approaches
Non Dominated Sets always plays vital role in solution strategies for multi objective optimizatio... more Non Dominated Sets always plays vital role in solution strategies for multi objective optimization, as the appropriateness of
the solution is dependent on the selection of the sets hence efficient search for the optimal solution is dependent on the Non
Dominated Sets. Finding Non Dominated set from the set of solutions is very time consuming so to increase the overall
performance of the solution strategy an efficient approach is highly in demand. In this paper we have proposed a Selection
Based Algorithm which finds effective Non Dominated sets among the set of solutions by establishing dominance among
solutions in very less time as compared to the previous approaches.
Keywords: Non Dominated Sorting, Multi Objective Optimization, Non Dominated Set, Selection Based Approach, Non
Dominance
Ant Colony Optimization (ACO) is a paradigm for designing metaheuristic algorithm for combination... more Ant Colony Optimization (ACO) is a paradigm for designing metaheuristic algorithm for combinational optimization problems. It is a way to solve optimization problems based on the way that ants indirectly communicate directions to each other. The behavior of ants has been documented and the subject of easily writing and fables passed from one century to another century. The successful techniques used by ant colonies have been studied in computer science and robotics to produce distributed and fault tolerance system for solving problems as well as used in fault tolerance storage and networking algorithm. Metaheuristic algorithms are algorithms which, in order to escape from local optima, drive some basic heuristic: either a constructive heuristic, starting from the null solution and adding elements to build a good complete one, or local search heuristic, starting from a complete solution and iteratively modifying some of its elements in order to achieve a better one.