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

IEEE International Conference on Civil Aviation Safety and Information Technology (ICCASIT)

作者： Juan Li Zi Li Tao Sun Meijuan Jia Haitao Yu Computer Science and Information Technology Daqing Normal University College Daqing China Guilin University of Technology Institute for Tourism Studies Guilin China

ISBN: (纸本)9781728125992

According to the layout characteristics of parking in the parking lot, the problem of converting the path choice of parking is raised to seek the optimal path and generate the optimal parking guiding line. This paper proposed the concept of node busy factor, and a mathematical model of the optimal path with constraints. The state transition rules of basic ant colony algorithm is improved as well as updating rules of pheromone. After that, the taboo strategy is introduced for further optimization. At last, the experimental results and Matlab simulation verify the effectiveness of the algorithm.

关键词： ant-colony algorithm Path optimization Taboo strategy Parking guidance Parking ant algorithm optimal path Network routing State Change

来源：评论

学校读者我要写书评

暂无评论

ant colony-inspired cooperative control of multi- magnetorheological dampers system for coupled vibration mitigation of spatial irregular structures

引用

ENGINEERING STRUCTURES 2025年 334卷

作者： Yang, Yang Xu, Zhao-Dong Huang, Xing-Huai Dong, Yao-Rong Dai, Jun Li, Yuan-Jin Southeast Univ China Pakistan Belt & Rd Joint Lab Smart Disaster Nanjing 210096 Peoples R China Northeastern Univ Sch Resources & Civil Engn Shenyang 110819 Peoples R China Southeast Univ Shenzhen Res Inst Nanjing 211189 Peoples R China Xian Univ Architecture & Technol Sch Civil Engn Xian 710055 Peoples R China

Spatial irregular structures are increasingly common in modern architecture due to their aesthetic appeal and functional diversity. However, their complex seismic response, characterized by coupled translational-torsional vibrations, poses challenges for traditional seismic designs. Magnetorheological (MR) dampers offer a promising semi-active control technology capable of mitigating these vibrations. For the control system with multiple MR dampers, an important issue is how to allocate the control currents of different dampers, so as to ensure the cooperative work of these devices and realize the optimal damping effect. This study proposes an ant colonyinspired cooperative control strategy for the control system with multiple MR dampers, aiming to optimize the allocation of control currents among multiple MR dampers. The proposed approach leverages the adaptive and collaborative features of ant colony behavior to dynamically adjust the control currents in response to structural vibrations and external excitations, ensuring the MR dampers operate in concert. Through numerical analyses and comparisons, the effectiveness of the cooperative control strategy in mitigating coupled translational and torsional responses is demonstrated, showing its potential for enhancing the seismic resilience of spatially irregular structures.

关键词： Spatial irregular structure Translational-torsional vibration Multiple MR dampers Cooperative control ant-colony algorithm

来源：评论

学校读者我要写书评

暂无评论

ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2004年第2期155卷 426-438页

作者： Rajendran, C Ziegler, H Indian Inst Technol Dept Humanities & Social Sci Ind Engn & Mangement Div Madras 600036 Tamil Nadu India Univ Passau Fac Business Adm & Econ Dept Operat Prod & Logist Management D-94032 Passau Germany

