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

Coverage path planning for cleaning robot based on improved simulated annealing algorithm and ant colony algorithm

SIGNAL IMAGE AND VIDEO PROCESSING 2024年第4期18卷 3275-3284页

作者： Shi, Kun Wu, Wendi Wu, Zhengtian Jiang, Baoping Karimi, Hamid Reza Suzhou Univ Sci & Technol Sch Elect & Informat Engn Suzhou Peoples R China Politecn Milan Dept Mech Engn Milan Italy

In the field of intelligent buildings, cleaning robots have always been a part of research. This study proposes a traversal algorithm based on the combination of simulated annealing algorithm based on monotonic heating and ant colony algorithm to solve the problem of coverage path planning during operation. Firstly, environmental modelling is conducted. Then, the principles of the two algorithms and their roles in path planning are addressed. The monotonic heating simulated annealing algorithm solves the problem of the traversal order of each part in the area, and it uses the ant colony algorithm to connect them. Simulation results show that the path coverage rate is 100% and the repetition rate is 4.85%. It can completely cover the whole area and has a low repetition rate, which greatly improves the efficiency of the cleaning robot.

关键词： Cleaning robot Coverage path planning improved simulated annealing algorithm Ant colony algorithm

来源：评论

学校读者我要写书评

暂无评论

Adaptive modeling and analysis of distributed photovoltaic absorptive capacity based on improved simulated annealing algorithm

引用

INTERNATIONAL JOURNAL OF LOW-CARBON TECHNOLOGIES 2024年第19期19卷 2032-2039页

作者： Rong, Shimin Wang, Cong Dong, Yawei Shi, Biwei Ma, Huiqing State Grid Shijiazhuang Elect Power Supply Co Hongqi Rd 66 Shijiazhuang 050000 Hebei Peoples R China NARI Technol Co Ltd Chengxin Rd 19 Nanjing 211106 Jiangsu Peoples R China

In order to improve the adaptive modeling and operational stability of distributed photovoltaic absorption capacity, a distributed photovoltaic absorption capacity adaptive modeling method based on improved simulated annealing algorithm is proposed. This method constructs a level source network load storage model for distributed photovoltaic consumption and establishes a control parameter analysis model through consumption scheduling and active/reactive power coordination control methods to analyze the dynamic limit load characteristics of the distribution network. Using an improved simulated annealing algorithm to analyze the constraint characteristics of distributed photovoltaic consumption patterns, in order to achieve adaptive modeling of the absorption capacity of distributed photovoltaic systems based on actual needs and grid transmission limitations. The test results show that this method has good dynamic ultimate bearing capacity and optimization performance, achieving the optimal economic and safety solution for distributed photovoltaic absorption.

关键词： improved simulated annealing algorithm distributed photovoltaic absorptive capacity adaptive modeling power flow dynamic ultimate bearing capacity

来源：评论

学校读者我要写书评

暂无评论

improved simulated annealing algorithm for Vehicle Routing Problem with Multiple Time Windows using Column Generation 39

Improved Simulated Annealing Algorithm for Vehicle Routing P...

引用

39th Chinese Control Conference (CCC)

作者： Tu, Siqi Li, Shurong Liu, Zhe Zeng, Derui Beijing Univ Posts & Telecommun Automat Sch Beijing 100876 Peoples R China

ISBN: (纸本)9789881563903

This paper proposes an improved simulated annealing (ISA) algorithm embedded in column generation to solve the vehicle routing problem with multiple time windows (VRPMTW). Firstly, two mathematical models of the VRPMTW are discussed: mixed integer model and set covering model. Next, the principle of the column generation (CG) algorithm for the set covering model is introduced. In the column generation algorithm, we obtain the optimal solution of VRPMTW by solving the restrict master problem and subproblem. Then, the ISA algorithm which embedded an iterated local search with recursion (ILSR) algorithm is proposed to solve the subproblem. The master problem is solved by cplex. At last, experimental results show that the ISA algorithm can escape the local optimal solution effectively, avoid premature phenomenon and converge quickly.

