An Efficient Resource Allocation Algorithm for Task Offloading in the Internet of Vehicles by Ahmad Salehi, Sadoon Azizi

“…Simulation results demonstrate that the proposed algorithm reduces memory costs and penalties from rejected tasks, while improving overall system profit. …”
Get full text

Application of Artificial Intelligence Algorithms in the Field of Antimicrobial Peptide Prediction by QIAN Yuchen, NIE Ting, HUA Yanming, XU Shiying, GUO Sheng, ZHANG Xin, LUO Xiaohu, LIU Yanan

“…Artificial intelligence algorithms can be continuously optimized based on prior knowledge and real-time data, which significantly improves the prediction efficiency of antibacterial peptides and reduces research and development costs. …”
Get full text

Hierarchical guided manta ray foraging optimization for global continuous optimization problems and parameter estimation of solar photovoltaic models by Zhentao Tang, Kaiyu Wang, Lan Zhuang, Mingxin Zhu, Yongxuan Yao, Huiqin Chen, Jing Li, Xiaoxiang Wu, Shangce Gao

“…Abstract The manta ray foraging optimization (MRFO) algorithm has gained widespread application in engineering problems due to its notable performance and low computational cost. …”
Get full text

Adaptive Differential Evolution Algorithm for Forward Position Solution of Parallel Mechanism by Yi Jian

“…Aiming at the basic DE algorithm has some weaknesses,such as evolutionary stagnation and falling into local extremum domains,an adaptive strategy for introducing new individuals is presented to improve its optimization performance. …”
Get full text

Precise wind allocation scheme decision based on attraction-repulsion algorithm by NI Jingfeng, CHEN Dunwei, LIU Yujiao

“…Performance test results showed that AROA had a significant advantage in comprehensive optimization performance compared to Genetic Algorithm (GA), Simulated Annealing-Improved Particle Swarm Optimization (SA-IPSO), and Monotonic Basin Hopping (MBH). …”
Get full text

Capuchin search algorithm based task scheduling in cloud computing environment by Sivakumar Ramu, Rameshkumar Ranganathan, Ramakrishnan Ramamoorthy

“…Then, we develop a modified capuchin search (MCS) algorithm for priority based optimal task scheduling which minimize makespan and improve resource utilization. …”
Get full text

Cost-effectiveness analysis of best management practices for non-point source pollution in watersheds: A review by CHANG Jian, YU Jie, WANG Fei’er, ZHENG Siyuan

“…Application of cost-effectiveness analysis method included three categories, coupling NPS model with empirical calculation methods, coupling NPS model with economic model and cost-effectiveness analysis based on optimization algorithm. …”
Get full text

A Projection Strategy for Improving the Preconditioner in the LOBPCG by Ma Tailai, Sun Shuli, Zheng Fangyi, Chen Pu

“…This oblique projection technique can find a more accurate approximate solution which minimizes the 2-norm residuals in the search subspace without significantly increasing computational cost, thereby improving the quality of the preconditioner, thus accelerating convergence of the LOBPCG.Numerical experiments show that the projection strategy can improve the LOBPCG algorithm significantly in terms of efficiency and stability.…”
Get full text

EPRSA: interference resource scheduling algorithms for air-ground communication networks by Wenpeng Wu, Zhenhua Wei, Haiyang You, Xiaoqing Li, Jianwei Zhan, Zhaoguang Zhang

“…Based on this, this paper proposes the interference link margin in the mathematical model and normalizes and quantifies the optimization objectives. Strategies such as cycle and initial quantity selection, elastic initialization, double tabu power scheduling, and jammer conversion are designed to improve the scheduling ability of the Elastic Parallel Random Search Algorithm (EPRSA) in terms of system operation duration and interference cost. …”
Get full text

Qualitative Simulation Algorithm for Resource Scheduling in Enterprise Management Cloud Mode by Jiaohui Yu

“…Aiming at the problem of resource scheduling optimization in enterprise management cloud mode, a customizable fuzzy clustering cloud resource scheduling algorithm based on trust sensitivity is proposed. …”
Get full text

Optimization of Hybrid Laminates with Extension-Shear Coupling by Da Cui, Daokui Li

“…The extension-shear-coupled effect of hybrid laminates is optimized with improved differential evolution algorithm. …”
Get full text

Adjacency List Algorithm for Traffic Light Control Systems in Urban Networks by Sergio Rojas-Blanco, Alberto Cerezo-Narváez, Manuel Otero-Mateo, Sol Sáez-Martínez

“…An adjacency list is more efficient than matrices in terms of space and computational cost, allowing for the identification of critical signals before applying advanced optimization techniques such as neural networks or hypergraphs. …”
Get full text

Revocation encryption scheme based on domestic cryptographic algorithm SM9 by XIE Zhenjie, ZHANG Wanli, ZHANG Yao, ZHAO Fangfang, LIU Shengli

“…To address the limitations of lengthy system public keys and inefficient decryption in existing identity-based revocation encryption schemes, an optimized revocation encryption scheme was proposed based on SM9, China’s independently developed identity-based cryptographic algorithm. …”
Get full text

Research on the A* Algorithm for Automatic Guided Vehicles in Large-Scale Maps by Yuandong Chen, Jinhao Pang, Yuchen Gou, Zhiming Lin, Shaofeng Zheng, Dewang Chen

“…In terms of the improvement of the heuristic function, this study adopted the diagonal distance as the benchmark for cost estimation, and it innovatively introduces the angle coefficient to reflect the complexity of path turning, thus providing the algorithm with a more accurate guidance for the search direction. …”
Get full text

Fast Adaptive CU Partition Decision Algorithm for VVC Intra Coding by Lina Si, Wendi Zhu, Qiuwen Zhang

“…The algorithm has the capability to make partition decisions for CUs of diverse sizes (smaller than <inline-formula> <tex-math notation="LaTeX">$32\times 32$ </tex-math></inline-formula>) and completely bypass the intricate process of Rate-distortion Optimization (RDO), resulting in a significant reduction in encoding time. …”
Get full text

Supply Chains Problem During Crises: A Data-Driven Approach by Farima Salamian, Amirmohammad Paksaz, Behrooz Khalil Loo, Mobina Mousapour Mamoudan, Mohammad Aghsami, Amir Aghsami

“…The solution methodology combines the Grasshopper Optimization Algorithm (GOA) and the ɛ-constraint method, efficiently addressing the multi-objective nature of the problem. …”
Get full text

Optimal Management in the Operation of Complex Technical Systems by Dyadyura K., Oborskyi G., Prokopovych I., Khamitov V., Holubiev M.

“…Additionally, proof of the existence of an optimal verification strategy was given. An algorithm for determining the moments of verification was developed to ensure the minimum cost. …”
Get full text

A Defect Detection Algorithm for Optoelectronic Detectors Utilizing GLV-YOLO by Xinfang Zhao, Qinghua Lyu, Hui Zeng, Zhuoyi Ling, Zhongsheng Zhai, Hui Lyu, Saffa Riffat, Benyuan Chen, Wanting Wang

“…The experimental results showed that the proposed algorithm achieved 98.9% accuracy, with 2.1 million parameters and a computational cost of 7.0 GFLOPs. …”
Get full text

Metaheuristics in Logistics: Increasing the Efficiency of Algorithms by Defining Appropriate Parameter Settings by Tamara J. Bíró, Péter Németh

“…In many cases, when applying a metaheuristic, it works properly with the variables of a given task and there is no specific interval where a given algorithm can still be effective. To increase efficiency and reduce costs, the authors defined a general parameter definition by applying the Ant Colony Optimization algorithm applicable to the simple Traveling Salesman Problem with the number of cities n=50, where for values of 30 = n = 50, the defined parameter setting structure can be properly applied based on the results. …”
Get full text

A BIT* algorithm with dilated vertices-based path stretching strategy by Xuanle Wu, Pu Li, Zhicheng Hou

“…In addition, DS-BIT* performs bidirectional improvement of the final path at the end of the algorithm, further reducing the final path cost. …”
Get full text