The problem of scheduling in permutation flowshops is considered with the objective of minimizing the makespan, followed by the consideration of minimization of total flowtime of jobs. Two ant-colony optimization algorithms are proposed and analyzed for solving the permutation flowshop scheduling problem. The first algorithm extends the ideas of the ant-colony algorithm by Stuetzle [Proceedings of the 6th European Congress on Intelligent Techniques and Soft Computing (EUFIT '98), vol. 3, Verlag Mainz, Aachen, Germany, 1998, p. 1560], called max-min ant system (MMAS), by incorporating the summation rule suggested by Merkle and Middendorf [Proceedings of the EvoWorkshops 2000, Lecture Notes in Computer Science No. 1803, Springer-Verlag, Berlin, 2000, p. 287] and a newly proposed local search technique. The second ant-colony algorithm is newly developed. The proposed ant-colony algorithms have been applied to 90 benchmark problems taken from Taillard [European Journal of Operational Research 64 (1993) 278]. First, a comparison of the solutions yielded by the MMAS and the two ant-colony algorithms developed in this paper, with the heuristic solutions given by Taillard [European Journal of Operational Research 64 (1993) 278] is undertaken with respect to the minimization of makespan. The comparison shows that the two proposed ant-colony algorithms perform better, on an average, than the MMAS. Subsequently, by considering the objective of minimizing the total flowtime of jobs, a comparison of solutions yielded by the proposed ant-colony algorithms with the best heuristic solutions known for the benchmark problems, as published in an extensive study by Liu and Reeves [European Journal of Operational Research 132 (2001) 439], is carried out. The comparison shows that the proposed ant-colony algorithms are clearly superior to the heuristics analyzed by Liu and Reeves. For 83 out of 90 problems considered, better solutions have been found by the two proposed ant-colony algori

关键词： flowshop scheduling makespan total flowtime heuristics ant-colony algorithm

来源：评论

学校读者我要写书评

暂无评论

ant-colony Based Routing algorithm in Wireless Sensor Networks

引用

China Communications 2010年第5期7卷 120-128页

作者： Shen Yulong Xu Qijian Pei Qingqi Feng Hailin Ma Jianfeng School of Computer Science and Technology Xidian University Xi＇an Shaanxi 710071 P. R. China Institute of China Electronic System Engineering Corporation Beijing 100039 P. R. China

In the wireless sensor networks, high efficient data routing for the limited energy resource networks is an important issue. By introducing antcolony algorithm, this paper proposes the wireless sensor network routing algorithm based on LEACH. During the construction of sensor network clusters, to avoid the node premature death because of the energy consumption, only the nodes whose residual energy is higher than the average energy can be chosen as the cluster heads. The method of repeated division is used to divide the clusters in sensor networks so that the numbers of the nodes in each cluster are balanced. The basic thought of ant-colony algorithm is adopted to realize the data routing between the cluster heads and sink nodes, and the maintenance of routing. The analysis and simulation showed that the proposed routing protocol not only can reduce the energy consumption, balance the energy consumption between nodes, but also prolong the network lifetime.

关键词： Wireless Sensor Network routing protocol LEACH ant-colony algorithm

来源：评论

学校读者我要写书评

暂无评论

Cross-Layer Design and ant-colony Optimization Based Routing algorithm for Low Earth Orbit Satellite Networks

引用

China Communications 2013年第10期10卷 37-46页

作者：王厚天张琦忻向军陶滢刘乃金 School of Electronic Engineering Beijing University of Posts and Telecommunications State Key Laboratory of Information Photonics and Optical Communications Beijing University of Posts and Telecommunications China Academy of Space Technology (CAST)

To improve the robustness of the Low Earth Orbit(LEO) satellites networks and realise load balancing, a Cross-layer design and ant-colony optimization based Load-balancing routing algorithm for LEO Satellite Networks(CAL-LSN) is proposed in this paper. In CALLSN, mobile agents are used to gather routing information actively. CAL-LSN can utilise the information of the physical layer to make routing decision during the route construction phase. In order to achieve load balancing, CALLSN makes use of a multi-objective optimization model. Meanwhile, how to take the value of some key parameters is discussed while designing the algorithm so as to improve the reliability. The performance is measured by the packet delivery rate, the end-to-end delay, the link utilization and delay jitter. Simulation results show that CAL-LSN performs well in balancing traffic load and increasing the packet delivery rate. Meanwhile, the end-to-end delay and delay jitter performance can meet the requirement of video transmission.

关键词： ant-colony algorithm cross-layer design LEO satellite networks load balancing Quality of Service

来源：评论

学校读者我要写书评

暂无评论

Two ant-colony algorithms for minimizing total flowtime in permutation flowshops

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2005年第4期48卷 789-797页

作者： Rajendran, C Ziegler, H Univ Passau Fac Business Adm & Econ Chair Prod Operat & Logist Management D-94032 Passau Germany Indian Inst Technol Dept Management Studies Madras 600036 Tamil Nadu India

The problem of scheduling in flowshops with the objective of minimizing total flowtime is studied. For solving the problem two ant-colony algorithms are proposed and analyzed. The first algorithm refers to some extent to ideas by Stuetzle [Stuetzle, T. (1998). An ant approach for the flow shop problem. In: Proceedings of the sixth European Congress on intelligent techniques and soft computing (EUFIT '98) (Vol. 3) (pp. 1560-1564). Aachen: Verlag Mainz] and Merkle and Middendorf [Merkle, D., & Middendorf, M. (2000). An ant algorithm with a new pheromone evaluation rule for total tardiness problems. In: Proceedings of the EvoWorkshops 2000, lecture notes in computer science 1803 (pp. 287-296). Berlin: Springer]. The second algorithm is newly developed. The proposed ant-colony algorithms have been applied to 90 benchmark problems taken from Taillard [Taillard, E. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64, 278-285]. A comparison of the solutions yielded by the ant-colony algorithms with the best heuristic solutions known for the benchmark problems up to now, as published in extensive studies by Liu and Reeves [Liu, J., & Reeves, C.R. (2001)]. Constructive and composite heuristic solutions to the P//Sigma C-i scheduling problem. European Journal of Operational Research, 132, 439-452, and Rajendran and Ziegler [Rajendran, C., & Ziegler, H. (2004). ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. European Journal of Operational Research, 155, 426-438], shows that the presented ant-colony algorithms are better, on an average, than the heuristics analyzed by Liu and Reeves and Rajendran and Ziegler. (c) 2004 Elsevier Ltd. All rights reserved.

关键词： flowshop scheduling total flowtime ant-colony algorithm

来源：评论

学校读者我要写书评

暂无评论

Two ant-colony algorithms for minimizing total flowtime in permutation flowshops

Two ant-colony algorithms for minimizing total flowtime in p...

引用

30th International Conference on Computers and Industrial Engineering

关键词： flowshop scheduling total flowtime ant-colony algorithm

来源：评论

学校读者我要写书评

暂无评论

ant colony optimization for the job rotation scheduling problem

引用

APPLIED MATHEMATICS AND COMPUTATION 2008年第1-2期201卷 149-160页

作者： Seckiner, Serap Ulusam Kurt, Mustafa Gaziantep Univ Fac Engn Dept Ind Engn TR-27310 Gaziantep Turkey Gazi Univ Fac Engn & Architecture Dept Ind Engn TR-06570 Ankara Turkey

This paper seeks to explore the effectiveness of ant colony optimization for solving the job rotation scheduling problem. The problem of scheduling in job rotation is considered with the objective of minimizing the workload of jobs. The performances of the proposed two ant-colony algorithms are evaluated based on integer programming and simulated annealing solutions. Results show that the ant-colony algorithm implementation is able to compete effectively with the best known solution to the problem. (C) 2007 Elsevier Inc. All rights reserved.

关键词： job rotation scheduling workload integer programming ant-colony algorithm

来源：评论

学校读者我要写书评

暂无评论

Modeling Communication Processes in the Human Connectome through Cooperative Learning

引用

IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING 2020年第1期7卷 476-488页

作者： Tipnis, Uttara Amico, Enrico Ventresca, Mario Goni, Joaquin Purdue Univ Sch Ind Engn W Lafayette IN 47906 USA Purdue Univ Purdue Inst Integrat Neurosci W Lafayette IN 47906 USA Purdue Univ Sch Biomed Engn Sch Ind Engn W Lafayette IN 47906 USA Purdue Univ Sch Biomed Engn W Lafayette IN 47906 USA

Communication processes within the human brain at different cognitive states are neither well understood nor completely characterized. We assess communication processes in the human connectome using ant colony-inspired cooperative learning algorithm, starting from a source with no a priori information about the network topology, and cooperatively searching for the target through a pheromone-inspired model. This framework relies on two parameters, namely pheromone perception and edge perception, to define the cognizance and subsequent behaviour of the ants on the network and, overall, the communication processes happening between source and target nodes. Simulations obtained through different configurations allow the identification of path-ensembles that are involved in the communication between node pairs. These path-ensembles may contain different number of paths depending on the perception parameters and the node pair. In order to assess the different communication regimes displayed on the simulations and their associations with functional connectivity, we introduce two network measurements, effective path-length and arrival rate. These communication features are tested as individual as well as combined descriptors of functional connectivity during different tasks. Finally, different communication regimes are found in different specialized functional networks. Overall, this framework may be used as a test-bed for different communication regimes on top of an underlaying topology.

关键词： Brain connectomics graph theory computational neuroscience ant-colony algorithm communication processes

来源：评论

学校读者我要写书评

暂无评论

A load balanced routing algorithm based on congestion prediction for LEO satellite networks

引用

CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS 2019年第4-Sup期22卷 S8025-S8033页

作者： Wang, Houtian Wen, Guoli Liu, Naijin Zhang, Jun Tao, Ying China Acad Space Technol Qian Xuesen Lab Space Technol Beijing 100094 Peoples R China Beijing Univ Posts & Telecommun Sch Elect Engn Beijing 100876 Peoples R China China Acad Space Technol Beijing 100094 Peoples R China

This paper presents a load balancing routing algorithm based on congestion prediction (LBRA-CP) so as to realize an efficient load balancing over the entire Low Earth Orbit satellite networks. A multi-objective optimization model is built, which not only adopts modifying factor to adjust path cost, but also uses congestion prediction to foresee inter-satellite link congestion. Then an ant colony algorithm is utilized to solve this model, resulting in finding an optimal path for every connection request. Meanwhile, in order to improve the reliability of LBRA-CP, the valve of the pheromone evaporation coefficient is discussed in this paper. The performance is measured by the receiver's throughput, the link utilization and the end-to-end delay. Simulation results show that LBRA-CP performs well in balancing traffic load and increases the receiver's throughput. Meanwhile, the end-to-end delay can meet the requirement of video transmission.

关键词： ant-colony algorithm Congestion prediction LEO satellite networks Load balancing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：