نتایج جستجو برای: non dominated solution
تعداد نتایج: 1776584 فیلتر نتایج به سال:
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.
This paper presents the integration between a co-operative co-evolutionary genetic algorithm (CCGA) and four evolutionary multiobjective optimisation algorithms (EMOAs): a multi-objective genetic algorithm (MOGA), a niched Pareto genetic algorithm (NPGA), a nondominated sorting genetic algorithm (NSGA) and a controlled elitist nondominated sorting genetic algorithm (CNSGA). The resulting algori...
This paper considers the job scheduling problem in virtual manufacturing cells (VMCs) with the goal of minimizing two objectives namely, makespan and total travelling distance. To solve this problem two algorithms are proposed: traditional non-dominated sorting genetic algorithm (NSGA-II) and knowledge-based non-dominated sorting genetic algorithm (KBNSGA-II). The difference between these algor...
We suggest a method for finding the non-dominated points of the production possibility set (PPS) with variable returns to scale (VRS) technology in data envelopment analysis (DEA). We present a multiobjective linear programming (MOLP) problem whose feasible region is the same as the PPS under variable returns to scale for generating non-dominated points. We demonstrate that Pareto solutions o...
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...
This paper proposes a multi-objective bidding strategy for a generation company (GenCo) in a day-ahead uniform price spot market using non-dominated sorting particle swarm optimisation (NSPSO). NSPSO is introduced to solve the multi-objective strategic bidding problem considering expected profit maximisation and risk (profit variation) minimisation. Monte Carlo (MC) simulation is employed to si...
singular perturbation problems have been studied by many mathematicians. since the approximate solutions of these problems are as the sum of internal solution (boundary layer area) and external ones, the formation or non-formation of boundary layers should be specified. this paper, investigates this issue for a singular perturbation problem including a first order differential equation with gen...
We consider bicriteria scheduling on identical parallel machines in a nontraditional context: jobs belong to two disjoint sets, and each set has a different criterion to be minimized. The jobs are all available at time zero and have to be scheduled (non-preemptively) on m parallel machines. The goal is to generate the set of all non-dominated solutions, so the decision maker can evaluate the tr...
This paper presents a possibilistic (fuzzy) model in optimal siting and sizing of Distributed Generation (DG) for loss reduction and improve voltage profile in power distribution system. Multi-objective problem is developed in two phases. In the first one, the set of non-dominated planning solutions is obtained (with respect to the objective functions of fuzzy economic cost, and exposure) using...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید