標(biāo)題: Titlebook: Evolutionary Computation in Combinatorial Optimization; 7th European Confere Carlos Cotta,Jano Hemert Conference proceedings 2007 Springer- [打印本頁] 作者: HIV763 時間: 2025-3-21 16:40
書目名稱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é)科排名
作者: Mortar 時間: 2025-3-21 20:56 作者: Introduction 時間: 2025-3-22 04:22 作者: fatty-streak 時間: 2025-3-22 08:14 作者: 蔑視 時間: 2025-3-22 10:02
Evolutionary Computation in Combinatorial Optimization7th European Confere作者: excrete 時間: 2025-3-22 16:23
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/e/image/317881.jpg作者: excrete 時間: 2025-3-22 18:38 作者: Indict 時間: 2025-3-22 22:59 作者: concert 時間: 2025-3-23 01:30 作者: grandiose 時間: 2025-3-23 09:32 作者: incisive 時間: 2025-3-23 10:54
Neither Fallen Angel Nor Risen Ape,s paper presents a novel randomized search strategy, called probabilistic beam search (PBS), based on the hybridization between beam search and greedy constructive heuristics. PBS is competitive (and sometimes better than) previous state-of-the-art algorithms for solving the SCSP. The paper describe作者: 平息 時間: 2025-3-23 15:17 作者: 顯而易見 時間: 2025-3-23 21:48 作者: 滔滔不絕地講 時間: 2025-3-24 01:10 作者: Common-Migraine 時間: 2025-3-24 02:32 作者: capsaicin 時間: 2025-3-24 10:17
Steven D. Schwartzbach,Shigeru Shigeokac conditions. However, most of these models are far from considering actual technologies currently deployed in GSM networks (e.g. frequency hopping). These technologies allow the network capacity to be actually increased to some extent by avoiding the interferences provoked by channel reuse due to t作者: oncologist 時間: 2025-3-24 12:32 作者: 直言不諱 時間: 2025-3-24 17:35
https://doi.org/10.1007/978-3-663-02425-5itions is an NP-hard problem and different algorithms have been proposed in the literature for generation of tree decompositions of small width. In this paper we propose a novel iterated local search algorithm to find good upper bounds for treewidth of an undirected graph. We propose two heuristics,作者: minion 時間: 2025-3-24 22:06 作者: macrophage 時間: 2025-3-25 02:21
Eukaryotic Cell Function and Growth) and Genetic Algorithms (GAs). More precisely, a GA engine works as a generator of reduced instances for the original CL problem, which are formulated as ILP models. These instances, in turn, are solved by an exact optimization technique (solver), and the performance measures accomplished by the re作者: enchant 時間: 2025-3-25 07:06 作者: 是他笨 時間: 2025-3-25 07:29 作者: 同位素 時間: 2025-3-25 15:21 作者: FEAT 時間: 2025-3-25 17:33
Andrzej J. Rutkowski,Lars D?lkenof combinatorial optimisation heuristics. Ant Colony Optimisation (ACO) is the class of heuristic investigated. Results demonstrate that for a given instance size, an increase in the standard deviation of the cost matrix of instances results in an increase in the difficulty of the instances. This im作者: 兇殘 時間: 2025-3-25 23:30 作者: 咽下 時間: 2025-3-26 01:38 作者: ABOUT 時間: 2025-3-26 05:26
Eugène Dubois and the Ape-Man from Java can be split, i.e., any client can be serviced by more than one vehicle. The proposed algorithm, based on the scatter search methodology, produces a feasible solution using the minimum number of vehicles. The results obtained compare with the best results known up to date on a set of instances previously published in the literature.作者: 出汗 時間: 2025-3-26 12:03 作者: Confirm 時間: 2025-3-26 15:37
A New Metaheuristic for the Vehicle Routing Problem with Split Demands, can be split, i.e., any client can be serviced by more than one vehicle. The proposed algorithm, based on the scatter search methodology, produces a feasible solution using the minimum number of vehicles. The results obtained compare with the best results known up to date on a set of instances previously published in the literature.作者: Demonstrate 時間: 2025-3-26 17:07 作者: 傳染 時間: 2025-3-26 23:48
Evolutionary Computation in Combinatorial Optimization978-3-540-71615-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: refine 時間: 2025-3-27 04:57
0302-9743 Overview: 978-3-540-71614-3978-3-540-71615-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: majestic 時間: 2025-3-27 08:26
https://doi.org/10.1007/978-3-030-58764-2This paper presents a simple algorithm for the job shop scheduling problem that combines the local search heuristic GRASP with a branch-and-bound exact method of integer programming. The proposed method is compared with similar approaches and leads to better results in terms of solution quality and computing times.作者: Germinate 時間: 2025-3-27 10:53 作者: cardiovascular 時間: 2025-3-27 17:07 作者: jabber 時間: 2025-3-27 20:47 作者: DNR215 時間: 2025-3-28 01:01
Growth, Metabolism, and Structure,een solutions. Computational experiments indicate that in the capacitated vehicle routing problem the usage of these techniques is not really profitable, because of cache management overhead and implementation issues.作者: 群居動物 時間: 2025-3-28 03:16
Corinne M. Gajdusek,Sandra A. Harris-Hooker. Moreover, a local search is also incorporated into the EA. The experimental results demonstrate that the proposed EA can effectively find the best-known solutions on . benchmark. Moreover, our EA found ten new best solutions for . instances in a reasonable computation time.作者: 表示向下 時間: 2025-3-28 08:19 作者: Asperity 時間: 2025-3-28 12:45 作者: Redundant 時間: 2025-3-28 15:58 作者: 詩集 時間: 2025-3-28 19:28 作者: 騙子 時間: 2025-3-29 00:49
A Genetic Algorithm for the Resource Renting Problem with Minimum and Maximum Time Lags, projects where resources are rented. Based on a new codification of a solution for project scheduling, we develop a Genetic Algorithm capable of outperforming a branch-and-bound procedure that exists for the problem.作者: 下垂 時間: 2025-3-29 06:32 作者: 聯(lián)邦 時間: 2025-3-29 07:54 作者: 禍害隱伏 時間: 2025-3-29 13:08 作者: 表狀態(tài) 時間: 2025-3-29 15:44 作者: 敲詐 時間: 2025-3-29 23:21 作者: Mobile 時間: 2025-3-30 01:13 作者: sphincter 時間: 2025-3-30 05:03 作者: 委屈 時間: 2025-3-30 08:16 作者: 評論者 時間: 2025-3-30 12:53 作者: 掃興 時間: 2025-3-30 16:33
A Probabilistic Beam Search Approach to the Shortest Common Supersequence Problem, constructive heuristics. PBS is competitive (and sometimes better than) previous state-of-the-art algorithms for solving the SCSP. The paper describes PBS and provides an experimental analysis (including comparisons with previous approaches) that demonstrate its usefulness.作者: 離開就切除 時間: 2025-3-30 20:44 作者: 熟練 時間: 2025-3-31 04:52 作者: Celiac-Plexus 時間: 2025-3-31 06:58 作者: 調(diào)色板 時間: 2025-3-31 09:50
Eukaryotic Cell Function and Growth on standard benchmark problems, as well as a practical case study developed in a metallurgic factory, are also reported and discussed here in a manner as to testify the potentialities behind the novel approach.作者: inventory 時間: 2025-3-31 17:22
Francisco Rivero,Fatima Cvr?kováarly one CPU-year of experiments. The results show that the new methods can produce results fitter than the Genetic Algorithm in less time and that they are far superior to any of their component techniques. The method used to split up the problem is generalisable and could be applied to a wide range of optimisation problems.作者: Fracture 時間: 2025-3-31 19:24 作者: 膝蓋 時間: 2025-3-31 22:06
A Hybrid Immune-Based System for the Protein Folding Problem,arch strategy. Penalty methods versus feasible search methods are also compared. The proposed hybrid algorithms are tested on a set of standard benchmark instances of PFP and the results attest the efficiency of the methodology.作者: 帶子 時間: 2025-4-1 02:04 作者: GEM 時間: 2025-4-1 08:52 作者: sleep-spindles 時間: 2025-4-1 11:27
A New Local Search Algorithm for the DNA Fragment Assembly Problem, a problem to be solved in the early phases of the genome project and thus is very important since the other steps depend on its accuracy. This is an NP-hard combinatorial optimization problem which is growing in importance and complexity as more research centers become involved on sequencing new ge作者: 高調(diào) 時間: 2025-4-1 15:12
A Hybrid Immune-Based System for the Protein Folding Problem,m (PFP) in the 3D Hydrophobic-Polar model, which is a particular instance of the Combinatorial String Folding Problem in a cubic lattice. The proposed methodology aims at enhancing the Clonalg algorithm with a Fuzzy Aging Operator and Weak and Intensive Affinity Maturation. The aging operator uses a作者: exquisite 時間: 2025-4-1 19:26
A Genetic Algorithm for the Resource Renting Problem with Minimum and Maximum Time Lags,of the more well known Resource Investment Problem, which considers only time-independent costs, this problem includes both time-independent fixed costs and time-dependent variable renting costs for the resources. Consequently, in addition to projects where all resources are bought, we can deal with
