標(biāo)題: Titlebook: Evolutionary Computation in Combinatorial Optimization; 5th European Confere Günther R. Raidl,Jens Gottlieb Conference proceedings 2005 Spr [打印本頁] 作者: DUMMY 時(shí)間: 2025-3-21 19:04
書目名稱Evolutionary Computation in Combinatorial Optimization影響因子(影響力)
書目名稱Evolutionary Computation in Combinatorial Optimization影響因子(影響力)學(xué)科排名
書目名稱Evolutionary Computation in Combinatorial Optimization網(wǎng)絡(luò)公開度
書目名稱Evolutionary Computation in Combinatorial Optimization網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Evolutionary Computation in Combinatorial Optimization被引頻次
書目名稱Evolutionary Computation in Combinatorial Optimization被引頻次學(xué)科排名
書目名稱Evolutionary Computation in Combinatorial Optimization年度引用
書目名稱Evolutionary Computation in Combinatorial Optimization年度引用學(xué)科排名
書目名稱Evolutionary Computation in Combinatorial Optimization讀者反饋
書目名稱Evolutionary Computation in Combinatorial Optimization讀者反饋學(xué)科排名
作者: curettage 時(shí)間: 2025-3-21 21:20
https://doi.org/10.1007/978-1-349-15350-3in the memory. The implemented algorithm is used for the solution of a difficult combinatorial optimization problem, namely the quadratic assignment problem, for which significant performance achievements are provided in terms of convergence speed and solution quality.作者: 靦腆 時(shí)間: 2025-3-22 00:38 作者: Awning 時(shí)間: 2025-3-22 08:03
An External Partial Permutations Memory for Ant Colony Optimization,in the memory. The implemented algorithm is used for the solution of a difficult combinatorial optimization problem, namely the quadratic assignment problem, for which significant performance achievements are provided in terms of convergence speed and solution quality.作者: Rinne-Test 時(shí)間: 2025-3-22 09:48 作者: monogamy 時(shí)間: 2025-3-22 16:00 作者: monogamy 時(shí)間: 2025-3-22 19:18
978-3-540-25337-2Springer-Verlag Berlin Heidelberg 2005作者: languor 時(shí)間: 2025-3-22 21:45 作者: 文件夾 時(shí)間: 2025-3-23 04:01 作者: Femish 時(shí)間: 2025-3-23 09:30 作者: heartburn 時(shí)間: 2025-3-24 12:10 作者: GLIB 時(shí)間: 2025-3-24 17:48 作者: Microgram 時(shí)間: 2025-3-24 21:31
Brendan Brown,Philippe Simonnota foundry. Three variants of genetic algorithm are considered, each of them using special crossover and mutation operators as well as repair functions. The real size test problems, based on the data taken from the production control system, are presented for assessment of the proposed algorithms. Th作者: Commonplace 時(shí)間: 2025-3-25 01:20 作者: Confidential 時(shí)間: 2025-3-25 03:26
The Bulgarian Rejoinder to Youth Guaranteeor two variants of the Lin-Kernighan algorithm. Then we analyse the instances in those sets to guide us towards deferring general knowledge about the efficiency of the two variants in relation to structural properties of the symmetric travelling salesman problem.作者: Cryptic 時(shí)間: 2025-3-25 11:12
Centralizing Banking Resolution,strategies employ heuristics that exploit information about the partial colouring in an aim to improve performance. An evolutionary algorithm is used to drive the search. We compare the different strategies to each other on several very hard benchmarks and on generated problem instances, and show wh作者: NORM 時(shí)間: 2025-3-25 13:10
Ivan Illich and ,: A Reappraisaltisfying a set of hard-constraints and, as much as possible, some soft constraints. Here we work with a well-known version of the problem where there seems a strong case for considering these two goals as separate sub-problems. In particular we note that the satisfaction of hard constraints fits the作者: 染色體 時(shí)間: 2025-3-25 19:16 作者: Nomogram 時(shí)間: 2025-3-25 22:21
András Kovács,Anikó Horváth,Zsuzsanna Vidra. employs heuristics in fitness definition, guiding the population to settle down in search areas where the individuals can not be improved by such heuristics. Some new theoretical improvements not present in early algorithms are now introduced. An application for pattern sequencing problems is exam作者: Interlocking 時(shí)間: 2025-3-26 02:39
Supporting Farmers or Consumers?mbines sequential estimation and combinatorial optimization methods to improve the execution time in dynamic optimization problems. It allows obtaining new high quality solutions in subsequent iterations using solutions found in previous time steps. The hybrid SSPF approach increases the performance作者: Galactogogue 時(shí)間: 2025-3-26 04:56
Giandomenico Falcon,Daria de Pretisknown to be NP-hard due to it’s combinatorial nature. In this paper, two meta-heuristics algorithms – Tabu Search and Simulated Annealing – are proposed. To investigate the effect of control parameters to the performance of tabu search and simulated annealing algorithms, a general factorial design o作者: rheumatology 時(shí)間: 2025-3-26 11:56 作者: AWRY 時(shí)間: 2025-3-26 15:23
https://doi.org/10.1007/b107115Variable; algorithms; ant colony optimization; calculus; combinatorial optimization; constraint satisfact作者: 細(xì)胞 時(shí)間: 2025-3-26 18:36 作者: 種屬關(guān)系 時(shí)間: 2025-3-26 21:17
The Bulgarian Rejoinder to Youth Guaranteeor two variants of the Lin-Kernighan algorithm. Then we analyse the instances in those sets to guide us towards deferring general knowledge about the efficiency of the two variants in relation to structural properties of the symmetric travelling salesman problem.作者: 改革運(yùn)動(dòng) 時(shí)間: 2025-3-27 01:26
Centralizing Banking Resolution,strategies employ heuristics that exploit information about the partial colouring in an aim to improve performance. An evolutionary algorithm is used to drive the search. We compare the different strategies to each other on several very hard benchmarks and on generated problem instances, and show where the novel strategies improve the efficiency.作者: brother 時(shí)間: 2025-3-27 07:58
Estimation of Distribution Algorithms with Mutation, of the next generation, instead of conventional crossover and mutation operations. In this paper, we propose new EDAs which incorporate mutation operator to conventional EDAs in order to keep the diversities in EDA populations. Empirical experiments carried out this paper confirm us the effectiveness of the proposed methods.作者: commensurate 時(shí)間: 2025-3-27 10:49 作者: 陰郁 時(shí)間: 2025-3-27 17:35 作者: Expediency 時(shí)間: 2025-3-27 19:17
https://doi.org/10.1007/978-3-319-60258-5g similar to a first-fit heuristic. The results presented are encouraging, demonstrating that GE in conjunction with attribute grammars can provide an improvement over the standard context-free mapping process for problems in this domain.作者: 吵鬧 時(shí)間: 2025-3-28 00:49
Adamantios Diamantopoulos,Heidi Winklhoferssover and mutation operators are defined in order to evolve such structure. The developed system has been tested on a wireless network configuration and the results compared with those obtained by a genetic programming based approach recently proposed in the literature.作者: fulcrum 時(shí)間: 2025-3-28 02:07
https://doi.org/10.1007/978-1-349-09837-8pe for the indirect representation is regular, and exhibits comparable fitness-distance correlation to that of the former landscape. These findings are validated in the context of variable neighborhood search.作者: Albinism 時(shí)間: 2025-3-28 08:46 作者: craving 時(shí)間: 2025-3-28 11:54
An Attribute Grammar Decoder for the 01 MultiConstrained Knapsack Problem,g similar to a first-fit heuristic. The results presented are encouraging, demonstrating that GE in conjunction with attribute grammars can provide an improvement over the standard context-free mapping process for problems in this domain.作者: emission 時(shí)間: 2025-3-28 16:49
,, a New Evolutionary Approach to Graph Generation,ssover and mutation operators are defined in order to evolve such structure. The developed system has been tested on a wireless network configuration and the results compared with those obtained by a genetic programming based approach recently proposed in the literature.作者: yohimbine 時(shí)間: 2025-3-28 19:07 作者: capsule 時(shí)間: 2025-3-28 23:57
The Use of Meta-heuristics to Solve Economic Lot Scheduling Problem,f experiment study is used. Two Neighborhood Search heuristics that differ in rounding off scheme of the production frequencies are also tested. Experimental study shows that both tabu search and simulated annealing algorithms outperform two best known solution methods – Dobson’s Heuristic and Hybrid Genetic Algorithm.作者: 撫育 時(shí)間: 2025-3-29 05:30 作者: abysmal 時(shí)間: 2025-3-29 11:14
https://doi.org/10.1007/978-0-230-59779-2el landscape of PSP, so to properly explore the search space. The designed IA shows its ability to tackle standard benchmarks instances substantially better than other IA’s. In particular, for the 3D HP model the IA allowed us to find energy minima not found by other evolutionary algorithms described in literature.作者: 一夫一妻制 時(shí)間: 2025-3-29 12:37
Brendan Brown,Philippe Simonnot. The real size test problems, based on the data taken from the production control system, are presented for assessment of the proposed algorithms. The obtained results show that the genetic algorithm with two repair functions can generate good suboptimal solutions in the time, which can be acceptable from the decision maker point of view.作者: 跑過 時(shí)間: 2025-3-29 17:31 作者: 真 時(shí)間: 2025-3-29 23:06
lf-adaptation of some evolutionary parameters of genetic algorithms (GAs). Here we intend to propose a flexible GA-based algorithm where only few parameters have to be defined by the user. Benchmark problems of combinatorial optimization were used to test the performance of the proposed approach.作者: intricacy 時(shí)間: 2025-3-30 03:04
András Kovács,Anikó Horváth,Zsuzsanna Vidrauristics. Some new theoretical improvements not present in early algorithms are now introduced. An application for pattern sequencing problems is examined with new improved computational results. The method is also compared against other approaches, using benchmark instances taken from the literature.作者: 堅(jiān)毅 時(shí)間: 2025-3-30 07:30
On the Application of Evolutionary Algorithms to the Consensus Tree Problem,hms are evaluated on a benchmark composed of phylogenetic trees computed from genomic data. The GP-like algorithm is shown to provide better results than the other evolutionary algorithms, and than two greedy heuristics defined . for this problem.作者: Synchronism 時(shí)間: 2025-3-30 08:38 作者: 與野獸博斗者 時(shí)間: 2025-3-30 15:38
Lot-Sizing in a Foundry Using Genetic Algorithm and Repair Functions,. The real size test problems, based on the data taken from the production control system, are presented for assessment of the proposed algorithms. The obtained results show that the genetic algorithm with two repair functions can generate good suboptimal solutions in the time, which can be acceptable from the decision maker point of view.作者: peak-flow 時(shí)間: 2025-3-30 17:10 作者: Nibble 時(shí)間: 2025-3-30 23:01 作者: 錫箔紙 時(shí)間: 2025-3-31 04:53 作者: HARP 時(shí)間: 2025-3-31 06:43 作者: defile 時(shí)間: 2025-3-31 12:45 作者: 配偶 時(shí)間: 2025-3-31 15:32 作者: 痛苦一下 時(shí)間: 2025-3-31 19:16 作者: HPA533 時(shí)間: 2025-3-31 22:53
Europe — Toward the Next Enlargementnty-three different problem instances having three different sizes (10, 20, and 30) plus two and three objectives are solved. Results indicate that the MOMGA-IIa resolves all pareto optimal points for problem instances < 20.作者: Fracture 時(shí)間: 2025-4-1 04:17 作者: ORBIT 時(shí)間: 2025-4-1 09:21 作者: 逃避責(zé)任 時(shí)間: 2025-4-1 10:57
Scatter Search Particle Filter to Solve the Dynamic Travelling Salesman Problem,mental results have shown that SSPF performance is significantly better than classical DTSP approaches, where new solutions of derived problems are obtained without taking advantage of previous solutions corresponding to similar problems. Our proposal reduces execution time appreciably without affecting the quality of the estimated solution.作者: 圍巾 時(shí)間: 2025-4-1 18:11 作者: 小官 時(shí)間: 2025-4-1 20:55
A Novel Application of Evolutionary Computing in Process Systems Engineering, Analysis (OA), this study being a crucial stage in the design and revamp of process-plant instrumentation. The MOGAI is a binary-coded genetic algorithm with a three-objective fitness function based on cost, reliability and observability metrics. MOGAI’s special features are: dynamic adaptive bit-f作者: 功多汁水 時(shí)間: 2025-4-1 22:55
Choosing the Fittest Subset of Low Level Heuristics in a Hyperheuristic Framework,s. The sequence of low level heuristics, applied in an order which is intelligently determined by the hyperheuristic, form a solution method for the problem. In this paper, we consider a hyperheuristic-based methodology where a large set of low level heuristics is constructed by combining simple sel作者: chalice 時(shí)間: 2025-4-2 04:28 作者: 周興旺 時(shí)間: 2025-4-2 06:59 作者: 漸強(qiáng) 時(shí)間: 2025-4-2 11:42
On the Application of Evolutionary Algorithms to the Consensus Tree Problem,roblem, featuring characteristics of genetic programming (GP), evolution strategies (ES) and evolutionary programming (EP) respectively. These algorithms are evaluated on a benchmark composed of phylogenetic trees computed from genomic data. The GP-like algorithm is shown to provide better results t作者: 關(guān)節(jié)炎 時(shí)間: 2025-4-2 15:54 作者: 預(yù)示 時(shí)間: 2025-4-2 19:34 作者: 開花期女 時(shí)間: 2025-4-3 03:38
,Multiobjective Quadratic Assignment Problem Solved by an Explicit Building Block Search Algorithm –ns. The application addressed in this paper is the minimization of communication flows in a heterogenous mix of Organic Air Vehicles (OAV). A multi-objective approach to solving the general mQAP for this OAV application is developed. The combinatoric nature of this problem calls for a stochastic sea
