標題: Titlebook: Evolutionary Computation in Combinatorial Optimization; 6th European Confere Jens Gottlieb,Günther R. Raidl Conference proceedings 2006 Spr [打印本頁] 作者: 使沮喪 時間: 2025-3-21 18:13
書目名稱Evolutionary Computation in Combinatorial Optimization影響因子(影響力)
書目名稱Evolutionary Computation in Combinatorial Optimization影響因子(影響力)學科排名
書目名稱Evolutionary Computation in Combinatorial Optimization網絡公開度
書目名稱Evolutionary Computation in Combinatorial Optimization網絡公開度學科排名
書目名稱Evolutionary Computation in Combinatorial Optimization被引頻次
書目名稱Evolutionary Computation in Combinatorial Optimization被引頻次學科排名
書目名稱Evolutionary Computation in Combinatorial Optimization年度引用
書目名稱Evolutionary Computation in Combinatorial Optimization年度引用學科排名
書目名稱Evolutionary Computation in Combinatorial Optimization讀者反饋
書目名稱Evolutionary Computation in Combinatorial Optimization讀者反饋學科排名
作者: 竊喜 時間: 2025-3-21 20:39
Hierarchical Cellular Genetic Algorithm,ributed layout. We examine the effect of the introduced hierarchy by observing the variable takeover rates at different hierarchy levels and we compare the H-cGA to the cGA algorithm on a set of benchmark problems and show that the new approach performs promising.作者: Host142 時間: 2025-3-22 03:26 作者: adj憂郁的 時間: 2025-3-22 04:49
The Case Against Ethnophilosophypproaches know nothing of the weights. The result is highly significant for complex real-world problems where objective weights are seldom known in advance since it suggests that a multi-objective approach can generate a solution close to the user preferred one without having knowledge of user prefe作者: Microaneurysm 時間: 2025-3-22 10:51
https://doi.org/10.1007/978-3-658-32824-5ributed layout. We examine the effect of the introduced hierarchy by observing the variable takeover rates at different hierarchy levels and we compare the H-cGA to the cGA algorithm on a set of benchmark problems and show that the new approach performs promising.作者: 細胞 時間: 2025-3-22 13:30
Claudio Campagna,Robert Harcourtapplied to TSP benchmarks up to instances of 13509 cities. Experimental results reveal that EAX-1AB(ENT) with a population of 200 can almost always find optimal solutions effectively in most TSP benchmarks up to instances of 5915 cities. In the experiments, a previously proposed EAs using EAX can fi作者: 細胞 時間: 2025-3-22 18:11
Evolutionary Computation in Combinatorial Optimization6th European Confere作者: 敲詐 時間: 2025-3-22 21:53 作者: Alienated 時間: 2025-3-23 02:20 作者: GUMP 時間: 2025-3-23 06:01
Ethnopharmacology of Medicinal Plantshe problem concerns partitioning the nodes of a weighted graph into two subsets such that the total weight of each set is within some lower and upper bounds. The objective is to minimize the total cost of the edges between both subsets of the partition. We formulate the problem as an integer program作者: 神刊 時間: 2025-3-23 13:10
The Case Against Ethnophilosophyis difficult problem we consider the trade off in solution quality versus population diversity, for different sets of fixed objective weights. Our real-world workforce scheduling problem consists of assigning resources with the appropriate skills to geographically dispersed task locations while sati作者: 在前面 時間: 2025-3-23 15:26 作者: Simulate 時間: 2025-3-23 20:26
,Selbstkonstruktion und Identit?t,east cost combination of diameters, from a discrete set of commercially available ones, for the pipes of a given gas network, satisfying the constraints related to minimum pressure requirements and upstream pipe conditions. Since this is a nonlinear mixed integer problem, metaheuristic approaches se作者: 招惹 時間: 2025-3-23 23:44
https://doi.org/10.1007/978-3-030-26604-2house. We propose a hybrid evolutionary algorithm where the delivery patterns are evolved for each shop, while the delivery routes are obtained employing the multistart sweep algorithm. The experiments performed show that this method can obtain acceptable results consistently and within a reasonable作者: 入伍儀式 時間: 2025-3-24 03:49 作者: Accomplish 時間: 2025-3-24 06:46
Cheryl Lans,Candice Sant,Karla Georgeshe hybridization of BE with evolutionary algorithms endowed with tabu search. The resulting memetic algorithm (MA) uses BE as a mechanism for recombining solutions, providing the best possible child from the parental set. This MA is applied to the maximum density still life problem. Experimental tes作者: Radiation 時間: 2025-3-24 12:59 作者: 同來核對 時間: 2025-3-24 16:04
https://doi.org/10.1007/978-3-658-35416-9local search and path-relinking procedures. The paper proposes two versions of the algorithm, each of them utilizing a distinct local search method. The proposed heuristics are compared with other Particle Swarm Optimization algorithms presented previously for the same problem. The results are also 作者: faucet 時間: 2025-3-24 19:27
https://doi.org/10.1007/978-3-658-32824-5 GAs on several optimization functions. Also, since these distributed algorithms only require communication between few closely arranged individuals, they are very suitable for a parallel implementation. We propose a new kind of cGA, called hierarchical cGA (H-cGA), where the population structure is作者: Interim 時間: 2025-3-25 01:44 作者: 取消 時間: 2025-3-25 04:48
Zum Messen von Wohlbefinden bei Nutztieren,We propose two different genetic algorithms based on different encoding schemes. The first one is a sequence based GA (SGA) that generates random sequences of jobs and applies the batch first fit (BFF) heuristic to group the jobs. The second one is a batch based hybrid GA (BHGA) that generates rando作者: 大笑 時間: 2025-3-25 09:48
Christopher W. Clark,George J. Gagnonons can be represented as relations and formulate some standard mutation and crossover operators for this representation using relation-algebra. Evaluating a population with respect to their constraints seems to be the most costly step in one generation for many important problems. We show that the 作者: rectocele 時間: 2025-3-25 11:46 作者: 偉大 時間: 2025-3-25 18:06 作者: Esalate 時間: 2025-3-25 23:55 作者: 法律的瑕疵 時間: 2025-3-26 02:59
Randall W. Davis,James L. Bodkin-dimensional case. The core for the multidimensional problem is defined in dependence of a chosen efficiency function of the items, since no single obvious efficiency measure is available for MKP. An empirical study on the cores of widely-used benchmark instances is presented, as well as experiments作者: 外表讀作 時間: 2025-3-26 06:03
https://doi.org/10.1007/978-3-030-90742-6me time on the same machine. The processing time of a batch is given by the identical processing time of the jobs within one incompatible family. We are interested in minimizing total weighted tardiness and makespan at the same time. In order to solve this problem, i.e. generate a Pareto-front, we s作者: 我要沮喪 時間: 2025-3-26 10:12 作者: 后退 時間: 2025-3-26 12:40
978-3-540-33178-0Springer-Verlag Berlin Heidelberg 2006作者: 杠桿支點 時間: 2025-3-26 19:13
Evolutionary Computation in Combinatorial Optimization978-3-540-33179-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 針葉 時間: 2025-3-26 23:28 作者: 糾纏,纏繞 時間: 2025-3-27 04:11
Sighard Neckel,Ferdinand Sutterlütyaphs as problem solvers, using several standard discrete optimization problems as a benchmark. The EA variants employed include self-adaptation of mutation rates. Results are compared with the corresponding classical panmictic EA showing that topology together with self-adaptation drastically influences the search.作者: 迷住 時間: 2025-3-27 08:34 作者: 袋鼠 時間: 2025-3-27 12:27 作者: deceive 時間: 2025-3-27 14:35 作者: encyclopedia 時間: 2025-3-27 17:49
Cheryl Lans,Candice Sant,Karla Georgesing solutions, providing the best possible child from the parental set. This MA is applied to the maximum density still life problem. Experimental tests indicate that the MA provides optimal or near-optimal results at an acceptable computational cost.作者: 休戰(zhàn) 時間: 2025-3-28 00:04
Die drei Phasen der Ethohydraulik,al of the model, we use it in ., in an evolutionary algorithm, and in the same evolutionary algorithm extended with heuristics. An empiricial investigation is performed to show an increase in efficiency on two problem suites , a set of practical problem instances and a set of hard problem instances from the phase transition.作者: 使困惑 時間: 2025-3-28 02:44 作者: Inelasticity 時間: 2025-3-28 06:26
Jerome Cranston,Kristin Kusanovich hybrid metaheuristic of GRASP with a parametrized scoring function is called parametrized GRASP heuristic (PGRASP). We present a PGRASP algorithm for the axial three index assignment problem (AP3) and computational results comparing PGRASP with the classical GRASP strategy.作者: Obedient 時間: 2025-3-28 12:22
Zum Messen von Wohlbefinden bei Nutztieren,ts show that BHGA performs considerably well compared with a modified lower bound and significantly outperforms the SGA and a simulated annealing (SA) approach addressed in literature. In comparison with a constructive heuristic named FFLPT, BHGA also shows its superiority.作者: Aqueous-Humor 時間: 2025-3-28 18:19 作者: 不知疲倦 時間: 2025-3-28 20:45 作者: Granular 時間: 2025-3-29 01:30
Parametrized GRASP Heuristics for Three-Index Assignment, hybrid metaheuristic of GRASP with a parametrized scoring function is called parametrized GRASP heuristic (PGRASP). We present a PGRASP algorithm for the axial three index assignment problem (AP3) and computational results comparing PGRASP with the classical GRASP strategy.作者: 無可爭辯 時間: 2025-3-29 05:12 作者: 詼諧 時間: 2025-3-29 10:37
A Relation-Algebraic View on Evolutionary Algorithms for Some Graph Problems,utation of maximum cliques, and the determination of a maximum independent set. Extending the evaluation process for a given population to the evaluation of the whole search space we get exact methods for the considered problems, which allow to evaluate the quality of solutions obtained by evolutionary algorithms.作者: pantomime 時間: 2025-3-29 11:46 作者: 消息靈通 時間: 2025-3-29 19:24
,Selbstkonstruktion und Identit?t,blem and the results of the proposed algorithm are compared with the results of a genetic algorithm and two other versions of tabu search algorithms. The results are very promising, regarding both quality of solutions and computational time.作者: mucous-membrane 時間: 2025-3-29 22:12 作者: chiropractor 時間: 2025-3-30 01:21
Randall W. Davis,James L. Bodkinwhich are applied to the original and to the core problems. The experimental results show that given a fixed run-time, the different metaheuristics as well as a general purpose integer linear programming solver yield better solution when applied to approximate core problems of fixed size.作者: 清澈 時間: 2025-3-30 07:08
A Tabu Search Algorithm for Optimization of Gas Distribution Networks,blem and the results of the proposed algorithm are compared with the results of a genetic algorithm and two other versions of tabu search algorithms. The results are very promising, regarding both quality of solutions and computational time.作者: 極少 時間: 2025-3-30 12:10
A Memetic Algorithm with Population Management (MA|PM) for the Capacitated Location-Routing Problemhod is evaluated on three sets of instances, and compared to other heuristics and a lower bound. The preliminary results are quite promising since the MA|PM already finds the best results on several instances.作者: exercise 時間: 2025-3-30 14:38 作者: Diuretic 時間: 2025-3-30 17:25
https://doi.org/10.1007/978-3-030-26604-2 timescale. The results are also of a lower cost than those obtained by other strategies employed in previous research. Furthermore, they confirm the interest of addressing the optimisation problem jointly, rather than minimising separately inventory and transport.作者: 輕快帶來危險 時間: 2025-3-30 22:50
https://doi.org/10.1007/978-3-658-35416-9compared with three effective algorithms for the TSP. A computational experiment with benchmark instances is reported. The results show that the method proposed in this paper finds high quality solutions and is comparable with the effective approaches presented for the TSP.作者: Interferons 時間: 2025-3-31 04:20 作者: Density 時間: 2025-3-31 06:46 作者: ORBIT 時間: 2025-3-31 09:48