关键词： vehicle routing problem with multiple time windows column generation improved simulated annealing algorithm iterated local search with recursion

来源：评论

学校读者我要写书评

暂无评论

An improved simulated annealing algorithm based on residual network for permutation flow shop scheduling

引用

COMPLEX & INTELLIGENT SYSTEMS 2021年第3期7卷 1173-1183页

作者： Li, Yang Wang, Cuiyu Gao, Liang Song, Yiguo Li, Xinyu Huazhong Univ Sci & Technol State Key Lab Digital Mfg Equipment & Technol Wuhan Peoples R China Zhejiang Univ State Key Lab CAD&CG Hangzhou Peoples R China

The permutation flow shop scheduling problem (PFSP), which is one of the most important scheduling types, is widespread in the modern industries. With the increase of scheduling scale, the difficulty and computation time of solving the problem will increase exponentially. Adding the knowledge to intelligent algorithms is a good way to solve the complex and difficult scheduling problems in reasonable time. To deal with the complex PFSPs, this paper proposes an improved simulated annealing (SA) algorithm based on residual network (SARes). First, this paper defines the neighborhood of the PFSP and divides its key blocks. Second, the Residual Network (ResNet) is used to extract and train the features of key blocks. And, the trained parameters are stored in the SA algorithm to improve its performance. Afterwards, some key operators, including the initial temperature setting and temperature attenuation function of SA algorithm, are also modified. After every new solution is generated, the parameters trained by the ResNet are used for fast ergodic search until the local optimal solution found in the current neighborhood. Finally, the most famous benchmarks including part of TA benchmark are selected to verify the performance of the proposed SARes algorithm, and the comparisons with the-state-of-art methods are also conducted. The experimental results show that the proposed method has achieved good results by comparing with other algorithms. This paper also conducts experiments on network structure design, algorithm parameter selection, CPU time and other problems, and verifies the advantages of SARes algorithm from the aspects of stability and efficiency.

关键词： Permutation flow shop scheduling improved simulated annealing algorithm Residual networks TA benchmark

来源：评论

学校读者我要写书评

暂无评论

improved simulated annealing algorithm for Vehicle Routing Problem with Multiple Time Windows using Column Generation

Improved Simulated Annealing Algorithm for Vehicle Routing P...

引用

第三十九届中国控制会议

作者： Siqi Tu Shurong Li Zhe Liu Derui Zeng Automation school Beijing University of Posts and Telecommunications

This paper proposes an improved simulated annealing（ISA） algorithm embedded in column generation to solve the vehicle routing problem with multiple time windows（VRPMTW）. Firstly, two mathematical models of the VRPMTW are discussed: mixed integer model and set covering model. Next, the principle of the column generation（CG） algorithm for the set covering model is introduced. In the column generation algorithm, we obtain the optimal solution of VRPMTW by solving the restrict master problem and subproblem. Then, the ISA algorithm which embedded an iterated local search with recursion（ILSR）algorithm is proposed to solve the subproblem. The master problem is solved by cplex. At last, experimental results show that the ISA algorithm can escape the local optimal solution effectively, avoid premature phenomenon and converge quickly.

关键词： vehicle routing problem with multiple time windows column generation improved simulated annealing algorithm iterated local search with recursion

来源：评论

学校读者我要写书评

暂无评论

Parameter identification of Bouc-Wen dynamic model for magnetorheological shimmy damper based on improved simulated annealing algorithm

引用

JOURNAL OF ENGINEERING-JOE 2020年第14期2020卷 970-975页

作者： Tian, Jing Zhang, Jifeng Li, Boxiao Civil Aviat Univ China Coll Aeronaut Engn Tianjin Peoples R China Univ Calgary Fac Sci Calgary AB Canada

Magnetorheological (MR) shimmy damper has a good application prospect in aircraft landing gear shimmy control as a semi-active vibration control device;however, its non-linear and hysteretic characteristics bring difficulties to the control and restrict performance. It is necessary to develop a dynamic model of the damper that can effectively show these characteristics. This study is based on the experimental data of the damping force characteristics of MR shimmy damper with different control currents. Bouc-Wen model, apply to describe non-linear and hysteretic characteristics, was selected to establish the dynamic model of damping force, displacement and velocity. This study proposed an improved simulated annealing (SA) algorithm, which can improve the efficiency of identification, to identify the parameters of the model. Comparing with the original algorithm, the improved SA algorithm has the same solution quality and better performance in computational efficiency. The relationships between the identified parameters and the control current were obtained by curve fitting, and the experimental data with different amplitudes and frequencies are used to verify the result. It is shown that the established model can accurately show the dynamic characteristics of the damper under different excitation.

关键词： curve fitting parameter estimation damping shock absorbers gears magnetorheology aircraft simulated annealing vibration control magnetorheological shimmy damper good application prospect aircraft landing gear shimmy control semiactive vibration control device nonlinear hysteretic characteristics damping force characteristics MR shimmy damper different control currents Bouc-Wen model improved simulated annealing algorithm improved SA algorithm dynamic characteristics parameter identification Bouc-Wen dynamic model

来源：评论

学校读者我要写书评

暂无评论

An improved simulated annealing algorithm for reconstructing 3D large-scale porous media

引用

JOURNAL OF PETROLEUM SCIENCE AND ENGINEERING 2019年 182卷 106343-000页

作者： Song, Shuaibing China Univ Min & Technol State Key Lab Geomech & Deep Underground Engn Xuzhou 221116 Jiangsu Peoples R China China Univ Min & Technol Sch Mech & Civil Engn Xuzhou 221116 Jiangsu Peoples R China

Based on the morphological information obtained from 2D slice images of real porous media, an improved simulated annealing algorithm (SAA) was proposed to reconstruct 3D large-scale porous media, which are intractable to handle for conventional SAA. Three different statistical functions were introduced to characterize the morphological information of real sandstone, including the one-point probability function, the two-point probability function and the lineal-path function. By changing the update method of the two-point probability function and the lineal-path function, i.e., using incremental calculation instead of conventional global calculation, the efficiency of reconstructing 3D large-scale porous media was greatly improved. Besides, in the later stage of reconstruction that the basic structure of porous media had been formed, the pixel selection algorithm was performed to speed up the reconstruction process. To evaluate the accuracy of the improved SAA, the similarity between the 3D reconstructed volume and the reference image of prototype sandstone was examined. The results showed good agreement between the reconstructed model and the references. The efficiency of the improved SAA was verified by comparison with the conventional SAA, the results of which indicated that the improved SAA can significantly shorten the reconstruction time of 3D large-scale porous media.

关键词： 3D reconstruction Porous media improved simulated annealing algorithm Large-scale Incremental calculation Pixel selection algorithm

来源：评论

学校读者我要写书评

暂无评论

An improved simulated annealing algorithm and Area Model for the Fixed-Outline Floorplanning with Hard Modules 3

An Improved Simulated Annealing Algorithm and Area Model for...

引用

3rd International Symposium on Computational and Business Intelligence (ISCBI)

作者： Zou, De-Xuan Hao, Guo-Sheng Pan, Gai Wang, Gai-Ge Jiangsu Normal Univ Sch Elect Engn & Automat Xuzhou Peoples R China Jiangsu Normal Univ Sch Comp Sci & Technol Xuzhou Peoples R China

ISBN: (纸本)9781467385015

Fixed-outline floorplanning is a hot issue in physical design, and it is more complicated than outline-free floorplanning since it considers the chip fixed-outline constraints. In this paper, an improved simulated annealing algorithm (ISA) is proposed to solve fixed-outline floorplanning. In case ISA encounters premature convergence, it randomly generates a new floorplan which is independent of the previous one. This simple operation is very efficient to help ISA to get rid of premature convergence. Moreover, a novel area model is constructed to guide ISA to search towards desirable solutions. In addition, B*-tree representation is a simple but efficient method for floorplanning, and thus it is employed here to perturb a solution in each iteration. In the light of experimental results, the proposed method is able to find feasible solutions rapidly, and it outperforms the other methods for most fixed-outline floorplanning problems.

关键词： Fixed-outline floorplanning improved simulated annealing algorithm area model B*-tree representation

来源：评论

学校读者我要写书评

暂无评论

Design technology for virtual circuit automatic generation in intelligent substations based on substation configuration description

引用

ELECTRIC POWER SYSTEMS RESEARCH 2025年 244卷

作者： Chen, Jiesheng Wang, Feng Xiong, Weibiao Li, Yinhua Chen, Pengyuan Liu, Jianfeng Dongguan Power Supply Bur Guangdong Power Grid Co Ltd Dongguan 523000 Guangdong Peoples R China Guangdong Power Grid Co Ltd Elect Power Dispatching Control Ctr Guangzhou 510315 Guangdong Peoples R China

The intelligent substation project has a high workload, high error rate, and low efficiency in SCD virtual terminal connection. A technique for automatically generating virtual circuits has been proposed to improve the efficiency of SCD virtual terminal connections. Using the virtual circuit design template, this article first uses the K-nearest neighbor learning method to automatically match virtual terminals. On the basis of training data, a weight vector optimization model will be constructed, with weight vectors as optimization parameters and appropriate objective functions set. By using an improved simulated annealing algorithm to solve the weight optimization model, the optimal solution of the distance weight vector is obtained. The verification through examples shows that compared to existing technologies, this method obtains more accurate virtual terminal connection results and higher matching efficiency.

关键词： Intelligent substation Virtual circuit K-nearest neighbor learning method improved simulated annealing algorithm

来源：评论

学校读者我要写书评

暂无评论

A pathway to sustainable aviation: Modeling aircraft takeoff mass for precise fuel consumption and aircraft emission calculations

引用

ENERGY 2025年 319卷

作者： Zou, Runyuan Wang, Bing Wang, Kun Shang, Wen-Long Xue, Dabin Ochieng, Washington Yotto Xian Aeronaut Inst Sch Civil Aviat Xian Peoples R China Nanjing Univ Aeronaut & Astronaut Coll Gen Aviat & Flight Nanjing Peoples R China State Key Lab Air Traff Management Syst Nanjing Peoples R China Hong Kong Polytech Univ Dept Ind & Syst Engn Hong Kong Peoples R China Imperial Coll London Dept Civil & Environm Engn London England Hong Kong Polytech Univ Dept Land Surveying & Geoinformat Hong Kong Peoples R China Univ New South Wales Sch Aviat Sydney Australia

As air travel demand continues to rise, aviation fuel consumption and emissions have become critical concerns. Accurate fuel and emissions calculations depend significantly on aircraft takeoff mass, a parameter often kept confidential by airlines. This study aims to address this challenge by developing a takeoff mass estimation model utilizing Quick Access Recorder (QAR) data, which is optimized and validated through the improved simulated annealing (ISA) algorithm. This model is designed to be adaptable to Automatic Dependent Surveillance- Broadcast (ADS-B) data, providing a novel solution for estimating takeoff mass in the absence of confidential data from airlines. By incorporating the estimated takeoff mass into a framework for fuel consumption and emission calculations based on the Base of Aircraft Data (BADA) and the Engine Emissions Data Bank (EEDB), this study provides reasonably accurate estimations of fuel consumption and emissions across different flight phases. The method is validated with historical data from B738 and A320, yielding an average relative error of 3.34 % in takeoff mass estimation, with 97.81 % of flights falling within a 10 % error margin. Emission calculations align with observed operational pollution patterns. This model enhances fuel efficiency and emissions monitoring, supporting sustainable aviation practices for airlines, manufacturers, and regulatory agencies.

关键词： Sustainable aviation Aircraft takeoff mass Fuel consumption Aircraft emissions improved simulated annealing algorithm

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：