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

2nd International Conference on Smart Technologies for Smart Nation, SmartTechCon 2023

作者： Kuppusamy, Mudiarasan Abd Raub, Noor Adila Abdullah, Syed Kadir Sannasai, Appa Row Edwin Prabhakar, P.B. Asha, V. Faculty of Business & Technology University of Cyberjaya Malaysia New Prince Shri Bhavani College Of Engineering And Technology Tamilnadu India Department of Master of Computer Applications New Horizon College of Engineering Bellandur Post Bengaluru560103 India

ISBN: (纸本)9798350305418

With the rise of leisure tourism and the improvement of attention to rural landscape, the rural areas in the suburbs of metropolis absorb urban resources in the process of development, and have the advantage of developing rural tourism. The rural areas have been greatly improved in environmental infrastructure and landscape construction, and the rural areas in the suburbs have gradually become the consumption space of emerging urban residents. This paper improves the basic ant colony algorithm, adds the stage of centralized search scope, real-time updating pheromone, and pheromone rollback mechanism, and uses MATLAB software to customize a comprehensive travel route plan. In order to spend less money and get the most comfortable travel experience, the cost target and experience target are integrated, and a tourism route planning model based on ant colony algorithm is established, and the improved ant colony algorithm is used to solve the planning model. Finally, the model is applied to practical cases, and the optimal travel path that meets the requirements is obtained through calculation and analysis. © 2023 IEEE.

关键词： ant algorithm characteristic local landscape tourism route design

来源：评论

学校读者我要写书评

暂无评论

Rolling Path Planning of Mobile Robot Based on Automatic Diffluence ant algorithm 12

Rolling Path Planning of Mobile Robot Based on Automatic Dif...

引用

12th International Conference on Graphics and Image Processing (ICGIP)

作者： Guo Haitao Qin Jilin ShangYuxin Shandong Inst Commerce & Technol Informat Technol Coll Jinan 250103 Shandong Peoples R China

ISBN: (纸本)9781510642782;9781510642775

This paper proposes a new method of robot path rolling planning based on automatic shunt ant algorithm. When a node is selected by multiple ants, later ants choose other paths to realize automatic shunting, thereby expanding the search range, enhancing the search diversity, and helping to obtain the optimal solution. The overall idea of the algorithm in this paper is to map the target point near the inner boundary of the robot's field of view, and use the new algorithm to plan the local optimal path of the robot, and the robot will move forward according to this local path. The robot repeats the process every time it advances, and reaches the end safely along a globally optimized path. Simulation experiments show that even in a complex unknown static environment, the algorithm in this paper can also be used to plan a global optimization path.

关键词： path planning automatic diffluence ant algorithm rolling planning

来源：评论

学校读者我要写书评

暂无评论

Ensuring Cyber Resilience of Large-Scale Network Infrastructure Using the ant algorithm

引用

AUTOMATIC CONTROL AND COMPUTER SCIENCES 2020年第8期54卷 793-802页

作者： Pavlenko, E. Yu Kudinov, K., V Peter Great St Petersburg Polytech Univ St Petersburg 195251 Russia

Application of the ant algorithm for ensuring the cyber resilience of a distributed system in conditions of various types of cyber attacks is considered. The principle of operation of the ant algorithm is described, a mathematical model of the network infrastructure is developed, and possible types of cyberattacks are determined within the framework of the model. The results of the experimental studies demonstrated the applicability of the ant algorithm for ensuring the cyber resilience of large-scale networks.

关键词： cyber resistance ant algorithm cyber attack mathematical model pheromone

来源：评论

学校读者我要写书评

暂无评论

A Population-Based ant algorithm for the Lock Chamber Arrangement Problem 6

A Population-Based Ant Algorithm for the Lock Chamber Arrang...

引用

IEEE 6th International Conference on Control Science and Systems Engineering (ICCSSE)

作者： Liu, Ruijie Jiang, Zhiming Wang, Can Tao, Xiaoxia Dalian Univ Sci & Technol Sch Digital Technol Dalian Peoples R China

ISBN: (纸本)9781728198460

