標(biāo)題: Titlebook: Ant Algorithms; Third International Marco Dorigo,Gianni Caro,Michael Sampels Conference proceedings 20021st edition Springer-Verlag Berlin [打印本頁(yè)] 作者: 債權(quán)人 時(shí)間: 2025-3-21 18:55
書目名稱Ant Algorithms影響因子(影響力)
書目名稱Ant Algorithms影響因子(影響力)學(xué)科排名
書目名稱Ant Algorithms網(wǎng)絡(luò)公開度
書目名稱Ant Algorithms網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Ant Algorithms被引頻次
書目名稱Ant Algorithms被引頻次學(xué)科排名
書目名稱Ant Algorithms年度引用
書目名稱Ant Algorithms年度引用學(xué)科排名
書目名稱Ant Algorithms讀者反饋
書目名稱Ant Algorithms讀者反饋學(xué)科排名
作者: 現(xiàn)暈光 時(shí)間: 2025-3-21 20:51
Eine Verfassung für die Europ?ische Unionnd anti-pheromone. Three variations of Ant Colony System that apply the anti-pheromone concept in different ways are described and tested against benchmark travelling salesman problems. The results indicate that the use of anti-pheromone can lead to improved performance. However, if anti-pheromone i作者: Serenity 時(shí)間: 2025-3-22 04:23
An Experimental Study of a Simple Ant Colony System for the Vehicle Routing Problem with Time Windowe performed to compare the proposed model to other metaheuristic techniques. The results show that the single colony ACS algorithm, despite its simple model, is quite competitive to other well know metaheuristic techniques.作者: Consequence 時(shí)間: 2025-3-22 05:19
Anti-pheromone as a Tool for Better Exploration of Search Spacend anti-pheromone. Three variations of Ant Colony System that apply the anti-pheromone concept in different ways are described and tested against benchmark travelling salesman problems. The results indicate that the use of anti-pheromone can lead to improved performance. However, if anti-pheromone i作者: Blemish 時(shí)間: 2025-3-22 10:56 作者: 切掉 時(shí)間: 2025-3-22 13:44
https://doi.org/10.1007/978-3-662-33052-4with different features, obtaining good results. Afterwards, an adaptation of the previous implementation is used to solve a real case problem found in a bike assembly line with a hierarchical multi-objective function and additional constraints between tasks.作者: Analogy 時(shí)間: 2025-3-22 18:22 作者: Excitotoxin 時(shí)間: 2025-3-22 23:25 作者: 龍蝦 時(shí)間: 2025-3-23 01:56
Ant Algorithms for Assembly Line Balancingwith different features, obtaining good results. Afterwards, an adaptation of the previous implementation is used to solve a real case problem found in a bike assembly line with a hierarchical multi-objective function and additional constraints between tasks.作者: Jargon 時(shí)間: 2025-3-23 07:43 作者: orient 時(shí)間: 2025-3-23 13:04
Self-Organized Networks of Galleries in the Ant ,environment resulting from their activity: the removal of sand pellets and a pheromone trail-laying behaviour. We show that the growth of the networks results from a self-organized process that also allows the collective adaptation of the size and shape of the network to the size of the colony.作者: Hemodialysis 時(shí)間: 2025-3-23 14:24 作者: macrophage 時(shí)間: 2025-3-23 20:22
Eine Vorlesung über Differentialgeometrie including their e.ciency and robustness in situations where they are failing, they are moved without realizing this, and markers are deleted. Finally, we report the results of a large-scale experiment where ten ant robots covered an area of 25 by 25 meters repeatedly over 85 hours.作者: Decimate 時(shí)間: 2025-3-23 22:36
Modelling ACO: Composed Permutation Problemstive function is the sum of the qualities of the solutions of the subproblems. We propose two methods for handling scaling problems (pheromone update masking and rescaling of the objective function) that can improve ACOs behaviour. Consequences of our findings for using ACO on real-world problems are pointed out.作者: alcoholism 時(shí)間: 2025-3-24 02:20 作者: Alveoli 時(shí)間: 2025-3-24 07:08 作者: HACK 時(shí)間: 2025-3-24 11:45 作者: Thyroxine 時(shí)間: 2025-3-24 15:14 作者: TEM 時(shí)間: 2025-3-24 20:28
Einige Gründe der Staatenlosigkeit extended ant framework improving the e.ectiveness of ant-based systems to such problems. Computational results are presented both on standard set partitioning problem instances and on vertical fragmentation problem instances. This last is a real world problem arising in data warehouse logical design.作者: 無意 時(shí)間: 2025-3-25 01:21
An Ant Colony Optimization Algorithm for the 2D HP Protein Folding Problemirst application of ACO to this highly relevant problem from bioinformatics; yet, the performance of our ACO algorithm closely approaches that of specialised, state-of-the methods for 2D HP protein folding.作者: DENT 時(shí)間: 2025-3-25 06:18
Applying Population Based ACO to Dynamic Optimization Problemssolution for the new problem instance. This is tested experimentally for a dynamic TSP and dynamic QAP problem. Moreover the behavior of different strategies for updating the population of solutions are compared.作者: 脫離 時(shí)間: 2025-3-25 10:04 作者: LATE 時(shí)間: 2025-3-25 13:56 作者: 懲罰 時(shí)間: 2025-3-25 16:33 作者: 牛馬之尿 時(shí)間: 2025-3-25 22:23
Conference proceedings 20021st edition The papers deal with theoretical and foundational aspects and a variety of new variants of ant algorithms as well as with a broad variety of optimization applications in networking and operations research. All in all, this book presents the state of the art in research and development in the emerging field of ant algorithms作者: uveitis 時(shí)間: 2025-3-26 01:42 作者: 可商量 時(shí)間: 2025-3-26 05:38 作者: 泥土謙卑 時(shí)間: 2025-3-26 08:51
Eine Theorie biologischer Theorienl of division of labour in social insects, are in charge of the machines. Our work is based on previously introduced models described by Cicirello .. [.] and by Campos .. [.]. Improvements and their effect on the results are highlighted.作者: 類人猿 時(shí)間: 2025-3-26 15:13 作者: 可觸知 時(shí)間: 2025-3-26 18:39
,Innere Fl?chentheorie: Lokale Theorie,imal control, and on the other hand the . metaphor suggested by .. In this context, a critical analysis is given of notions such as state, representation, and sequential decision process under incomplete information.作者: expansive 時(shí)間: 2025-3-26 22:08 作者: CLOUT 時(shí)間: 2025-3-27 02:10
ACO Applied to Group Shop Scheduling: A Case Study on Intensification and Diversificationfective intensification and diversification mechanisms are needed to achieve good results. Our main result shows that a basic . Ant System - and potentially any other Ant Colony Optimization algorithm - can be improved by keeping a number of elite solutions found during the search, and using them to guide the search process.作者: Cultivate 時(shí)間: 2025-3-27 05:18 作者: stress-response 時(shí)間: 2025-3-27 13:06 作者: 充滿裝飾 時(shí)間: 2025-3-27 16:21 作者: Panther 時(shí)間: 2025-3-27 20:18
0302-9743 as well as with a broad variety of optimization applications in networking and operations research. All in all, this book presents the state of the art in research and development in the emerging field of ant algorithms978-3-540-44146-5978-3-540-45724-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: nugatory 時(shí)間: 2025-3-28 01:57
Ant Algorithms978-3-540-45724-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Ordeal 時(shí)間: 2025-3-28 05:38
Eine Verfassung für die Europ?ische Unionchange. To handle this dynamism several ways of adapting the pheromone matrix both locally and globally are considered. We show that the strategy of smoothing pheromone values only in the area containing a change leads to improved results.作者: 老巫婆 時(shí)間: 2025-3-28 09:19
https://doi.org/10.1007/978-3-663-09857-7core of the algorithm we use an Insertion procedure to construct solutions. We provide results on the learning and runtime behavior of the algorithm as well as a comparison with a custom made heuristic for the problem.作者: 食物 時(shí)間: 2025-3-28 12:48
Staatsangeh?rigkeit und Staatsbürgerschafttrail communication, therefore these algorithms are considered as a form of adaptive memory programming. A new formalization is proposed for the design of ant colony algorithms, introducing the biological notions of heterarchy and communication channels.作者: 他日關(guān)稅重重 時(shí)間: 2025-3-28 18:38 作者: correspondent 時(shí)間: 2025-3-28 22:31
Eine Theorie biologischer Theorienfication of the search process. Group Shop Scheduling is a general Shop Scheduling problem covering Job Shop Scheduling and Open Shop Scheduling. In general, in Shop Scheduling problems good solutions are scattered all over the search space. It is widely recognized that for such kind of problems, ef作者: 品嘗你的人 時(shí)間: 2025-3-29 02:55
Eine Theorie biologischer Theorien in stochastic environments. The problems consist of a certain number of machines and different kinds of tasks. The machines are identical and able to carry out each task. A setup, which is linked to a fixed cost, is required to switch from one task to another. Agents, which are inspired by the mode作者: Glower 時(shí)間: 2025-3-29 06:20
Hermann Witte,Hans-Jürgen Maue,Fritz Voigt on a widely studied abstraction of this problem, the two dimensional hydrophobic-polar (2D HP) protein folding problem. We introduce an ant colony optimisation algorithm for this NP-hard combinatorial problem and demonstrate its ability to solve standard benchmark instances. Furthermore, we empiric作者: 名次后綴 時(shí)間: 2025-3-29 07:34
Hermann Witte,Hans-Jürgen Maue,Fritz Voigtbuted requests, subject to capacity and time constraints. This problem is encountered in a variety of industrial and service applications, ranging from logistics and transportation systems, to material handling systems in manufacturing. Due to the intrinsic complexity of the problem, heuristics are 作者: hurricane 時(shí)間: 2025-3-29 11:54
https://doi.org/10.1007/978-3-662-33052-4 a product in a line given a fixed cycle time, equivalent to a fixed production rate. The problem is solved using an ACO metaheuristic implementation with different features, obtaining good results. Afterwards, an adaptation of the previous implementation is used to solve a real case problem found i作者: invulnerable 時(shí)間: 2025-3-29 19:29 作者: Ccu106 時(shí)間: 2025-3-29 23:38 作者: Cirrhosis 時(shí)間: 2025-3-30 03:09 作者: 立即 時(shí)間: 2025-3-30 06:17 作者: Chromatic 時(shí)間: 2025-3-30 10:09 作者: 削減 時(shí)間: 2025-3-30 14:05
https://doi.org/10.1007/978-3-663-09857-7core of the algorithm we use an Insertion procedure to construct solutions. We provide results on the learning and runtime behavior of the algorithm as well as a comparison with a custom made heuristic for the problem.作者: 吃掉 時(shí)間: 2025-3-30 18:20
https://doi.org/10.1007/978-3-662-25944-3erically exact results are derived using a deterministic model for ACO that is based on the average expected behaviour of the artificial ants. These computations are supplemented by test runs with an ACO algorithm on the same problem instances. It is shown that different scaling of the objective fun作者: 閃光東本 時(shí)間: 2025-3-30 22:42 作者: 財(cái)主 時(shí)間: 2025-3-31 01:31 作者: 優(yōu)雅 時(shí)間: 2025-3-31 05:14
,Innere Fl?chentheorie: Lokale Theorie,the use of an iterated Monte Carlo approach for the multi-stage solution of combinatorial optimization problems. . searches for the optimal policy of a multi-stage decision problem to which the original combinatorial problem is reduced. In order to describe . we adopt on the one hand concepts of opt作者: terazosin 時(shí)間: 2025-3-31 10:14
Eine Vorlesung über Differentialgeometrieetically for gross ant robot simpli.cations in unrealistic settings. In this article, we design ant robots for a realistic robot simulation environment. We discuss how large the markers should be that form the trail, how frequently they should be dropped, how large the sensed floor area below the an作者: tendinitis 時(shí)間: 2025-3-31 16:45 作者: Tdd526 時(shí)間: 2025-3-31 21:16 作者: FUSE 時(shí)間: 2025-3-31 22:20
Marco Dorigo,Gianni Caro,Michael SampelsIncludes supplementary material: 作者: 厭倦嗎你 時(shí)間: 2025-4-1 05:18 作者: 兇兆 時(shí)間: 2025-4-1 07:05 作者: Feature 時(shí)間: 2025-4-1 10:58 作者: 灌溉 時(shí)間: 2025-4-1 18:04 作者: falsehood 時(shí)間: 2025-4-1 20:00
https://doi.org/10.1007/3-540-45724-0Ant Algorithms; Ant Colonies; Ant Programming; Ant algorithm; Autonomous Agent; Distributed Control; Evolu作者: 濕潤(rùn) 時(shí)間: 2025-4-1 23:26 作者: LAIR 時(shí)間: 2025-4-2 05:05
