標(biāo)題: Titlebook: Evolutionary Computation in Combinatorial Optimization; 9th European Confere Carlos Cotta,Peter Cowling Conference proceedings 2009 Springe [打印本頁] 作者: Kennedy 時(shí)間: 2025-3-21 19:14
書目名稱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é)科排名
作者: Abutment 時(shí)間: 2025-3-21 20:15
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/e/image/317875.jpg作者: landmark 時(shí)間: 2025-3-22 03:59
https://doi.org/10.1007/978-3-642-01009-5Variable; algorithm; algorithms; combinatorial optimization; evolutionary algorithm; greedy randomized ad作者: 有說服力 時(shí)間: 2025-3-22 08:06 作者: Militia 時(shí)間: 2025-3-22 12:44
Exact Solutions to the Traveling Salesperson Problem by a Population-Based Evolutionary Algorithm,upper bounds on the runtime until an optimum solution has been found. To the best of our knowledge this is the first time it has been shown that an .-hard problem is solved exactly instead of approximated only by a black box algorithm.作者: STRIA 時(shí)間: 2025-3-22 14:09 作者: STRIA 時(shí)間: 2025-3-22 18:44 作者: 碎片 時(shí)間: 2025-3-22 22:07 作者: DRILL 時(shí)間: 2025-3-23 02:34 作者: Lice692 時(shí)間: 2025-3-23 07:38 作者: vibrant 時(shí)間: 2025-3-23 11:16
Ethnobotany in the Balkans: Quo Vadis?,epresentation of the problem, a . solving scheme, two different . neighborhoods, a . mechanism and a . tabu structure. The representation allows inexpensive basic operations. The solving scheme considers the 2D-SPP as a succession of satisfaction problems. The goal of the combination of two neighbor作者: Emmenagogue 時(shí)間: 2025-3-23 15:27
SpringerBriefs in Plant Science, called ACOPlan, which is able to optimize the solutions of propositional planning problems, with respect to the plans length. Since planning is a hard computational problem, metaheuristics are suitable to find good solutions in a reasonable computation time. Preliminary experiments are very encour作者: Arroyo 時(shí)間: 2025-3-23 18:41
Barbara Pickersgill Ph.D., B.Sc. (Hons.)ion modes are available for each of the activities of the project, is presented. The AIS algorithm makes use of mechanisms which are inspired on the vertebrate immune system performed on an initial population set. This population set is generated with a controlled search method, based on experimenta作者: 全部逛商店 時(shí)間: 2025-3-24 01:11
https://doi.org/10.1007/978-3-319-10656-4ctive functions we chose the optimization of the makespan. For solving this problem we propose a so-called Beam-ACO algorithm, which is a hybrid method that combines ant colony optimization with beam search. In general, Beam-ACO algorithms heavily rely on accurate and computationally inexpensive bou作者: laparoscopy 時(shí)間: 2025-3-24 05:13
Reflections on Multiculturalism,y Exponential Back Off (BEBO) method used in network communication. We compare this method to a reduced Variable Neighbourhood Search (rVNS), greedy and random hyperheuristic approaches and other tabu search based heuristics for a complex real world workforce scheduling problem. Parallelisation is u作者: curriculum 時(shí)間: 2025-3-24 09:35
Ethnocinema: Intercultural Arts Educationn enhanced crossover that collects the . color classes out of . parents; the best color classes are selected using a ranking based on both class fitness and class size. We also introduce a simple method of using distances to assure the population diversity: at each operation that inserts an individu作者: Brain-Imaging 時(shí)間: 2025-3-24 13:32 作者: Ventricle 時(shí)間: 2025-3-24 15:04
International and Cultural Psychologyupper bounds on the runtime until an optimum solution has been found. To the best of our knowledge this is the first time it has been shown that an .-hard problem is solved exactly instead of approximated only by a black box algorithm.作者: uveitis 時(shí)間: 2025-3-24 22:50 作者: Gustatory 時(shí)間: 2025-3-24 23:43 作者: Entreaty 時(shí)間: 2025-3-25 03:57 作者: avenge 時(shí)間: 2025-3-25 08:08
Die ethnopsychoanalytische Deutungswerkstattnew iterated local search to solve this problem by combining filtering techniques with local search. The algorithm is benchmarked using instances with up to 1000 nodes, and results are compared to optimal or best known results as well as other heuristics. For these instances, the proposed algorithm 作者: CEDE 時(shí)間: 2025-3-25 12:21 作者: Genteel 時(shí)間: 2025-3-25 19:05 作者: 蛛絲 時(shí)間: 2025-3-25 21:02
978-3-642-01008-8Springer-Verlag Berlin Heidelberg 2009作者: LEVER 時(shí)間: 2025-3-26 00:56 作者: antiquated 時(shí)間: 2025-3-26 04:47 作者: allergy 時(shí)間: 2025-3-26 11:41 作者: Vsd168 時(shí)間: 2025-3-26 13:44 作者: Prosaic 時(shí)間: 2025-3-26 17:19
Research on Family-School Partnershipsbest quality results in a number of instances. Moreover, those results can be further improved by removing the time constraint, and correcting a problem due to completely random individuals. Room for further improvements are also explored.作者: hieroglyphic 時(shí)間: 2025-3-26 23:36 作者: 黃瓜 時(shí)間: 2025-3-27 04:00 作者: STYX 時(shí)間: 2025-3-27 08:15
Irene Fiechtner-Stotz,Maren Brackernential time. This result is both proven theoretically and illustrated by experimental data. The classification of functions into easy and hard problem instances allows a deep insight into the problem solving power of the Metropolis algorithm and can be used in the process of selecting an optimization algorithm for a concrete problem instance.作者: 樂章 時(shí)間: 2025-3-27 13:09
A Critical Element-Guided Perturbation Strategy for Iterated Local Search,f critical elements and then focusing on these critical elements within the perturbation operator. Computational experiments on two case studies—graph coloring and course timetabling—give evidence that this critical element-guided perturbation strategy helps reinforce the performance of Iterated Local Search.作者: Tempor 時(shí)間: 2025-3-27 14:07
An ACO Approach to Planning,rd computational problem, metaheuristics are suitable to find good solutions in a reasonable computation time. Preliminary experiments are very encouraging, because ACOPlan sometimes finds better solutions than state of art planning systems. Moreover, this algorithm seems to be easily extensible to other planning models.作者: 天賦 時(shí)間: 2025-3-27 18:54 作者: 運(yùn)動吧 時(shí)間: 2025-3-27 22:16 作者: 新奇 時(shí)間: 2025-3-28 04:08
Iterated Local Search for Minimum Power Symmetric Connectivity in Wireless Networks, up to 1000 nodes, and results are compared to optimal or best known results as well as other heuristics. For these instances, the proposed algorithm is able to find optimal and near-optimal solutions and outperforms previous heuristics.作者: 包裹 時(shí)間: 2025-3-28 06:37
Metropolis and Symmetric Functions: A Swan Song,nential time. This result is both proven theoretically and illustrated by experimental data. The classification of functions into easy and hard problem instances allows a deep insight into the problem solving power of the Metropolis algorithm and can be used in the process of selecting an optimization algorithm for a concrete problem instance.作者: carotenoids 時(shí)間: 2025-3-28 11:24
Conference proceedings 2009held in Tübingen, Germany, in April 2009. The 21 revised full papers presented were carefully reviewed and selected from 53 submissions. The papers present the latest research and discuss current developments and applications in metaheuristics - a paradigm to effectively solve difficult combinatoria作者: defendant 時(shí)間: 2025-3-28 17:54 作者: 排名真古怪 時(shí)間: 2025-3-28 19:05 作者: Prostatism 時(shí)間: 2025-3-28 22:56 作者: Contend 時(shí)間: 2025-3-29 03:48 作者: Pillory 時(shí)間: 2025-3-29 07:51 作者: Customary 時(shí)間: 2025-3-29 14:18
Finding Balanced Incomplete Block Designs with Metaheuristics,based neighborhood, and the impressive performance of tabu search. This latter approach is capable of outperforming two techniques that had reported the best results in the literature (namely, a neural network with simulated annealing and a constraint local search algorithm).作者: 門閂 時(shí)間: 2025-3-29 19:21
Ethnobotany of Karakorum, Pakistan,eates children from parents taken from three different populations, each containing relevant information about the (positive or negative) activity cash flows. We have tested various parent selection methods based on four crossover operators taken from literature and present extensive computational results.作者: AXIOM 時(shí)間: 2025-3-29 23:09
Kotschy, , Lam., , L. - ASTERACEAElocal improvement procedure within VNS. Experimental results indicate that our method provides valuable pickup plans, whereas the computation times are kept low and several constraints typically stated by spare parts suppliers are fulfilled.作者: scoliosis 時(shí)間: 2025-3-30 02:23
Data collection and hypothesis testing,ently for the investigated problem. The comparison of the algorithms is done with basis on the binary additive ε-indicator. The results show that the proposed algorithm consistently produces better solutions than the other methods.作者: EXULT 時(shí)間: 2025-3-30 04:05 作者: Jubilation 時(shí)間: 2025-3-30 09:57 作者: anachronistic 時(shí)間: 2025-3-30 15:34
Reflections on Multiculturalism,sed to perform nearly 155 CPU-days of experiments. The results show that the new methods can produce results fitter than rVNS methods and within 99% of the fitness of those produced by a highly CPU-intensive greedy hyperheuristic in a fraction of the time.作者: GULP 時(shí)間: 2025-3-30 18:45
Milta Oyola Little D.O., C.M.D.local search and problem-dependent local searches. The experimental results for the standard benchmarks for the JSP demonstrate that the suggested GES is robust and highly competitive with the state-of-the-art metaheuristics for the JSP.作者: 有特色 時(shí)間: 2025-3-30 23:53 作者: Jogging 時(shí)間: 2025-3-31 03:11
A Hybrid Algorithm for Computing Tours in a Spare Parts Warehouse,local improvement procedure within VNS. Experimental results indicate that our method provides valuable pickup plans, whereas the computation times are kept low and several constraints typically stated by spare parts suppliers are fulfilled.作者: dysphagia 時(shí)間: 2025-3-31 06:34 作者: bonnet 時(shí)間: 2025-3-31 09:27
An Artificial Immune System for the Multi-Mode Resource-Constrained Project Scheduling Problem,l results which revealed a link between predefined profit values of a mode assignment and its makespan. The impact of the algorithmic parameters and the initial population generation method is observed and detailed comparative computational results for the MRCPSP are presented.作者: chapel 時(shí)間: 2025-3-31 13:24
Beam-ACO Based on Stochastic Sampling for Makespan Optimization Concerning the TSP with Time Windownding information for differentiating between partial solutions. In this work we use stochastic sampling as an alternative to bounding information. Our results clearly demonstrate that the proposed algorithm is currently a state-of-the-art method for the tackled problem.作者: 正常 時(shí)間: 2025-3-31 18:27
Binary Exponential Back Off for Tabu Tenure in Hyperheuristics,sed to perform nearly 155 CPU-days of experiments. The results show that the new methods can produce results fitter than rVNS methods and within 99% of the fitness of those produced by a highly CPU-intensive greedy hyperheuristic in a fraction of the time.作者: 考博 時(shí)間: 2025-4-1 01:25
Guided Ejection Search for the Job Shop Scheduling Problem,local search and problem-dependent local searches. The experimental results for the standard benchmarks for the JSP demonstrate that the suggested GES is robust and highly competitive with the state-of-the-art metaheuristics for the JSP.作者: opprobrious 時(shí)間: 2025-4-1 04:21 作者: 反省 時(shí)間: 2025-4-1 09:33
0302-9743 ionary algorithms, simulated annealing, tabu search, scatter search, memetic algorithms, variable neighborhood search, iterated local search, greedy randomized adaptive search procedures, estimation of distribution algorithms and ant colony optimization.978-3-642-01008-8978-3-642-01009-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 允許 時(shí)間: 2025-4-1 13:14
Helga Velimirovic,Boris Velimirovicequirements. We implement the binary representation and use it within a look ahead heuristic. Comparing our results with those from literature, our method outperforms best known approaches in terms of solution quality and computational time.