With the fast development of the inland waterway transport and the increasing of quantity ships, it is obviously exposed the deficiency of inland river ship locks navigation capacity and even though the inland navigation resources are abundant with many rivers in our country, and the contradiction is more and more acute. In order to improve the ship lock navigation capability, to ensure safe, convenient, stable and orderly navigation through the ship locks. This paper used a population-based ant algorithm to solve the lock chamber arrangement optimization problem. The population-based ant algorithm uses the population queue as a strategy to update the pheromone, meantime it established the population-based ant algorithm for the lock chamber arrangement, implemented corresponding algorithm through further design, and tested the validity through the lock chamber arrangement of the Qingyuan Water Conservancy and the Yangtze Gorges. The examples are provided to illustrate the validity and practicality of the population-based ant algorithm for the lock chamber arrangement.

关键词： ship lock navigation capability lock chamber arrangement ant algorithm

来源：评论

学校读者我要写书评

暂无评论

Research on Survey Path Planning Based on mTSP Planning Model and ant algorithm

Research on Survey Path Planning Based on mTSP Planning Mode...

引用

作者： Jia Li Tianci Jiao Yan Wang College of Systems Engineering National University of Defense Technology

TSP is one of the most famous problems in graph theory, and it is often used in the fields of urban infrastructure planning, logistics distribution, and transportation route arrangement. So far, no effective algorithm has been found to deal with this type of *** believe that large-scale examples of this type of problem cannot be solved with an accurate algorithm, and an effective approximate algorithm for this type of problem must be sought. In order to gain a deeper understanding of the m TSP problem, this paper takes the national survey route planning as an actual case,and combines the improved circle algorithm and the ant algorithm to propose a specific solution. Based on the large amount of real data collected, the research route planning of the research team of Beijing M University traversing 30 ethnic minority autonomous prefectures and 120 ethnic minority autonomous counties was used as a calculation case, and various constraints were comprehensively considered to construct a cluster center based on 18 clusters. The TSP planning model with time constraints splits provinces based on clustering results, regenerates the split provinces and neighboring provinces into a new improvement circle for optimization, and finally obtains a survey time of at least 9.5 years, and integrates a specific survey route.

关键词： TSP Planning Cluster Analysis Hamilton Circle ant algorithm Shortest Research Time

来源：评论

学校读者我要写书评

暂无评论

ant algorithm Optimization for Clustering News Online

Ant Algorithm Optimization for Clustering News Online

引用

International Conference of Computer Science and Information Technology

作者： Roni Jhonson Simamora Abba Suganda Girsang Tomi Jenson Universitas Methodist Indonesia Medan Indonesia Bina Nusantara University Jakarta Indonesia

ISBN: (数字)9781728154237

ISBN: (纸本)9781728154244

Humans are basically curious creatures. We always look for all the latest information through books or news. News usually contain tags or categories to make it easier to find similar news. It can be done manually by human or with machine to make it easier. Data mining technique such as clustering and classification can be used to help the categorization process. Clustering is a technique that can be used to grouped news based on their similarity. There is some algorithm that can be used to clustering data. One of it is ant Colony optimization (ACO). ACO is a metaheuristic algorithm that mimics how ants brings food to the colony. ACO also can be used to solve clustering problem. In this paper, we will use the ACO version for clustering to cluster news and find the performance of said method. Then we compare the result with ground truth.

关键词： Clustering News ant Colony Optimization Performance news ant colony optimization Cluster Analysis algorithm optimization ADMINISTRATIVE CONSENT ORDER up-to-date information ground truth ant algorithm Human

来源：评论

学校读者我要写书评

暂无评论

MTSP UAV detection problem based on ant algorithm 17

MTSP UAV detection problem based on ant algorithm

引用

17th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)

作者： Yue Zehua Wuhan Univ Technol Wuhan 430063 Hubei Peoples R China

ISBN: (纸本)9781538674451

