作者: 現(xiàn)代 時間: 2025-3-22 00:16
An Optimality Theory Based Proximity Measure for Evolutionary Multi-Objective and Many-Objective Option. To evaluate these algorithms, performance metrics either require the knowledge of the true Pareto-optimal solutions or, are ad-hoc and heuristic based. In this paper, we suggest a KKT proximity measure (KKTPM) that can provide an estimate of the proximity of a set of trade-off solutions from th作者: ASSET 時間: 2025-3-22 01:53 作者: 極小量 時間: 2025-3-22 07:09
Clustering Based Parallel Many-Objective Evolutionary Algorithms Using the Shape of the Objective Ve MOEAs are unable to maintain the same effectiveness showed for two or three objectives. Therefore, as a way to ameliorate this performance degradation several authors proposed preference-based methods as an alternative to Pareto based approaches. On the other hand, parallelization has shown to be u作者: linguistics 時間: 2025-3-22 08:55
Faster Exact Algorithms for Computing Expected Hypervolume Improvementaussian distribution of a new candidate point. It is frequently used as an infill or prescreening criterion in multiobjective optimization with expensive function evaluations where predictions are provided by Kriging or Gaussian process surrogate models. The expected hypervolume improvement has good作者: MENT 時間: 2025-3-22 15:33
A GPU-Based Algorithm for a Faster Hypervolume Contribution Computationot only as a quality measure for comparing final results of multi-objective evolutionary algorithms (MOEAs), but also as a selection operator (it is, for example, very suitable for .). However, it has one serious drawback: computing the exact hypervolume is highly costly. The best known algorithms t作者: MENT 時間: 2025-3-22 19:14
A Feature-Based Performance Analysis in Evolutionary Multiobjective Optimizationatorial optimization, where a strict theoretical analysis is generally out of reach due to the high complexity of the underlying problem. Based on the examination of problem features from a multiobjective perspective, we improve the understanding of the efficiency of a simple dominance-based EMO alg作者: SKIFF 時間: 2025-3-22 22:07
Modified Distance Calculation in Generational Distance and Inverted Generational Distancermance indicators evaluate the quality of an obtained solution set in comparison with a pre-specified reference point set. Both indicators are based on the distance between a solution and a reference point. The Euclidean distance in an objective space is usually used for distance calculation. Our id作者: Feigned 時間: 2025-3-23 01:45
On the Behavior of Stochastic Local Search Within Parameter Dependent MOPsmulti-objective optimization problems. The discussions and initial computations indicate that the problem to compute an approximation of the entire solution set of such a problem via stochastic search algorithms is well-conditioned. The new insights may be helpful for the design of novel stochastic 作者: 越自我 時間: 2025-3-23 06:37 作者: Adulterate 時間: 2025-3-23 10:26 作者: intrude 時間: 2025-3-23 15:21
Elite Accumulative Sampling Strategies for Noisy Multi-objective Optimisationn. When the optimisation problem experiences observational noise, there is also a trade-off with respect to accuracy refinement – as improving the estimate of a design’s performance typically is at the cost of additional function reevaluations. Empirically the most effective resampling approach deve作者: GEST 時間: 2025-3-23 20:22 作者: 禮節(jié) 時間: 2025-3-23 23:42
Using Indifference Information in Robust Ordinal Regressionindifference between real and fictitious alternatives. In particular, we allow the decision maker to suggest a new alternative that is different from the existing alternatives, but equally preferable. As shown by several experiments in psychology of the decisions, choosing between alternatives is di作者: MEAN 時間: 2025-3-24 02:23 作者: Deceit 時間: 2025-3-24 09:31
Genetic Algorithm Approach for a Class of Multi-Criteria, Multi-Vehicle Planner of UAVsf forest at the minimum possible time, for rescuing support, fire detection, deforestation mitigation, among other important applications in the Amazon rain forest operational scenario. However, time is not the only criteria to be considered. Given that it is virtually impossible to recover a missin作者: FRET 時間: 2025-3-24 13:21 作者: Kinetic 時間: 2025-3-24 15:44
978-3-319-15891-4Springer International Publishing Switzerland 2015作者: 輕觸 時間: 2025-3-24 21:18
Evolutionary Multi-Criterion Optimization978-3-319-15892-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: creditor 時間: 2025-3-25 02:19 作者: 親屬 時間: 2025-3-25 03:31 作者: palette 時間: 2025-3-25 07:31
https://doi.org/10.1007/978-3-319-23895-1ssignment problem using a set of weight vectors uniformly scattered. Our approach adopts uniform design to obtain the set of weights and Kuhn-Munkres’ (Hungarian) algorithm to solve the assignment problem. Differential evolution is used as our search engine, giving rise to the so-called Hungarian Di作者: 昏睡中 時間: 2025-3-25 14:05
https://doi.org/10.1057/978-1-349-94892-5ion. To evaluate these algorithms, performance metrics either require the knowledge of the true Pareto-optimal solutions or, are ad-hoc and heuristic based. In this paper, we suggest a KKT proximity measure (KKTPM) that can provide an estimate of the proximity of a set of trade-off solutions from th作者: tinnitus 時間: 2025-3-25 16:20 作者: NOTCH 時間: 2025-3-25 21:29 作者: surrogate 時間: 2025-3-26 01:15 作者: Intact 時間: 2025-3-26 06:24
Mário Henrique Ogasavara,Gilmar Masieroot only as a quality measure for comparing final results of multi-objective evolutionary algorithms (MOEAs), but also as a selection operator (it is, for example, very suitable for .). However, it has one serious drawback: computing the exact hypervolume is highly costly. The best known algorithms t作者: 豎琴 時間: 2025-3-26 09:20 作者: 祖?zhèn)髫敭a(chǎn) 時間: 2025-3-26 12:51
https://doi.org/10.1057/9781137316257rmance indicators evaluate the quality of an obtained solution set in comparison with a pre-specified reference point set. Both indicators are based on the distance between a solution and a reference point. The Euclidean distance in an objective space is usually used for distance calculation. Our id作者: macrophage 時間: 2025-3-26 17:25 作者: 支柱 時間: 2025-3-26 22:31 作者: 規(guī)范要多 時間: 2025-3-27 03:29 作者: Intuitive 時間: 2025-3-27 05:38
Conclusion: A New Bourgeois Habitus,n. When the optimisation problem experiences observational noise, there is also a trade-off with respect to accuracy refinement – as improving the estimate of a design’s performance typically is at the cost of additional function reevaluations. Empirically the most effective resampling approach deve作者: 制造 時間: 2025-3-27 09:56 作者: Dislocation 時間: 2025-3-27 17:29
Klemetti N?kk?l?j?rvi,Pekka Kauppalaindifference between real and fictitious alternatives. In particular, we allow the decision maker to suggest a new alternative that is different from the existing alternatives, but equally preferable. As shown by several experiments in psychology of the decisions, choosing between alternatives is di作者: penance 時間: 2025-3-27 17:52
The Nature of Environmental Experience, supported for modifying the parameters of outranking methods in an iterative and interactive process. In this work, we provide an application of the procedure through evaluating eight municipal districts for Water Company to invest in projects of water supply. An inferring parameters model performe作者: 分開 時間: 2025-3-28 01:01
https://doi.org/10.1007/978-94-6209-944-9f forest at the minimum possible time, for rescuing support, fire detection, deforestation mitigation, among other important applications in the Amazon rain forest operational scenario. However, time is not the only criteria to be considered. Given that it is virtually impossible to recover a missin作者: 值得尊敬 時間: 2025-3-28 04:27 作者: 禁令 時間: 2025-3-28 07:45
https://doi.org/10.1007/978-3-030-31818-5ion of the Pareto set for small-size enumerable instances. Our analysis provides further insights on the EMO search behavior and on the most important features that characterize the difficulty of an instance for this class of problems and algorithms.作者: G-spot 時間: 2025-3-28 10:43 作者: 堅毅 時間: 2025-3-28 17:46 作者: tackle 時間: 2025-3-28 19:14
https://doi.org/10.1007/978-3-319-23895-1indicator-based MOEA (the ., SMS- EMOA) using several test problems (taken from the specialized literature) having from two to ten objective functions. Our preliminary experimental results indicate that our proposed HDE outperforms MOEA/D and is competitive with respect to SMS-EMOA, but at a significantly lower computational cost.作者: Ordnance 時間: 2025-3-29 01:08 作者: Fibrinogen 時間: 2025-3-29 06:53 作者: Cocker 時間: 2025-3-29 11:09
Klemetti N?kk?l?j?rvi,Pekka Kauppalaence information one can represent more faithfully the DM’s preferences. Such information about indifference should narrow down the set of compatible value functions much more quickly than standard pairwise comparisons, and a first simple example at least indicates that this intuition seems to be correct.作者: 爭議的蘋果 時間: 2025-3-29 12:51 作者: HERE 時間: 2025-3-29 16:33 作者: 壓艙物 時間: 2025-3-29 22:47
Evolutionary Many-Objective Optimization Based on Kuhn-Munkres’ Algorithmindicator-based MOEA (the ., SMS- EMOA) using several test problems (taken from the specialized literature) having from two to ten objective functions. Our preliminary experimental results indicate that our proposed HDE outperforms MOEA/D and is competitive with respect to SMS-EMOA, but at a significantly lower computational cost.作者: 乏味 時間: 2025-3-30 00:49 作者: 一再遛 時間: 2025-3-30 07:30 作者: 愛了嗎 時間: 2025-3-30 10:29
Using Indifference Information in Robust Ordinal Regressionence information one can represent more faithfully the DM’s preferences. Such information about indifference should narrow down the set of compatible value functions much more quickly than standard pairwise comparisons, and a first simple example at least indicates that this intuition seems to be correct.作者: FLACK 時間: 2025-3-30 14:56
A Multi-objective Genetic Algorithm for Inferring Inter-criteria Parameters for Water Supply Consensndence with the preferences of the whole group (collective ranking). This paper shows how the inferring parameters model may be used to help the decision makers with different interest to iteratively reach an agreement on how to rank cities at a time, reflecting the preferences at the individual level and at the collective level.作者: ADOPT 時間: 2025-3-30 19:45
An Interactive Evolutionary Multiobjective Optimization Method: Interactive WASF-GAference point given. Interactive WASF-GA implies a much lower computational cost than the original WASF-GA because it generates a small number of solutions. This speeds up the convergence of the algorithm, making it suitable for many decision-making problems. Its efficiency and usefulness is demonstrated with a five-objective optimization problem.作者: GLUT 時間: 2025-3-30 21:27 作者: 才能 時間: 2025-3-31 04:22
Conference proceedings 2015r?es, Portugal in March/April 2015. The 68 revised full papers presented together with 4 plenary talks were carefully reviewed and selected from 90 submissions. The EMO 2015 aims to continue these type of developments, being the papers presented focused in: theoretical aspects, algorithms developmen作者: 慢慢流出 時間: 2025-3-31 07:03 作者: 開花期女 時間: 2025-3-31 11:14
On the Behavior of Stochastic Local Search Within Parameter Dependent MOPssearch algorithms such as specialized evolutionary approaches. The discussion in particular indicates that it might be beneficial to integrate the set of external parameters directly into the search instead of computing projections of the solution sets separately by fixing the value of the external parameter.作者: 收到 時間: 2025-3-31 16:50 作者: 航海太平洋 時間: 2025-3-31 19:55 作者: 幾何學家 時間: 2025-3-31 23:09 作者: Pulmonary-Veins 時間: 2025-4-1 04:49
