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

A constraint relaxation-based intelligence algorithm for workshop layouts with automated guided vehicle systems

JOURNAL OF MANAGEMENT SCIENCE AND ENGINEERING 2025年第2期10卷 225-244页

作者： Liu, Ran Wang, Chengkai Shanghai Jiao Tong Univ Dept Ind Engn & Management Shanghai 200240 Peoples R China

With the widespread adoption of automated guided vehicle (AGV) systems for material handling in manufacturing plants, it has become practical and crucial to delve into the layout problem associated with AGV systems. In this work, we focus on a unique layout problem encountered in a hybrid workshop where AGV systems are employed for transporting semiproducts along the manufacturing line. Several distinctive features in this system contribute to the challenge of the problem. Notably, manufacturing occurs in an uncertain environment, and certain manufacturing cells may produce semiproducts that do not meet quality standards, necessitating repair. Additionally, each AGV requires recharging in a designated area within the workshop. Given that the proposed layout problem is NP-hard, we present an intelligence variable neighborhood search heuristic integrated with a constraint relaxation strategy to address its complexity. The numerical results demonstrate the algorithm's ability to generate high-quality solutions within a reasonable timeframe, even for large-scale test instances. The layout solutions obtained through our algorithm outperform those produced by the CPLEX solver and the practical layouts devised by the company. This highlights the efficacy of our approach in tackling the unique challenges posed by the layout problem in a hybrid workshop with an AGV system. (c) 2025 China Science Publishing & Media Ltd. Publishing Services by Elsevier B.V. on behalf of KeAi Communications Co. Ltd. This is an open access article under the CC BY-NC-ND license (http://***/licenses/by-nc-nd/4.0/).

关键词： Facility layout Automated guided vehicle intelligence algorithm Constraint relaxation

来源：评论

学校读者我要写书评

暂无评论

intelligence algorithm for optimization design of the low wind speed airfoil for wind turbine

引用

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

作者： Pang, Xiaoping Wang, Haoyu Chen, Jin Chongqing Univ State Key Lab Mech Transmiss Chongqing Peoples R China Nucl Power Inst China Sci & Technol Reactor Syst Design Technol Lab Chengdu Sichuan Peoples R China

In order to develop wind resources in low wind speed (LWS) area, a new intelligence algorithm based on the airfoil profile expressed by B-spline for LWS airfoil is proposed. Considering the design requirements for LWS wind turbine airfoil design and taking the DU airfoil as original design coefficients, the new LWS airfoil families with the thickness of 18, 21, 25, 30, 35, 40% were obtained by the particle swarm optimization based on the improved inertia factor and mode. The results show that, compared with the original DU airfoils, all the LWS airfoil families have better aerodynamic performance under free and fixed transition. Performance of the 18% thickness airfoil is improved most significantly: Under fixed transition condition, the maximum lift coefficient increases by 13.53%, and the maximum lift to drag ratio increases by 10.77%;under the free transition condition, the maximum lift coefficient increases by 18.84%, and the maximum lift to drag ratio increases by 11.92%. The aerodynamic performance of a new airfoil named CQUL-180, taken as an example, was analyzed and validated by the computational fluid dynamics compared with DU96-W-180 airfoil, which verifies the reliability of the intelligence algorithm.

关键词： Low wind speed airfoil intelligence algorithm Particle swarm optimization Aerodynamic performance

来源：评论

学校读者我要写书评

暂无评论

Simulation for Path Planning of OUC-II Glider with intelligence algorithm 10th

Simulation for Path Planning of OUC-II Glider with Intellige...

引用

10th International Conference on Intelligent Robotics and Applications (ICIRA

作者： Liu, Yuhai Luan, Xin Song, Dalei Su, Zhiqiang Ocean Univ China Coll Informat Sci & Engn 238 Songling Rd Qingdao Shandong Peoples R China Ocean Univ China Coll Engn 238 Songling Rd Qingdao Shandong Peoples R China

ISBN: (纸本)9783319652894;9783319652887

Addressing the need for exploration of benthic zones utilising autonomous underwater gliders, this paper presents a simulation for an optimised path planning from the source node to the destination node of the autonomous underwater glider OUC-II Glider in near-bottom ocean environment. Near-bottom ocean current data from the College of Oceanic and Atmospheric Science, Ocean University of China have been used for this simulation. A cost function is formulated to describe the dynamics of the autonomous underwater glider in near-bottom ocean currents. This cost function is then optimised using various biologically-inspired algorithms such as genetic algorithm, Ant Colony optimisation algorithm and particle swarm optimisation algorithm. The simulation of path planning is also performed using Q-learning technique and the results are compared with the biologically-inspired algorithms. The results clearly show that the Q-learning algorithm is better in computational complexity than the biologically-inspired algorithms. The ease of simulating the environment is also more in the case of Q-learning techniques. Hence this paper presents an effective path planning technique, which has been tested for the OUC-II glider and it may be extended for use in any standard autonomous underwater glider.

关键词： OUC-II glider Path planning Simulation intelligence algorithm

来源：评论

学校读者我要写书评

暂无评论

Multi-task snake optimization algorithm for global optimization and planar kinematic arm control problem

引用

PEERJ COMPUTER SCIENCE 2025年 11卷 e2688-e2688页

作者： Li, Qingrui Zhou, Yongquan Luo, Qifang Guangxi Minzu Univ Coll Artificial Intelligence Nanning Guangxi Peoples R China Guangxi Key Labs Hybrid Computat & IC Design Anal Nanning Guangxi Peoples R China

Multi-task optimization (MTO) algorithms aim to simultaneously solve multiple optimization tasks. Addressing issues such as limited optimization precision and high computational costs in existing MTO algorithms, this article proposes a multi-task snake optimization (MTSO) algorithm. The MTSO algorithm operates in two phases: first, independently handling each optimization problem;second, transferring knowledge. Knowledge transfer is determined by the probability of knowledge transfer and the selection probability of elite individuals. Based on this decision, the algorithm either transfers elite knowledge from other tasks or updates the current task through self-perturbation. Experimental results indicate that, compared to other advanced MTO algorithms, the proposed algorithm achieves the most accurate solutions on multitask benchmark functions, the five-task and 10-task planar kinematic arm control problems, the multitask robot gripper problem, and the multitask car side-impact design problem.

关键词： Multi-task optimization Snake optimization Multitask snake optimization algorithm Planar kinematic arm control problem intelligence algorithm

来源：评论

学校读者我要写书评

暂无评论

A new intelligent algorithm for solving generalized Nash equilibrium problem

引用

ALEXANDRIA ENGINEERING JOURNAL 2025年 123卷 17-28页

作者： Wang, Kai Jia, Wensheng Guizhou Univ Sch Math & Stat Guiyang 550025 Guizhou Peoples R China Guizhou Prov Key Lab Games Decis Making & Control Guiyang 550025 Guizhou Peoples R China

In this paper, the chaotic whale slime mould algorithm (CWSMA) is designed to solve the generalized Nash equilibrium problem (GNEP). First, the GNEP is converted into a non-linear equation system problem using the Karush-Kuhn-Tucker (KKT) condition and the "min" function. Compared to the classical approach, the transformation process does not require the functions to be quadratically differentiable and strongly convex. The CWSMA is proposed by introducing tent mapping, levy flight strategy and the idea of whale optimization algorithm into the slime mould algorithm (SMA), which has the advantages of higher population diversity, faster convergence, less chance of falling into local optimums, and does not depend on the choice of initial points. Furthermore, the convergence analysis of the CWSMA is given by using Markov processes. Finally, several numerical simulation experiments show that the CWSMA is superior to the SMA, the coevolutionary immune quantum particle swarm optimization algorithm, the projection algorithm and the descent algorithm under certain conditions. The CWSMA not only solves the GNEP effectively, but also has better population diversity, global convergence, and off-line performance.

关键词： Generalized Nash equilibrium Non-linear equation system problem intelligence algorithm Markov process

来源：评论

学校读者我要写书评

暂无评论

A clustering scheduling strategy for space debris tracking

引用

AEROSPACE SCIENCE AND TECHNOLOGY 2025年 157卷

作者： Yao, Jiali Xu, Bo Li, Xin Yang, Shihai Sun Yat Sen Univ Sch Aeronaut & Astronaut Shenzhen Peoples R China

The number of spacecraft and space debris, particularly in low Earth orbit, is rapidly escalating, heightening the demand for rational and effective satellite allocation strategies to alleviate the strain on satellite monitoring and tracking systems. In this paper, a clustering scheduling strategy is proposed for satellites equipped with sensors tasked with monitoring a substantial amount of space debris. To address the challenge of excessive space debris, a dynamic and static clustering division scheme is introduced, leveraging target characteristics in conjunction with the nearest neighbor clustering algorithm. Furthermore, to enhance scheduling efficiency, four performance indicators are proposed to guide the generation of a resource allocation scheme using Genetic algorithm and Simulated Annealing. Simulation results demonstrate that the clustering scheduling strategy effectively clusters a large number of space debris, while the scheduling scheme demonstrates better balance, comprehensiveness, and efficiency. The Genetic algorithm and Simulated Annealing exhibit superior performance compared to their counterparts across various orbital inclinations and altitudes. Notably, in a specific simulation scenario related to constellations, the Genetic algorithm and Simulated Annealing achieve a performance enhancement of 13.48% compared to the Genetic algorithm and an improvement of 8.73% compared to Simulated Annealing.

关键词： intelligence algorithm Multiple satellites scheduling Scheduling strategy Space debris observation Target clustering

来源：评论

学校读者我要写书评

暂无评论

An improved radioactive tracer response analysis and injection profile quantification method based on intelligent algorithms

引用

JOURNAL OF RADIOANALYTICAL AND NUCLEAR CHEMISTRY 2024年第3期333卷 1039-1053页

作者： Yang, Guofeng Peng, Wenzheng Liu, Dongming Wu, Xiaolong Chen, Meng Liu, Xiangjun Southwest Petr Univ Sch Geosci & Technol Chengdu 610500 Sichuan Peoples R China Southwest Petr Univ State Key Lab Oil & Gas Reservoir Geol & Exploitat Chengdu 610500 Sichuan Peoples R China China Natl Logging Corp Xian 710200 Sichuan Peoples R China China Oilfield Serv Ltd Langfang 065201 Hebei Peoples R China

An improved radioactive tracer response analysis and interpretation method is proposed. The characteristics of the tracer peaks under different measurement conditions are studied using numerical simulation. An optimization method is designed to solve the tracer's transit time passing a certain distance based on ant colony optimization and Nelder-Mead algorithm. The interpretation model is established to calculate the flow velocities using the time-depth relationship. The application example showed that the proposed method could clearly analyze the downhole flow situations and quantify the injection profile.

关键词： Radioactive tracer logging Injection profile Response analysis intelligence algorithm

来源：评论

学校读者我要写书评

暂无评论

Hierarchical optimization of current-limiting devices with discrete parameters in multi-terminal DC power grids

引用

IET GENERATION TRANSMISSION & DISTRIBUTION 2023年第1期17卷 219-229页

作者： Mei, Jun Chen, Xiaoyu Zhang, Bingtian Zhang, Sen Lei, Liupeng Guo, Jiawei Southeast Univ Sch Elect Engn Nanjing Peoples R China Shanghai Urban Power Supply Co Shanghai Peoples R China Southeast Univ Sch Elect Engn Nanjing 210096 Peoples R China

Optimizing current-limiting devices (CLDs) in multi-terminal DC grids is essential to limit the fault current while reducing the cost of devices. However, current studies mainly focus on optimizing CLDs based on continuous parameters in simple DC grids, which cannot meet the optimal efficiency demand of CLDs in complex multi-terminal DC grids and results in each CLD needing to be customized separately, increasing the production cost of devices. Therefore, to improve the optimal efficiency under complex multi-terminal DC grids, the principle of fault area division based on the coupled degree of converter and DC grid and the corresponding hierarchical optimal implementation schemes of CLDs are proposed first. Then, the effects of CLD parameters on the fault current are analysed, and their sensitive ranges of current-limiting are revealed. In combination with the error range of inductance, the principle of discrete parameter design of current-limiting inductance parameters is put forward. Next, the discrete parameters of CLDs are optimized by an intelligence algorithm. Finally, the hierarchical optimal method of CLDs based on discrete parameters is validated on a six-terminal DC grid in PSCAD/EMTDC. The proposed method can satisfy the demand of current-limiting, which is more in line with the standardization requirements in practice.

关键词： multiterminal DC power grids Optimisation techniques fault currents intelligence algorithm optimisation current-limiting devices Protection apparatus CLD hierarchical optimization power grids PSCAD-EMTDC

来源：评论

学校读者我要写书评

暂无评论

intelligence algorithm Research of Convection Diffusion Equation and Numerical Simulation

Intelligence Algorithm Research of Convection Diffusion Equa...

引用

2014 International Conference on Artificial,intelligence and Software Engineering(AISE 2014)

作者： Ya-mian PENG Ling WANG College of Science Hebei United University

When we study heat conduction process, expansion of gas process and electromagnetic field questions and so on dissemination, we frequently meets the convection proliferation partial differential equation, the numerical solution research of convection diffusion equation is essential. This paper discusses the convection- diffusion equation is the problem with the method for solving inverse problems. This article first discusses the convection- diffusion equation is the finite difference method, using five-point difference scheme for solving them. Then a two-dimensional convection- diffusion equations in the numerical simulation of initial boundary value problem, get a good result. Finally, we study the convection- diffusion equation Inverse Problems of Numerical Solution. Above all, it will be conducted for Laplace transform method for approximate analytical solution of semi-infinitive sand column during dispersive test under the condition of one dimensional steady flow and injection of tracer with constant concentration of order one;the normal distribute function method and the inverse function method of inverse parameter control problem also be introduced. Compare with them, the minimum squared method can drawn the effect of calculation's accuracy about people's action. During the course, it can be worked by computer, and calculation is simple. The high accuracy is its best aspect.

关键词： intelligence algorithm GA Environmental hydraulics Inverse problem

来源：评论

学校读者我要写书评

暂无评论

SARE: an optimized method for detection functional regulatory elements in genome

引用

EGYPTIAN JOURNAL OF MEDICAL HUMAN GENETICS 2025年第1期26卷 1-10页

作者： Hosseinpoor, Mohammadjavad Islamic Azad Univ Dept Comp Engn Estahban Branch Estahban Iran Islamic Azad Univ Estahban Branch Young Researchers & Elite Club Estahban Iran

BackgroundMetaheuristic algorithms have been widely employed to solve optimization problems, but their application in analyzing health-related data remains limited. This is primarily due to the complexity of health data, particularly genomic and epigenetic datasets. In genomics, a critical challenge is identifying genomic factors that collaboratively influence disease-associated genes. Enhancer-promoter interactions play a key role in gene regulation, and accurately predicting these elements is essential for developing tailored therapeutic strategies. Despite advances in computational tools, limitations such as fixed-fragment approaches and computational inefficiency hinder the detection of biologically relevant *** and methodsHis study introduces the simulation annealing regulatory element (SARE) method, a novel approach based on the simulated annealing algorithm, to identify enhancer-promoter-like interactions from Hi-C (chromosome conformation capture) datasets. The SARE method addresses the limitations of traditional fixed-fragment approaches by detecting variable-length regulatory elements. The Hi-C dataset utilized in this research was derived from mouse embryonic stem cells (ESCs) and processed using advanced filtering techniques to retain valid interactions. A sensitivity analysis was performed to optimize critical parameters, such as the cooling schedule and initial configurations, ensuring robust performance across *** proposed method was benchmarked against traditional techniques, including HiCUP and HiC-Pro, using statistical metrics such as precision (0.85), recall (0.78), and F1-score (0.81). SARE demonstrated superior performance, identifying a significantly higher number of interactions with increased biological relevance. Approximately 70% of the detected interactions overlapped with known enhancer-promoter pairs, while the remaining 30% potentially represent novel regulatory mechanisms. Computational efficiency an

关键词： Regulatory elements Chromatin organization Genomic analysis intelligence algorithm Traditional methods (HiCUP and HiC-pro) Simulation annealing regulatory element (SARE)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：