標(biāo)題: Titlebook: Evolutionary Computation in Combinatorial Optimization; 10th European Confer Peter Cowling,Peter Merz Conference proceedings 2010 Springer- [打印本頁(yè)] 作者: 門(mén)牙 時(shí)間: 2025-3-21 19:03
書(shū)目名稱(chēng)Evolutionary Computation in Combinatorial Optimization影響因子(影響力)
書(shū)目名稱(chēng)Evolutionary Computation in Combinatorial Optimization影響因子(影響力)學(xué)科排名
書(shū)目名稱(chēng)Evolutionary Computation in Combinatorial Optimization網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱(chēng)Evolutionary Computation in Combinatorial Optimization網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱(chēng)Evolutionary Computation in Combinatorial Optimization被引頻次
書(shū)目名稱(chēng)Evolutionary Computation in Combinatorial Optimization被引頻次學(xué)科排名
書(shū)目名稱(chēng)Evolutionary Computation in Combinatorial Optimization年度引用
書(shū)目名稱(chēng)Evolutionary Computation in Combinatorial Optimization年度引用學(xué)科排名
書(shū)目名稱(chēng)Evolutionary Computation in Combinatorial Optimization讀者反饋
書(shū)目名稱(chēng)Evolutionary Computation in Combinatorial Optimization讀者反饋學(xué)科排名
作者: 時(shí)間等 時(shí)間: 2025-3-21 20:56 作者: 雕鏤 時(shí)間: 2025-3-22 02:43 作者: 秘密會(huì)議 時(shí)間: 2025-3-22 05:37
A Real-Integer-Discrete-Coded Differential Evolution Algorithm: A Preliminary Study, of DE for working directly with integer and discrete variables of a problem. However, in most of those works, actually a real-valued solution is just converted into a desired integer-valued solution by applying some decoding mechanisms. Only a limited number of works are found, in which attempts ar作者: 十字架 時(shí)間: 2025-3-22 09:52 作者: 發(fā)展 時(shí)間: 2025-3-22 14:18 作者: 發(fā)展 時(shí)間: 2025-3-22 21:00 作者: atrophy 時(shí)間: 2025-3-22 23:01
A Tabu Search Heuristic for Point Coverage, Sink Location, and Data Routing in Wireless Sensor Netwe proposed. As these models are difficult to solve, a nested solution procedure is proposed. The best sensor locations are sought by tabu search in the upper level. For the fixed sensor locations, the remaining problem of determining sink locations and data routes are solved efficiently in the lower作者: 圍裙 時(shí)間: 2025-3-23 04:23 作者: Diverticulitis 時(shí)間: 2025-3-23 07:45 作者: 范圍廣 時(shí)間: 2025-3-23 11:58
Enhancing a Tabu Algorithm for Approximate Graph Matching by Using Similarity Measures,a simple neighborhood but is initialized by a greedy procedure which uses a measure of similarity between the vertices of the two graphs. The algorithm is tested on a large collection of graphs of various sizes (from 300 vertices and up to 3000 vertices) and densities. Computing times range from les作者: sparse 時(shí)間: 2025-3-23 15:23 作者: 吃掉 時(shí)間: 2025-3-23 21:32 作者: ADORE 時(shí)間: 2025-3-23 23:53
A Study of Memetic Search with Multi-parent Combination for UBQP,rating tabu search into the framework of genetic algorithm. In this paper, we propose a new multi-parent combination operator for generating offspring solutions. A pool updating strategy based on a quality-and-distance criterion is used to manage the population. Experimental comparisons with leading作者: 有斑點(diǎn) 時(shí)間: 2025-3-24 04:26 作者: 我們的面粉 時(shí)間: 2025-3-24 07:13 作者: Cholesterol 時(shí)間: 2025-3-24 12:52 作者: Projection 時(shí)間: 2025-3-24 17:55
Guided Ejection Search for the Pickup and Delivery Problem with Time Windows,earch (GES). GES is a recently proposed metaheuristc framework and was first applied to the vehicle routing problem with time windows. The existence of the pickup and delivery constraint makes the feasible solution space tightly constrained and then makes the design of effective metaheuristics more 作者: armistice 時(shí)間: 2025-3-24 20:18
An Evolutionary Algorithm Guided by Preferences Elicited According to the ELECTRE TRI Method Princie of the Pareto-optimal front, but also a decision support process to aid the Decision Maker (DM) to progress in the learning of the trade-offs at stake in different regions of the search space. This is accomplished by integrating in the search process the DM’s preferences to guide the search and li作者: 保存 時(shí)間: 2025-3-25 02:53 作者: 寡頭政治 時(shí)間: 2025-3-25 06:54 作者: Merited 時(shí)間: 2025-3-25 11:32
0302-9743 Overview: Fast track conference proceeding.Unique visibility.State of the art research978-3-642-12138-8978-3-642-12139-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Hemoptysis 時(shí)間: 2025-3-25 11:46 作者: Iatrogenic 時(shí)間: 2025-3-25 16:10
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/e/image/317888.jpg作者: 征兵 時(shí)間: 2025-3-25 21:26 作者: Evocative 時(shí)間: 2025-3-26 01:45 作者: strdulate 時(shí)間: 2025-3-26 07:43
Pushing Forward in Europe and Beyond, . facilities, anticipating that the follower will react to the decision by opening his own . facilities. The decision makers try to maximize their own profits. This Stackelberg game is .-hard. So, we develop a hybrid memetic algorithm for it. A probabilistic tabu search heuristic is applied for imp作者: farewell 時(shí)間: 2025-3-26 09:59
https://doi.org/10.1007/978-94-011-4744-6e total cost of actions, or the total makespan, by generating ordered sequences of intermediate goals via artificial evolution, and calling an external planner to solve each subproblem in turn. . can theoretically use any embedded planner. However, since the introduction of this approach only one em作者: 控制 時(shí)間: 2025-3-26 15:00 作者: REIGN 時(shí)間: 2025-3-26 18:24
https://doi.org/10.1057/9780230514034ded problems. This method is now applied to permutation based problems. As demanded by Schiavinotto and Stützle, the distance in a search space is calculated by regarding the steps of the (neighborhood) operator. In this paper the five most common operators for permutations are analyzed on symmetric作者: indignant 時(shí)間: 2025-3-26 23:14
,Eastern Europe and the ‘Return to Europe’,roblem is a component in algorithms for optimizing data compression when computing a function of two correlated sources at a receiver. Our genetic algorithm for minimizing chromatic entropy uses an order-based genome inspired by graph coloring genetic algorithms, as well as some problem-specific heu作者: CEDE 時(shí)間: 2025-3-27 05:05 作者: 復(fù)習(xí) 時(shí)間: 2025-3-27 06:27
European Accountancy Yearbook 1992/93e proposed. As these models are difficult to solve, a nested solution procedure is proposed. The best sensor locations are sought by tabu search in the upper level. For the fixed sensor locations, the remaining problem of determining sink locations and data routes are solved efficiently in the lower作者: Misgiving 時(shí)間: 2025-3-27 12:20
https://doi.org/10.1007/978-3-540-35647-9y, the task of finding a decomposition of minimum width is NP-complete itself. Therefore, several heuristic and metaheuristic methods have been developed for this problem. In this paper we investigate the application of different variants of Ant Colony Optimization algorithms for the generation of t作者: Congregate 時(shí)間: 2025-3-27 14:57 作者: 觀點(diǎn) 時(shí)間: 2025-3-27 18:52 作者: 清楚 時(shí)間: 2025-3-27 23:21 作者: 提名 時(shí)間: 2025-3-28 02:52
P. Potthoff,R. Diehl,A. Schrappe entities is strongly hierarchized, affecting the design and handling of constraints and algorithms used to solve the problem. Moreover there is also an increase in the constraint number when compared to the common test instances. Several well known meta-heuristics were used, new constraints develo作者: 極大痛苦 時(shí)間: 2025-3-28 07:48
https://doi.org/10.1007/978-3-319-07338-5rating tabu search into the framework of genetic algorithm. In this paper, we propose a new multi-parent combination operator for generating offspring solutions. A pool updating strategy based on a quality-and-distance criterion is used to manage the population. Experimental comparisons with leading作者: 要控制 時(shí)間: 2025-3-28 11:47 作者: 愛(ài)花花兒憤怒 時(shí)間: 2025-3-28 17:16
https://doi.org/10.1057/9781137560247uick adaptations to a changing environment that only fast greedy heuristics can handle. The use of memetic algorithms, which are more complex than ad-hoc heuristics, can guide us to more accurate solutions. In order to apply memetic algorithms to such a dynamic environment, we propose a reformulatio作者: 禁令 時(shí)間: 2025-3-28 22:44 作者: 削減 時(shí)間: 2025-3-29 02:22 作者: 支形吊燈 時(shí)間: 2025-3-29 05:20
https://doi.org/10.1007/978-3-658-08060-0e of the Pareto-optimal front, but also a decision support process to aid the Decision Maker (DM) to progress in the learning of the trade-offs at stake in different regions of the search space. This is accomplished by integrating in the search process the DM’s preferences to guide the search and li作者: eczema 時(shí)間: 2025-3-29 10:55 作者: bronchiole 時(shí)間: 2025-3-29 14:57 作者: insipid 時(shí)間: 2025-3-29 19:35 作者: senile-dementia 時(shí)間: 2025-3-29 22:30
Effectiveness, Openness and Subsidiarityscrete variables of a problem without any conversion. Applying to two non-linear real-integer-discrete-valued engineering design problems, the proposed DE is found successful in obtaining the known best solutions of the problems.作者: FLOUR 時(shí)間: 2025-3-30 03:24 作者: 絕食 時(shí)間: 2025-3-30 07:14 作者: fabricate 時(shí)間: 2025-3-30 11:15 作者: 叫喊 時(shí)間: 2025-3-30 13:23
A Real-Integer-Discrete-Coded Differential Evolution Algorithm: A Preliminary Study,screte variables of a problem without any conversion. Applying to two non-linear real-integer-discrete-valued engineering design problems, the proposed DE is found successful in obtaining the known best solutions of the problems.作者: white-matter 時(shí)間: 2025-3-30 18:40
An Evolutionary Algorithm Guided by Preferences Elicited According to the ELECTRE TRI Method Princie of the search according to the preferences expressed by the DM. The introduction of meaningful preference expression parameters used in the ELECTRE TRI method for sorting problems in the framework of an evolutionary algorithm is proposed. Illustrative results in an operational planning problem in electricity networks are reported.作者: 小丑 時(shí)間: 2025-3-30 21:06
https://doi.org/10.1007/978-3-319-07338-5 solutions. A pool updating strategy based on a quality-and-distance criterion is used to manage the population. Experimental comparisons with leading methods for the UBQP problem on 25 large public instances demonstrate the efficacy of our proposed algorithm in terms of both solution quality and computational efficiency.作者: DEMN 時(shí)間: 2025-3-31 02:21 作者: GUMP 時(shí)間: 2025-3-31 06:59
https://doi.org/10.1057/9780230514034 and asymmetric TSP instances. In addition a local quality measure, the point quality (PQ) is proposed as a supplement to the global FDC. With this local measure more characteristics and differences can be investigated. Some experimental results are illustrating these concepts.作者: ODIUM 時(shí)間: 2025-3-31 09:33
,Eastern Europe and the ‘Return to Europe’,ristics. It performs consistently well on synthetic instances, and for an expositional set of functional compression problems, the GA routinely finds a compression scheme that is 20-30% more efficient than that given by a reference compression algorithm.作者: Acumen 時(shí)間: 2025-3-31 15:42
Matteo Tugnoli,Martin Sarret,Marco Alibertised benchmark problems show that the GAs taking advantage of the natural problem decomposition; Coevolutionary GA, and Incremental GA outperform Standard GA, and that the relative encoding works better than the absolute encoding. The methods, the results, and the relevant parameter settings are discussed.作者: Absenteeism 時(shí)間: 2025-3-31 17:40 作者: 壓迫 時(shí)間: 2025-4-1 01:03 作者: cogent 時(shí)間: 2025-4-1 03:20 作者: paroxysm 時(shí)間: 2025-4-1 07:51
P. Potthoff,R. Diehl,A. Schrappped, and some variations to the local search algorithms were studied. This article describes the work done and its application to a particular case study, the European Space Research and Technology Center (ESTEC).
