作者: 竊喜 時(shí)間: 2025-3-21 22:37 作者: VEN 時(shí)間: 2025-3-22 03:34
Automatically Configuring Multi-objective Local Search Using Multi-objective Optimisation,ctive optimisation algorithm is automatically configured in a multi-objective fashion, and our results demonstrate that this approach can produce very good results as well as interesting insights into the efficacy of various strategies and components of a flexible multi-objective local search framew作者: Cuisine 時(shí)間: 2025-3-22 05:01 作者: HAWK 時(shí)間: 2025-3-22 11:57 作者: 富饒 時(shí)間: 2025-3-22 15:03 作者: 富饒 時(shí)間: 2025-3-22 19:29 作者: 導(dǎo)師 時(shí)間: 2025-3-22 22:26
Timing the Decision Support for Real-World Many-Objective Optimization Problems, authors counter this limitation, by integrating a termination criterion with an MOEA run, towards determining the appropriate timing for application of the machine learning based framework. Results based on three real-world many-objective problems considered in this paper, highlight the utility of 作者: Affluence 時(shí)間: 2025-3-23 04:54 作者: 輕彈 時(shí)間: 2025-3-23 08:36 作者: COWER 時(shí)間: 2025-3-23 12:03 作者: genuine 時(shí)間: 2025-3-23 16:46 作者: 極大的痛苦 時(shí)間: 2025-3-23 19:29 作者: 未完成 時(shí)間: 2025-3-23 22:21
https://doi.org/10.1007/978-3-663-19760-7tion problems of discrete nature. This provides a more intuitive way to set the preferences, which represents a useful tool to explore the regions of interest of the decision maker. Numerical results on multi-objective multi-dimensional knapsack problem instances show the interest of the proposed ap作者: 招致 時(shí)間: 2025-3-24 04:07 作者: sigmoid-colon 時(shí)間: 2025-3-24 08:22
Induktion durch abnorme Induktoren, authors counter this limitation, by integrating a termination criterion with an MOEA run, towards determining the appropriate timing for application of the machine learning based framework. Results based on three real-world many-objective problems considered in this paper, highlight the utility of 作者: 廣大 時(shí)間: 2025-3-24 13:03
https://doi.org/10.1007/978-3-319-54157-0big data; evolutionary algorithms; machine learning; numeric computing; parallel computing; algorithm ana作者: 乏味 時(shí)間: 2025-3-24 16:44
978-3-319-54156-3Springer International Publishing AG 2017作者: 隱士 時(shí)間: 2025-3-24 19:35 作者: GIDDY 時(shí)間: 2025-3-25 02:02 作者: 使苦惱 時(shí)間: 2025-3-25 06:09
,Peek – Shape – Grab: A Methodology in Three Stages for Approximating the Non-dominated Points of Mut suggests to separate in three stages the design of an operational solver for this class of optimization problems, featuring a methodology in this context. The arguments are illustrated using the knapsack problem as support, along numerical experiments.作者: 違反 時(shí)間: 2025-3-25 10:28 作者: 漫步 時(shí)間: 2025-3-25 14:49 作者: coltish 時(shí)間: 2025-3-25 19:20 作者: evaculate 時(shí)間: 2025-3-25 23:54 作者: GULF 時(shí)間: 2025-3-26 02:24
,Die Leitf?higkeit ,, des Nutenflusses,wn Traveling Salesman Problem and Binary Knapsack Problem interact. The interdependence of these two components builds an interwoven system where solving one subproblem separately does not solve the overall problem. The objective space of the Bi-Objective Traveling Thief Problem has through the inte作者: 發(fā)出眩目光芒 時(shí)間: 2025-3-26 07:05
Frank A. Coutelieris,Antonios Kanavourasombinatorial optimisation problems. This raises the question how to most effectively leverage AAC in the context of building or optimising multi-objective optimisation algorithms, and specifically, multi-objective local search procedures. Because the performance of multi-objective optimisation algor作者: 正常 時(shí)間: 2025-3-26 10:18
https://doi.org/10.1007/978-3-030-15293-2hardness. In this paper we rigorously investigate the complexity status of some well-known multiobjective optimization problems and ask the question if these problems really are .-hard. It turns out, that most of them do not seem to be and for one we prove that if it is .-hard then this would imply 作者: barium-study 時(shí)間: 2025-3-26 12:59
Herrade Igersheim,Mathieu Lefebvree Pareto front. We analyze how methods based on angles have been utilized in the past for this task and propose a new angle-based measure—angle utility—that ranks points of the Pareto front irrespective of its shape or the number of objectives. An algorithm for finding angle utility optima is presen作者: ETCH 時(shí)間: 2025-3-26 17:32
https://doi.org/10.1007/978-3-662-25806-4approaches to assessing algorithm performance have been pursued: using set quality indicators, and the (empirical) attainment function and its higher-order moments as a generalization of empirical cumulative distributions of function values. Both approaches have their advantages but rely on the choi作者: 托人看管 時(shí)間: 2025-3-26 21:53
https://doi.org/10.1007/978-3-658-28894-5 (VANETs). We propose two multiobjective models to solve two different problems. The first one, our objectives are to find the minimum set of RSUs and to maximize the number of covered vehicles. The second one, our objectives are to find the minimum set of RSUs and to maximize the percentage of time作者: JECT 時(shí)間: 2025-3-27 04:20 作者: 戰(zhàn)勝 時(shí)間: 2025-3-27 08:32 作者: engrossed 時(shí)間: 2025-3-27 12:48 作者: 走調(diào) 時(shí)間: 2025-3-27 13:35 作者: Arthr- 時(shí)間: 2025-3-27 19:38 作者: myopia 時(shí)間: 2025-3-28 00:59 作者: inhibit 時(shí)間: 2025-3-28 02:09
,Die Einheit der elektrischen Stromst?rke,t suggests to separate in three stages the design of an operational solver for this class of optimization problems, featuring a methodology in this context. The arguments are illustrated using the knapsack problem as support, along numerical experiments.作者: Firefly 時(shí)間: 2025-3-28 10:16 作者: Progesterone 時(shí)間: 2025-3-28 14:26 作者: Harbor 時(shí)間: 2025-3-28 18:27
Zwillingforschung in der Psychiatrie,le improvement to such algorithms is the use of adaptive operator selection mechanisms in many-objective optimization algorithms. In this work, two adaptive operator selection mechanisms, Probability Matching (PM) and Adaptive Pursuit (AP), are incorporated into the NSGA-III framework to autonomousl作者: 產(chǎn)生 時(shí)間: 2025-3-28 20:05
On the Effect of Scalarising Norm Choice in a ParEGO implementation, constrained. Specialist optimizers, such as ParEGO, exist for this setting, but little knowledge is available to guide their configuration. This paper uses a new implementation of ParEGO to examine three hypotheses relating to a key configuration parameter: choice of scalarising norm. Two hypothese作者: antidote 時(shí)間: 2025-3-29 00:34
Multi-objective Big Data Optimization with jMetal and Spark,he parallelization of metaheuristics with the Apache Spark cluster computing system for solving multi-objective Big Data Optimization problems. Our purpose is to study the influence of accessing data stored in the Hadoop File System (HDFS) in each evaluation step of a metaheuristic and to provide a 作者: Confirm 時(shí)間: 2025-3-29 05:03 作者: forbid 時(shí)間: 2025-3-29 09:48
Solving the Bi-objective Traveling Thief Problem with Multi-objective Evolutionary Algorithms,wn Traveling Salesman Problem and Binary Knapsack Problem interact. The interdependence of these two components builds an interwoven system where solving one subproblem separately does not solve the overall problem. The objective space of the Bi-Objective Traveling Thief Problem has through the inte作者: Anthology 時(shí)間: 2025-3-29 14:31
Automatically Configuring Multi-objective Local Search Using Multi-objective Optimisation,ombinatorial optimisation problems. This raises the question how to most effectively leverage AAC in the context of building or optimising multi-objective optimisation algorithms, and specifically, multi-objective local search procedures. Because the performance of multi-objective optimisation algor作者: ULCER 時(shí)間: 2025-3-29 19:36 作者: evaculate 時(shí)間: 2025-3-29 22:39 作者: 清唱?jiǎng)?nbsp; 時(shí)間: 2025-3-30 03:56
Quantitative Performance Assessment of Multiobjective Optimizers: The Average Runtime Attainment Fuapproaches to assessing algorithm performance have been pursued: using set quality indicators, and the (empirical) attainment function and its higher-order moments as a generalization of empirical cumulative distributions of function values. Both approaches have their advantages but rely on the choi作者: EXCEL 時(shí)間: 2025-3-30 05:02 作者: 可用 時(shí)間: 2025-3-30 11:47
An Approach for the Local Exploration of Discrete Many Objective Optimization Problems,t role in the decision making process. For such problems, it is computationally expensive or even intractable to approximate the entire set of optimal solutions. An alternative is to compute a subset of optimal solutions based on the preferences of the decision maker. Commonly, interactive methods f作者: Oversee 時(shí)間: 2025-3-30 13:31
A Note on the Detection of Outliers in a Binary Outranking Relation,her elements and are likely to influence the outcomes of the considered method. We propose a model based on the distance introduced by De Smet and Montano and extend it to different samplings of the set of alternatives (which are used as a comparison basis). This leads to study the distribution of d作者: Nonthreatening 時(shí)間: 2025-3-30 18:39 作者: OTTER 時(shí)間: 2025-3-31 00:39
Weighted Stress Function Method for Multiobjective Evolutionary Algorithm Based on Decomposition,dressed when applying MOEA/D are the choice of an appropriate scalarizing function and setting the values of main control parameters. This study suggests a weighted stress function method (WSFM) for fitness assignment in MOEA/D. WSFM establishes analogy between the stress-strain behavior of thermopl作者: 舊石器時(shí)代 時(shí)間: 2025-3-31 03:24 作者: meditation 時(shí)間: 2025-3-31 07:54
,On the Influence of Altering the Action Set on PROMETHEE II’s Relative Ranks,nown as rank reversal. In this contribution, we formalise rank reversal for the . method. The aim is not to debate about the legitimacy of such effect but rather to derive the exact conditions for its occurrence when one or more actions are added or removed from/to the original set. These conditions作者: 走調(diào) 時(shí)間: 2025-3-31 11:00 作者: CRUMB 時(shí)間: 2025-3-31 14:03
A New Reduced-Length Genetic Representation for Evolutionary Multiobjective Clustering,alability of such an approach, however, is a topic which merits more attention given the unprecedented volumes of data generated nowadays. This paper proposes a reduced-length representation for evolutionary multiobjective clustering. The new encoding explicitly prunes the solution space and allows 作者: 揉雜 時(shí)間: 2025-3-31 17:44 作者: Afflict 時(shí)間: 2025-3-31 22:41 作者: glisten 時(shí)間: 2025-4-1 03:17
