標(biāo)題: Titlebook: Evolutionary Computation in Combinatorial Optimization; 4th European Confere Jens Gottlieb,Günther R. Raidl Conference proceedings 2004 Spr [打印本頁(yè)] 作者: papyrus 時(shí)間: 2025-3-21 17:17
書目名稱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é)科排名
作者: Comprise 時(shí)間: 2025-3-21 22:30 作者: reaching 時(shí)間: 2025-3-22 03:56 作者: enmesh 時(shí)間: 2025-3-22 06:35
Reinhard Clemens,Annette Icks,Andreas Menkeosed genetic algorithm paradigm is used for the solution of hard numerical and combinatorial optimization problems. The results demonstrate that the proposed approach performs much better than the conventional implementations in terms of solution quality and the convergence speed.作者: Acquired 時(shí)間: 2025-3-22 12:32
https://doi.org/10.1007/978-3-322-82542-1 results show that most of the introduced algorithms perform as well as Davis’ algorithm while being significantly less cumbersome to implement. Overall, the use of AOS is shown to give significant performance improvements – both in quality of result and convergence time.作者: 改變立場(chǎng) 時(shí)間: 2025-3-22 14:41
https://doi.org/10.1007/978-3-322-89332-1order representation, specific recombination and mutation operators, and a decoding heuristic. In one variant, branch-and-bound is occasionally applied to locally optimize parts of a solution during decoding.作者: 改變立場(chǎng) 時(shí)間: 2025-3-22 20:05 作者: 多產(chǎn)魚 時(shí)間: 2025-3-23 00:42
A Comparison of Adaptive Operator Scheduling Methods on the Traveling Salesman Problem results show that most of the introduced algorithms perform as well as Davis’ algorithm while being significantly less cumbersome to implement. Overall, the use of AOS is shown to give significant performance improvements – both in quality of result and convergence time.作者: Commentary 時(shí)間: 2025-3-23 02:06 作者: 表否定 時(shí)間: 2025-3-23 06:10 作者: 掙扎 時(shí)間: 2025-3-23 21:17 作者: Intuitive 時(shí)間: 2025-3-24 00:41 作者: 品嘗你的人 時(shí)間: 2025-3-24 05:28
On the Use of Path Relinking for the , – Hub Median Problems. In this paper, we present an application of Path Relinking to solve the p – hub median problem and compare its effectiveness with other classical techniques. This procedure provides high quality solutions in reasonable execution times and yields a significant improvement in the size of the problems that can be solved.作者: nuclear-tests 時(shí)間: 2025-3-24 07:36 作者: freight 時(shí)間: 2025-3-24 14:39
https://doi.org/10.1007/978-3-319-94740-2Our algorithm exploits a novel, highly-specialized crossover operator that considers domain-specific information. Computational experiments performed on various synthetic benchmarks prove that our method significantly outperform the state-of-the-art algorithms with respect to all given comparison metrics on solution quality.作者: 闖入 時(shí)間: 2025-3-24 18:18
,Design Data for Column with 20-mm? Rebar,olving the referred problem is tested and compared with other two metaheuristics: a greedy randomized adaptive search procedure (GRASP) and an hybrid memetic heuristic that combines a genetic algorithm (GA) and a local search. The computational results on a set of standard test problems show the suitability of the approach.作者: 惡意 時(shí)間: 2025-3-24 22:53
https://doi.org/10.1007/978-3-319-25270-4s paper the concept of .-non-dominance is introduced which is based on indifference thresholds. Experiments dealing with the use of this technique in the framework of an evolutionary approach are reported to provide decision support in the identification and selection of electric load control strategies.作者: 粗俗人 時(shí)間: 2025-3-24 23:13 作者: aristocracy 時(shí)間: 2025-3-25 04:01 作者: stratum-corneum 時(shí)間: 2025-3-25 09:30 作者: 自作多情 時(shí)間: 2025-3-25 12:13
Scatter Search and Memetic Approaches to the Error Correcting Code Problemtion will show that these techniques can dramatically outperform previous approaches to this problem. Among other aspects, the influence of the update method, or the use of path relinking is also analyzed on increasingly large problem instances.作者: 原諒 時(shí)間: 2025-3-25 17:38 作者: 斑駁 時(shí)間: 2025-3-25 21:21 作者: 事物的方面 時(shí)間: 2025-3-26 00:52
Dealing with Solution Diversity in an EA for Multiple Objective Decision Support – A Case Studys paper the concept of .-non-dominance is introduced which is based on indifference thresholds. Experiments dealing with the use of this technique in the framework of an evolutionary approach are reported to provide decision support in the identification and selection of electric load control strategies.作者: 仔細(xì)閱讀 時(shí)間: 2025-3-26 05:31
A Study into Ant Colony Optimisation, Evolutionary Computation and Constraint Programming on Binary amming. The resampling ratio is used to provide insight into heuristic algorithms performances. Regarding efficiency, we show that if constraint programming is the fastest when instances have a low number of variables, ant colony optimisation becomes faster when increasing the number of variables.作者: Flawless 時(shí)間: 2025-3-26 11:23 作者: 障礙物 時(shí)間: 2025-3-26 13:11
Improving Vehicle Routing Using a Customer Waiting Time Colonytal distance and a third (CWTsMAX) tries to . customer waiting time. The inclusion of this third colony improves the results very significantly, compared to not using it and to a range of other options. Experiments are conducted on Solomon’s 56 benchmark problems. The results are comparable to those obtained by other state-of-the-art approaches.作者: Sad570 時(shí)間: 2025-3-26 19:54
Landscape Regularity and Random Walks for the Job-Shop Scheduling Problem random walks performed on such a landscape will be biased. We conjecture that such a bias should affect both random walks and local search algorithms, and may provide a partial explanation for the remarkable success of the latter in solving the JSP.作者: nullify 時(shí)間: 2025-3-26 22:41
Hardness Prediction for the University Course Timetabling Problemm actually solving that problem instance. The paper introduces the definition of hardness, explains the statistical approach used for modeling instance hardness, as well as presents results obtained and possible ways of exploiting them.作者: inconceivable 時(shí)間: 2025-3-27 02:35 作者: lanugo 時(shí)間: 2025-3-27 08:21 作者: HAIRY 時(shí)間: 2025-3-27 13:26
Evolutionary Computation in Combinatorial Optimization978-3-540-24652-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 獸群 時(shí)間: 2025-3-27 14:05
0302-9743 Overview: Includes supplementary material: 978-3-540-21367-3978-3-540-24652-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 使堅(jiān)硬 時(shí)間: 2025-3-27 20:19
Jens Gottlieb,Günther R. RaidlIncludes supplementary material: 作者: 我沒有強(qiáng)迫 時(shí)間: 2025-3-27 23:56
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/e/image/317883.jpg作者: 螢火蟲 時(shí)間: 2025-3-28 02:54 作者: nutrition 時(shí)間: 2025-3-28 09:53
https://doi.org/10.1007/978-981-16-3009-5 the existence of small overlapped neighborhoods. Such a kind of structured algorithms is specially well suited for complex problems. In this paper we propose the utilization of some cGAs with and without including local search techniques for solving the vehicle routing problem (VRP). A study on the作者: dialect 時(shí)間: 2025-3-28 11:59 作者: 淡紫色花 時(shí)間: 2025-3-28 16:37 作者: 多余 時(shí)間: 2025-3-28 18:49
https://doi.org/10.1007/978-94-017-1491-4vel algorithm design features are proposed and the comprehensive computational study performed, shows both the contribution of using these features as well as the overall quality of the approach as compared to state of the art competing metaheuristics.作者: acquisition 時(shí)間: 2025-3-29 02:51 作者: Obituary 時(shí)間: 2025-3-29 05:45
https://doi.org/10.1007/978-3-319-94740-2and sophisticated register allocators for the embedded devices, where the excessive compilation time is tolerated because of its off-line nature. In this paper, we present a hybrid evolutionary algorithm for register allocation problem that combines genetic algorithms with a local search technique. 作者: Ankylo- 時(shí)間: 2025-3-29 09:02
https://doi.org/10.1057/9781137292896blem (VRP), namely the Rank based Ant System, the Max-Min Ant System and the Ant Colony System. Based on the results of this comparison we then implement a parallelization strategy to increase computational efficiency and study the effects of increasing the number of processors.作者: aneurysm 時(shí)間: 2025-3-29 12:47 作者: 與野獸博斗者 時(shí)間: 2025-3-29 17:50
Duadic Codes and Generalizationss are represented as strings of values. The set of functions is partitioned into maximal blocks of functions that are permutations of one another. A search algorithm effectively maps each test function to a permutation of the function. This mapping is partitioned into one-to-one correspondences on b作者: Enliven 時(shí)間: 2025-3-29 22:42 作者: 放縱 時(shí)間: 2025-3-30 03:22 作者: Bumptious 時(shí)間: 2025-3-30 04:25 作者: 裂縫 時(shí)間: 2025-3-30 11:42
Introduction to Computer Graphics (Part I)ce properties. The model may later be used for better understanding what makes a particular instance hard. It may also be used for tuning the algorithm actually solving that problem instance. The paper introduces the definition of hardness, explains the statistical approach used for modeling instanc作者: 人類 時(shí)間: 2025-3-30 13:19
Replacing the Stability and Growth Pact?ighted sum method is proposed, and random repair method (RRM) is used to handle the constraints. Moreover, for the purpose of diversity preservation, a new and fast clustering method, called stochastic clustering method (SCM), is also introduced for mixture-based modelling. The experimental results 作者: 業(yè)余愛好者 時(shí)間: 2025-3-30 17:48
https://doi.org/10.1007/978-3-663-13434-3of the users to these points. A new evolutionary approach that has been very effective for solving optimisation problems is Path Relinking, an extension of Scatter Search that links solutions over neighborhood spaces. Path Relinking gives a framework for combining solutions that goes beyond the cros作者: flavonoids 時(shí)間: 2025-3-30 21:16
https://doi.org/10.1007/978-3-322-89332-1The number of needed sheets, and therefore the waste, is to be minimized. The cutting facility requires three-staged guillotineable cutting patterns, and in addition, a plan for loading produced elements on transportation wagons. The availability of only three loading docks for wagons imposes additi作者: 走調(diào) 時(shí)間: 2025-3-31 04:15 作者: Visual-Field 時(shí)間: 2025-3-31 06:15
Hans J. Kleinsteuber,Torsten Rossmanne secondary one is to minimise the total distance travelled by all vehicles. This paper describes some experiments with multiple ant colony systems, in particular a Triple Ant Colony System TACS, in which one colony (VMIN) tries to minimise the number of vehicles, one (DMIN) tries to minimise the to作者: ERUPT 時(shí)間: 2025-3-31 12:00
https://doi.org/10.1007/b96499Constraint Satisfaction; Scheduling; algorithms; ant colony optimization; combinatorial optimization; evo作者: 發(fā)酵劑 時(shí)間: 2025-3-31 17:01
https://doi.org/10.1007/978-94-017-1491-4vel algorithm design features are proposed and the comprehensive computational study performed, shows both the contribution of using these features as well as the overall quality of the approach as compared to state of the art competing metaheuristics.作者: myelography 時(shí)間: 2025-3-31 19:29
https://doi.org/10.1057/9781137292896blem (VRP), namely the Rank based Ant System, the Max-Min Ant System and the Ant Colony System. Based on the results of this comparison we then implement a parallelization strategy to increase computational efficiency and study the effects of increasing the number of processors.作者: PACT 時(shí)間: 2025-3-31 23:03 作者: 惰性女人 時(shí)間: 2025-4-1 04:50
AntPacking – An Ant Colony Optimization Approach for the One-Dimensional Bin Packing Problemvel algorithm design features are proposed and the comprehensive computational study performed, shows both the contribution of using these features as well as the overall quality of the approach as compared to state of the art competing metaheuristics.作者: figurine 時(shí)間: 2025-4-1 09:48
Parallel Ant Systems for the Capacitated Vehicle Routing Problemblem (VRP), namely the Rank based Ant System, the Max-Min Ant System and the Ant Colony System. Based on the results of this comparison we then implement a parallelization strategy to increase computational efficiency and study the effects of increasing the number of processors.作者: 使苦惱 時(shí)間: 2025-4-1 13:30
Binary Merge Model Representation of the Graph Colouring Problemlem. Its strength lies in reducing the number of neighbors that need to be checked for validity. An empirical comparison is made with two other algorithms on a popular selection of problem instances and on a suite of instances in the phase transition. The new representation in combination with a heuristic mutation operator shows promising results.作者: 驚呼 時(shí)間: 2025-4-1 18:05 作者: ALOFT 時(shí)間: 2025-4-1 20:44 作者: LUCY 時(shí)間: 2025-4-2 02:10 作者: Ingest 時(shí)間: 2025-4-2 04:58 作者: hegemony 時(shí)間: 2025-4-2 10:30