To study the problem of UAV detection, a multi-traveler problem (MTSP) model and a two-dimensional in plane point circle coverage model are established. The ant algorithm and the Monk Carlo algorithm are used to solve the model according to the minimum time. First, extract the number of effective cities under the constraints of effective detection range and maneuverability of the drone. Secondly, the minimum time of flight is minimized as the objective function, and the MTSP UAV detection model based on 1936 traversal points is established. Finally, using the ant algorithm to iteratively solve, and smoothing the track by cubic B-spline interpolation to obtain a flight plan that satisfies the constraints. The shortest time to get is 7.28241h

关键词： Drone detection ant algorithm Monte Carlo algorithm

来源：评论

学校读者我要写书评

暂无评论

Road Traffic Path Planning Based on ant algorithm

Road Traffic Path Planning Based on Ant Algorithm

引用

2019计算智能、工程与信息技术世界大会

作者： Wei Jiang Xianglin Wu Xin Cheng Zhongnan University of Economics and Law

In the process of urban traffic path planning,how to design the shortest path is the main goal of traffic network design under the condition of satisfying the normal operation of road *** the minimum travel time of the total route as the goal,under the constraints of the total investment and the minimum flux,a mathematical model is established and solved by the ant algorithm,so as to design the optimal traffic path under the premise of meeting the given requirements,which has good application value in the design of traffic network.

关键词： ant algorithm Program design Path selection

来源：评论

学校读者我要写书评

暂无评论

Adaptive Learning Model Based on ant Colony algorithm

INTERNATIONAL JOURNAL OF EMERGING TECHNOLOGIES IN LEARNING

引用

INTERNATIONAL JOURNAL OF EMERGING TECHNOLOGIES IN LEARNING 2019年第1期14卷 49-57页

作者： Li, Rongxia Chongqing Technol & Business Univ Modern Int Acad Design Art Chongqing 401120 Peoples R China

To better respond to people's demands for multimedia learning, appropriate learning paths should be offered based on their actual learning demands and different knowledge levels. Adaptive online learning model integrates and improves existing learning frameworks to offer a set of knowledge paths that can cater to differ7ent preferences, tastes, and knowledge levels of learners, no need for them to be aware of this. Based on the improved ant colony algorithm, an adaptive learning system model that can satisfy learners' demands is built herein with reference to the foraging approach of ants to traverse the paths, thereby to find the best learning path, while the classification method for some learning objects can determine the search parameters. This innovative approach proposed hereof can help improve learners' academic performance and learning efficiency.

关键词： ant algorithm adaptive learning learning path learning style

来源：评论

学校读者我要写书评

暂无评论

Multiple Start Modifications of ant Colony algorithm for Multiversion Software Design 10th

Multiple Start Modifications of Ant Colony Algorithm for Mul...

引用

10th International Conference on Swarm Intelligence (ICSI)

作者： Saramud, Mikhail, V Kovalevi, Igor, V Losevl, Vasiliy V. Voroshilova, Anna A. Reshetnev Siberian State Univ Sci & Technol Krasnoyarsky Rabochy Av 31 Krasnoyarsk 660037 Russia Siberian Fed Univ 79 Svobodny Ave Krasnoyarsk 660041 Russia

ISBN: (纸本)9783030263683;9783030263690

The paper discusses the use of an optimization algorithm based on the behaviour of the ant colony to solve the problem of forming the composition of a multiversion fault-tolerant software package. A model for constructing a graph for the implementation of the ant algorithm for the selected task is proposed. The modifications of the basic algorithm for both the ascending and the descending design styles of software systems are given. When optimizing for downstream design, cost, reliability, and evaluation of the successful implementation of each version with the specified characteristics are taken into account. When optimizing for up-stream design, reliability and resource intensity indicators are taken into account, as there is a selection from already implemented software modules. A method is proposed for increasing the efficiency of the ant algorithm, which consists in launching a group of "test" ants, choosing the best solution from this group and further calculating on the basis of it. A software system that implements both modifications of the basic ant algorithm for both design styles, as well as the possibility of applying the proposed multiple start technique to both modifications, is considered. The results of calculations obtained using the proposed software tool are considered. The results confirm the applicability of ant algorithms to the problem of forming a multiversion software package, and show the effectiveness of the proposed method.

关键词： ant algorithm Multiversion programming Reliability Optimization Software design Architecture

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：