نتایج جستجو برای: non dominated sorting algorithm

تعداد نتایج: 2056494  

Journal: :Fundam. Inform. 2008
Ashish Ghosh Mrinal Kanti Das

In this paper a new concept of ranking among the solutions of the same front, along with elite preservation mechanism and ensuring diversity through the nearest neighbor method is proposed for multi-objective genetic algorithms. This algorithm is applied on a set of benchmark multi-objective test problems and the results are compared with that of NSGA-II (a similar algorithm). The proposed algo...

Journal: :ACM/IMS transactions on data science 2021

The scheduling of multi-user remote laboratories is modeled as a multimodal function for the proposed optimization algorithm. hybrid algorithm, hybridization Nelder-Mead Simplex and Non-dominated Sorting Genetic Algorithm (NSGA), named (SNSGA), to optimize timetable problem coordinate shared access. algorithm utilizes in terms exploration NSGA sorting local optimum points with consideration pot...

2014
Sudeshna Mukharjee Sudipta Ghosh

In this paper we have developed a new technique to determine optimal solution to box pushing problem by two robots . Non-Dominated sorting genetic algorithm and Biogeography-based optimization algorithm are combined to obtain optimal solution. A modified algorithm is developed to obtain better energy and time optimization to the box pushing problem.

Journal: :Applied sciences 2023

To address the issues of low efficiency and lengthy running time associated with trajectory planning for 6-degree-of-freedom manipulators, this paper introduces a novel solution that generates time-optimal path manipulator while adhering to its kinematic limitations. The proposed method comprises several stages. Firstly, kinematics are analyzed. Secondly, manipulator’s joint-space points interp...

Journal: :Iraqi journal of science 2021

A hybrid particulate swarm optimization (hybrid) combination of an algorithm the particle and a variable neighborhood search is proposed for multi-objective permutation flow shop scheduling problem (PFSP) with smallest cumulative completion time total time. Algorithm (HPSO) applied to maintain fair centralized decentralized search. The Nawaz-Enscore-Ham )NEH) heuristic in this used initialize p...

In this article, the multi-objective optimization of cylindrical aluminum tubes under axial impact load is presented.The absorbed energy and the specific absorbed energy (SEA) are considered as objective functions while the maximum crush load should not exceed allowable limit. The geometric dimensions of tubes including diameter, length and thickness are chosen as design variables. The Non-domi...

With the huge global and wide range of attention placed upon quality, promoting and optimize the reliability of the products during the design process has turned out to be a high priority. In this study, the researcher have adopted one of the existing models in the reliability science and propose a bi-objective model for redundancy allocation in the series-parallel systems in accordance with th...

Journal: :international journal of industrial mathematics 2015
s. sedehzadeh‎ r. tavakkoli-‎moghaddam‎‎ f. jolai‎

one main group of a transportation network is a discrete hub covering problem that seeks to minimize the total transportation cost. this paper presents a multi-product and multi-mode hub covering model, in which the transportation time depends on travelling mode between each pair of hubs. indeed, the nature of products is considered different and hub capacity constraint is also applied. due to ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید