检索结果-内蒙古大学图书馆

IFIP International Conference on Network and Parallel Computing

作者： Zheng, Xiao Luo, Junzhou Song, Aibo Southeast Univ Sch Engn & Comp Sci Nanjing 210096 Peoples R China

ISBN: (纸本)9783540881391

Current researches on service discovery mainly pursue fast response and high recall, but little work focuses on scalability and adaptability of large-scale distributed service registries in SOC. This paper proposes a solution using an agent based distributed service discovery mechanism. Firstly all unstructured P2P based registry system is proposed in which each peer is an autonomous registry center and services are organized and managed according to domain ontology within these registry centers. Secondly, an ant-like multi-agent service discovery method is proposed. Search agents and guide agents cooperate to discover services. Search agents Simulate the behaviors of ants to travel the network and discover services. Guide agents are responsible to manage a service routing table consisting of pheromone and hop count, instructing search agents' routing. Experimental results show that the suggested mechanism is scalable and adaptive in a large-scale dynamic SOC environment.

关键词： multi-agent system P2P network service discovery ant algorithm

来源：评论

学校读者我要写书评

暂无评论

The Multi-criteria Location Problem of the Municipal Plants 18th

The Multi-criteria Location Problem of the Municipal Plants

引用

18th International Scientific Conference on Transport Systems Telematics (TST)

作者： Jacyna-Golda, Ilona Izdebski, Mariusz Lewczuk, Konrad Warsaw Univ Technol Fac Prod Engn Pl Politech 1 PL-00661 Warsaw Poland Warsaw Univ Technol Fac Transport Pl Politech 1 PL-00661 Warsaw Poland

ISBN: (纸本)9783319979557;9783319979540

The article describes the problem of the location of municipal plants in the logistics network carrying out the collection of municipal waste from the inhabitants of a given region. The problem of plant locations has been shown in the aspect of a multi-criteria decision problem. The problem of plant locations may be reviewed from two basic viewpoints. The first one is selecting the place where a new plant is to be erected. The second aspect consists in the selection of plant locations from the already existing facilities, what means reconfiguration of the logistic network. The second aspect is considered in this article. The article presents a mathematical model of the problem of the location of municipal plants, i.e. input data, decision variables and criteria functions have been defined. In order to solve the problem, a multi-criteria method supporting the selection of the location of municipal plants in the logistics network was proposed. The ant algorithm is the optimization algorithm of the presented method.

关键词： Multi-criteria location problems ant algorithm Optimization

来源：评论

学校读者我要写书评

暂无评论

Convergence Results for ant Routing algorithms via Stochastic Approximation and Optimization

Convergence Results for Ant Routing Algorithms via Stochasti...

引用

Proceedings of the 46th IEEE Conference on Decision and Control, Pages 5971-6447

作者： Punyaslok Purkayastha John S. Baras Institute for Systems Research and the Department of Electr. & Comp. Engin University of Maryland College Park College Park MD USA

ISBN: (纸本)9781424414970;1424414970

"ant algorithms" have been proposed to solve a variety of problems arising in optimization and distributed control. They form a subset of the larger class of "Swarm Intelligence" algorithms. The central idea is that a 'swarm' of relatively simple agents can interact through simple mechanisms and collectively solve complex problems. Instances that exemplify the above idea abound in nature. The abilities of ant colonies to collectively accomplish complex tasks have served as sources of inspiration for the design of "ant algorithms". Examples of "ant algorithms" are "ant Routing" algorithms that have been proposed for communication networks. We analyze in this paper an ant-Based Routing algorithm for packet-switched wireline networks. The algorithm is an attractive multiple path probabilistic routing scheme, that is fully adaptive and distributed. Using methods from adaptive algorithms and stochastic approximation, we show that the evolution of the link delay estimates can be closely tracked by a deterministic ODE system. A study of the equilibrium points of the ODE then gives us the equilibrium behavior of the routing algorithm, in particular, the equilibrium routing probabilities, and mean delays in the links under equilibrium. We also show that the fixed-point equations that the equilibrium probabilities satisfy are actually the necessary and sufficient conditions of an appropriate optimization problem. Simulations supporting the analytical results are provided.

关键词： Routing algorithms stochastic approximation ant algorithm Probability Adaptive algorithms algorithms decentralised control networks(communications) Fixed point dike swarms Respiratory Inspiration inspiration

来源：评论

学校读者我要写书评

暂无评论

A New algorithm for Solving Multicriteria Shortest Path Problem

引用

Systems Science and Systems Engineering 1999年第3期9卷 335-339页

作者： MA Liang\ \ WANG Long\|de College of Systems Science and Systems Engineering, University of Shanghai for Science and Technology, Shanghai 200093, P.R.China

In this paper a new algorithm for solving multicriteria shortest path problem is presented. The algorithm is based on the recently developed principles of ant optimization. Computational experiments are reported showi... 详细信息

关键词： multicriteria shortest path ant algorithm

来源：评论

学校读者我要写书评

暂无评论

Research on Intelligent Storage System Based on Computer Big Data Twin Technology 3

Research on Intelligent Storage System Based on Computer Big...

引用

2023 IEEE 3rd International Conference on Data Science and Computer Application, ICDSCA 2023

作者： Yao, Wei Sun, Jie Shandong Institute of Commerce and Technology School of Cold Chain Logistics and Supply Chain Jinan China

ISBN: (纸本)9798350341546

This paper uses ORACLE database, Unity engine, TCP Socket for data transmission. Build a digital twin architecture based on ORACLE. Create a virtual scene, model it and map it to real data. The storage digital twin modeling is established by using data-driven multi-dimensional fusion modeling technology. The mathematical model of space allocation is constructed with the efficiency of delivery, the degree of goods correlation and the stability of shelves as the optimization index. A new intelligent ant (IACO) algorithm is introduced and optimized. Simulation results show that this method can optimize the operating efficiency of the digital twin system. © 2023 IEEE.

关键词： ant algorithm Digital twin intelligent assembly line intelligent storage spatial layout

来源：评论

学校读者我要写书评

暂无评论

Research on ant System with Taboo Rules and Its Applications in Vrpdp Problem

Research on Ant System with Taboo Rules and Its Applications...

引用

2011 International Conference on Advanced Intelligence and Awareness Internet(第二届高等智能和感知网络国际会议 AIAI 2011)

作者： Tongqiang Jiang Binyi Fan School of Computer and Information Engineering Beijing Technology and Business University Beijing 100048 China

ISBN: (纸本)9781622761234

The traditional ant algorithm is a swarm intelligence optimization algorithm which has many good features when solving combinatorial optimization problems such as TSP. But it has the limitations of stagnation and poor convergence, and is easy to fall in local optima, which are the bottlenecks of its wide application. This paper puts the taboo rules into the ant algorithm. The simulation experimentation result shows that the TAS algorithm brought up in this paper has good performance in convergence speed and steadiness. In addition the simulation results shows that this algorithm brought by this paper can get a better solution when solving VRPDP.

关键词： ant algorithm Taboo rules Vehicle routing problem (VRP) VRPDP

来源：评论

学校读者我要写书评

暂无评论

ant Colony System Based PI Maximum Power Point Tracking for Stand Alone Photovoltaic System

Ant Colony System Based PI Maximum Power Point Tracking for ...

引用

IEEE Interantional Conference on Industrial Technology

作者： A. H. Besheer M. Adly Electrical Engineering Department Faculty of Engineering University of Tabuk KSA Information Engineering & Technology German University in Cairo Cairo Egypt

ISBN: (纸本)9781467303408;9781467303422

This paper introduces a social inspired optimization based control method for the maximum power point tracking (MPPT) of a photovoltaic (PV) system. In particular, a well known proportional plus Integral (PI) controller is fine tuned using ant colony system algorithm and tested on a simulated stand alone PV array with battery load. The proposed ant colony based PI-MPPT controller is enhanced by the fractional open circuit voltage technique to rapidly and accurately track the maximum power point (MPP). The design algorithm of this controller is presented together with its simulation results. Satisfactory dynamic and steady state performance of the simulated PV system even under variable irradiance levels reflects the superiority of the proposed control technique over the traditional control methods.

关键词： maximum power point trackers Photovoltaic systems Control Methods Control technology Does stand alone ants steady-state performance photovoltaic array Design algorithm PI control ant algorithm ant colonies Controllers based Batteries

来源：评论

学校读者我要写书评

暂无评论

Nové aplikace mravenčích algoritmů

Nové aplikace mravenčích algoritmů

引用

作者： Korgo, Jakub Brno University of Technology

Mravenčí algoritmy byly použity na rozličné kombinatorické optimalizační úlohy. Jedna z těchto úloh, která však mravenčími algoritmy řešena nebyla, je návrh přechodový... 详细信息

Mravenčí algoritmy byly použity na rozličné kombinatorické optimalizační úlohy. Jedna z těchto úloh, která však mravenčími algoritmy řešena nebyla, je návrh přechodových pravidel pro celulární automaty (CA). Což je i úloha, na kterou se zaměřuje tato diplomová práce. Tato práce začíná úvodem do mravenčích algoritmů a přehledem jejich aplikací, po kterém následuje úvod do CA. V další části autor navrhuje způsob, jak zakódovat pravidla CA do grafu, který je použit v mravenčích algoritmech. Poslední část této práce obsahuje aplikaci tohoto kódování pravidel do algoritmů elitist ant system a MAX-MIN ant system. Ta je následována experimentálními výsledky pokusů těchto algoritmů o vytvoření přechodových pravidel pro úlohy CA.

关键词： Mravenčí algoritmus optimalizace mravenčí kolonií MAX-MIN ant system celulární automat. ant algorithm ant colony optimization MAX-MIN ant system cellular automaton. Text

来源：评论

学校读者我要写书评

暂无评论

Current-reinforced random walks for constructing transport networks

引用

JOURNAL OF THE ROYAL SOCIETY INTERFACE 2013年第80期10卷 20120864-20120864页

作者： Ma, Qi Johansson, Anders Tero, Atsushi Nakagaki, Toshiyuki Sumpter, David J. T. Uppsala Univ Dept Math S-75238 Uppsala Sweden Univ Gavle Dept Math Gavle Sweden JST PRESTO Kawaguchi Saitama Japan Future Univ Hakodate Fac Syst Informat Sci Hakodate Hokkaido Japan

Biological systems that build transport networks, such as trail-laying ants and the slime mould Physarum, can be described in terms of reinforced random walks. In a reinforced random walk, the route taken by 'walking' particles depends on the previous routes of other particles. Here, we present a novel form of random walk in which the flow of particles provides this reinforcement. Starting from an analogy between electrical networks and random walks, we show how to include current reinforcement. We demonstrate that current-reinforcement results in particles converging on the optimal solution of shortest path transport problems, and avoids the self-reinforcing loops seen in standard density-based reinforcement models. We further develop a variant of the model that is biologically realistic, in the sense that the particles can be identified as ants and their measured density corresponds to those observed in maze-solving experiments on Argentine ants. For network formation, we identify the importance of nonlinear current reinforcement in producing networks that optimize both network maintenance and travel times. Other than ant trail formation, these random walks are also closely related to other biological systems, such as blood vessels and neuronal networks, which involve the transport of materials or information. We argue that current reinforcement is likely to be a common mechanism in a range of systems where network construction is observed.

关键词： reinforced random walk shortest path problem transport networks ant algorithm true slime mould optimization

来源：评论

学校读者我要写书评

暂无评论

Aplikace mravenčích algoritmů v úloze zpracování obrazu

Aplikace mravenčích algoritmů v úloze zpracování obraz...

引用

作者： Prášek, Matěj Brno University of Technology

Tato bakalářské práce je zaměřena na detekci hran v obrazu pomocí algoritmu ant Colony Optimization. Zaměřuji se na různé způsoby redukce šumu, hledání izolovaných hran a nale... 详细信息

Tato bakalářské práce je zaměřena na detekci hran v obrazu pomocí algoritmu ant Colony Optimization. Zaměřuji se na různé způsoby redukce šumu, hledání izolovaných hran a nalezení optimálních parametrů pro většinu obrazů.

关键词： mravenčí algoritmus optimalizace mravenčí kolonií detekce hran redukce šumu ant algorithm ant colony optimization edge detection noise reduction Text

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：