نتایج جستجو برای: well dispersed subset non dominated solutions
تعداد نتایج: 3016401 فیلتر نتایج به سال:
in chapter 1, charactrizations of fragmentability, which are obtained by namioka (37), ribarska (45) and kenderov-moors (32), are given. also the connection between fragmentability and its variants and other topics in banach spaces such as analytic space, the radone-nikodym property, differentiability of convex functions, kadec renorming are discussed. in chapter 2, we use game characterization...
An employee transporting problem is described and a set partitioning model is developed. An investigation of the model leads to a knapsack problem as a surrogate problem. Finding a partition corresponding to the knapsack problem provides a solution to the problem. An exact algorithm is proposed to obtain a partition (subset-vehicle combination) corresponding to the knapsack solution. It require...
We study scalar perturbations induced by through the non-linear interaction appearing at second order in perturbations. derive analytic solutions of a perfect fluid. In particular, we consider radiation-dominated era and matter-dominated era. With solutions, also discuss power spectra
In this paper a novel Multi-objective fuzzy self adaptive hybrid particle swarm optimization (MFSAHPSO) evolutionary algorithm to solve the Multi-objective optimal operation management (MOOM) is presented. The purposes of the MOOM problem are to decrease the total electrical energy losses, the total electrical energy cost and the total pollutant emission produced by fuel cells and substation bu...
this paper explores the capabilities of multi-objective particle swarm optimization algorithmin a simulation-optimization model for solving waste load allocation problems. the main goals are totaltreatment costs, violation of the water quality standards and equity. in this research, the water qualitysimulation model is coupled with a multi-objective optimization model, mopso. in order to derive...
We consider the problem of maximimizing, over all choices of n nonzero elements a 1 ; : : : ; a n 2 R m , the number of the 2 n subset sums P i2I a i , over all index sets I, belonging to some speciied target set T.tigated the case m = 1 and T = f0; 1g of this problem, and showed that the maximum in their case is ? n+1 b n+1 2 c , but it remained open until now to prove the essential uniqueness...
We present a rich class of exact solutions which contains radiation-dominated and matter-dominated models for the early and late universe. They include a variable cosmological “constant” which is derived from a higher dimension and manifests itself in spacetime as an energy density for the vacuum. This is in agreement with observational data and is compatible with extensions of general relativi...
Multi-objective optimisation yields an estimated Pareto front of mutually non- dominating solutions, but with more than three objectives, understanding the relationships between solutions is challenging. Natural solutions to use as landmarks are those lying near to the edges of the mutually non-dominating set. We propose four definitions of edge points for many-objective mutually non-dominating...
Limiting Index Sort A New Non-Dominated Sorting Algorithm and its Comparison to the State-of-the-Art
....... An important problem in the realm of evolutionary multi-objective optimization (MOO) is that of finding all non-dominated fronts (NDFs). We specifically address the computational efficiency of the non-dominated sorting algorithm for finding the non-dominated fronts for the non-dominated sorting genetic algorithm II (NSGA-II) algorithm. We introduce the Limiting Index Sort (LIS) algorith...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید