A hybrid evolution strategies algorithm for non-permutation flow shop scheduling problems by Bilal Khurshid, Shahid Maqsood, Muhammad Salman Habib, Muhammad Omair, Seung-June Hwang

“…The Quad swap mutation operator is employed in the IES to optimize the utilization of the solution space while minimizing computational time. …”
Get full text

The impact of intravenous iodinated contrast agents on radiotherapy dose calculation and radiobiological effect predictions in central lung cancer by Defu Yang, Feng Shang, Ying Xu, Ying Yan

“…BackgroundAccurate dose calculation algorithms are critical for optimizing radiotherapy outcomes. …”
Get full text

Modelling and Simulation of Perturb and Observe MPPT Algorithm Based on The PI Controller for Photovoltaic System by Ahlam Mohamad Shakoor, Hersh Hasan Taha

“…The proposed PV system is composed of a Photovoltaic array, DC to DC boost type converter and an MPPT algorithm using perturb and observe method. 1Soltech 1STH-220-P module type was chosen in this study for the simulation and proposed PV The array consists of 40 rows of PV modules connected in parallel, while each row consists of 10 modules connected in a series. …”
Get full text

Research on Radio Network Intelligent Frequency Selection Technology Based on an Adaptive Genetic Algorithm by Wenjun Wang

“…In order to solve the problem of selecting frequency more and more difficultly for radio network,an intelligent frequency selection technology based on an adaptive genetic algorithm was proposed.Frequencies were selected for whole radio network from the perspective of intelligent optimization.On the basis of the standard genetic algorithm,this novel method improved genetic operators,and the preservation of the optimal individual algorithm to ensure the diversity of the population was introduced.Therefore,the arithmetic which did well in avoiding some deficiencies of the traditional frequency selection algorithm prevented local optimization and ran into overall optimization ultimately.Theoretical analysis and simulation results show that the new algorithm in solving the problem of frequency selection for large-scale network has higher efficiency and precision than the traditional algorithm,and stability is significantly enhanced.…”
Get full text

Improving kinetic model fitting for total titratable acidity in bananas using genetic algorithms by Alejandro Kevin Méndez Castillo, Elizabeth Contreras López, Jesús Guadalupe Pérez Flores, Laura García Curiel, Emmanuel Pérez Escalante, Karla Soto Vega, Carlos Ángel-Jijón, Alicia Cervantes Elizarrarás

“… This research aimed to automate the fitting of kinetic models using genetic algorithms (GAs) to optimize the estimation of kinetic parameters—the reaction rate constant (k) and the initial value of total titratable acidity (TTA, C₀)—and enhance predictive accuracy. …”
Get full text

Rule-Based Multiple Coverage Path Planning Algorithm for Scanning a Region of Interest by Nameung Hwang, Joonwon Kim, Philjoon Jung

“…The performance of the proposed algorithm is verified by numerous simulations.…”
Get full text

Parameter estimation and speed control of real DC motor with low resolution encoder by Celal Onur Gökçe, Mahmut Esat İpek, Mehmet Dayıoğlu, Rıdvan Ünal

“…For parameter estimation, a popular iterative optimization algorithm, namely Particle Swarm Optimization (PSO), is used. …”
Get full text

Efficient Pathfinding on Grid Maps: Comparative Analysis of Classical Algorithms and Incremental Line Search by Amr Elshahed, Majid Khan Bin Majahar Ali, Ahmad Sufril Azlan Mohamed, Farah Aini Binti Abdullah, Ts. Lee Jian Aun

“…Pathfinding on grid maps is a cornerstone problem in robotics, autonomous navigation, and game development. Classical algorithms such as A*, Dijkstra’s, and Breadth-First Search (BFS) are known for their ability to guarantee optimal solutions, while others like Depth-First Search (DFS) and Greedy Best-First Search prioritize speed over optimality. …”
Get full text

Cellular-free RAN slicing resource allocation algorithm based on multi-timescale collaboration by XIA Weiwei, WANG Boye, XIA Yaxing, MIAO Weiwei, WANG Dayang, JING Dongsheng, YAN Feng, SHEN Lianfeng

“…To address the issue of ensuring user quality of service in resource allocation for 6G cell-free radio access network slicing under dynamic service variations, a resource allocation algorithm based on multi-timescale collaborative optimization was proposed. …”
Get full text

A dereverberation beamforming algorithm for noise source localization in anechoic and semi-reverberant environments by R. Singh, A. Mimani, R. Kumar

“…Additionally, the CLEAN-SC deconvolution applied to the DBF maps of the mixer-grinder significantly improved the source resolution. • DBF algorithm is presented based on CCM filtering using an optimized Hanning window to significantly improve the localization accuracy of noise sources within λ/20 uncertainty. • Trial-and-error method is used to determine the optimal Hanning window width, which depends on frequency, noise source and surroundings. • It was necessary to implement DBF even in an anechoic chamber to accurately localize noise sources generated by engineering applications.…”
Get full text

Comparative Study of Algorithms for the Conversion From Surface Mesh Models to Volume Mesh Models by Youxi Wang, Qi Pang, Meng Li, Yang Liu

“…The Delaunay algorithm performed best in terms of efficiency and model size, while the Frontal algorithm had an advantage in model refinement. …”
Get full text

Unified Analysis of Decentralized Gradient Descent: A Contraction Mapping Framework by Erik G. Larsson, Nicolo Michelusi

Get full text

Hybrid Estimation of Distribution Algorithm for Solving Three-Stage Multiobjective Integrated Scheduling Problem by Chao Deng, Rong Hu, Bin Qian, Huai P. Jin

“…A variable neighborhood hybrid operation based on the speed scheduling set is designed in Local Search II to further improve the quality of the solution while balancing the optimization goals. Finally, simulations and comparisons show the efficiency of the proposed HEDA_VNS.…”
Get full text

A clustering algorithm based on grids for core data and adjacency relationships for edge data by Honglei He

“…To address these issues, existing research primarily focuses on three directions: (1) optimizing the adaptive selection of grid parameters, which struggles to handle variations in cluster density; (2) improving grid division methods (e.g., multi-granularity or dynamic grids), which have limited effectiveness on complex-shaped data; and (3) integrating other clustering techniques, which enhances accuracy but increases algorithmic complexity. …”
Get full text

Barcode-free multiplex plasmid sequencing using Bayesian analysis and nanopore sequencing by Masaaki Uematsu, Jeremy M Baskin

“…Long-read sequencing has emerged as a competitor to Sanger sequencing, with the principal benefit that whole plasmids can be sequenced in a single run. …”
Get full text

Risk of AI Algorithmic Discrimination Embedded in Government Data Governance and Its Prevention and Control by PENG Lihui, ZHANG Qiong, LI Tianyi

“…To address this issue, this study proposed a series of targeted prevention and control measures, including clarifying the principle of algorithmic fairness, formulating industry norms and standards, improving the accountability mechanism and regulatory system, and optimizing the data collection and processing environment, so as to effectively curb the phenomenon of algorithmic discrimination while making full use of the advantages of AI technology, so that AI technology in government data governance can truly benefit the people, and promote social fairness and justice.…”
Get full text

Priority-aware task offloading for LEO satellite edge computing network: a multi-agent deep reinforcement learning-based approach by Juan Chen, Jie Zhong, Zongling Wu, Di Tian, Yujie Chen

“…The MA2C algorithm employs two cooperative agents to optimize scheduling strategies: one agent is responsible for prioritizing tasks, while the other focuses on task offloading decisions. …”
Get full text

Stress management with HRV following AI, semantic ontology, genetic algorithm and tree explainer by Ayan Chatterjee, Michael A. Riegler, K. Ganesh, Pål Halvorsen

“…Various techniques like feature selection and dimensionality reduction are explored to improve classification accuracy while minimizing bias. Different machine learning (ML) algorithms, including traditional and ensemble methods, are employed for analyzing both imbalanced and balanced HRV datasets. …”
Get full text

Combining 3-Opt and Improved Discrete Cuckoo Search Algorithm for the Traveling Salesman Problem by A. Sarucan, M. F. Berkaya

“…In terms of processing time, the average time of the proposed algorithm was 11.46 seconds, while the average time of the improved discrete CSA was 92.86 seconds. …”
Get full text

Joint user association and dynamic resource allocation algorithm for LEO-RAN slicing scenarios by Geng CHEN, Zhiwei XING, Fei SHEN, Qingtian ZENG

“…A joint user association and dynamic resource allocation algorithm was proposed for the slicing scenario of ultra dense low earth orbit-radio access network (LEO-RAN) in order to address the efficient utilization of resources of the integrated terrestrial-satellite network for 6G .Considering the constraints of the minimum rate, maximum delay and resource proportion of different slices, a joint optimization problem of user association and resource allocation was established to maximize the weighted sum of the SE and the differentiated SLA of different slices as the optimization objective.A network slicing algorithm based on multi-agent deep deterministic policy gradient (MADDPG) was proposed to determine the proportion of slicing resources, a Lagrange dual based user association algorithm was proposed to determine the optimal user association policy and the resources were allocated to users by using the round-robin scheduling mechanism.The simulation results show that the proposed algorithm can effectively improve SE while satisfying the differentiated SLA of different slices.Compared with MADDPG-RA, MATD3-LG, MATD3-RA, MASAC-LG and MASAC-RA algorithms, the system utility of the proposed algorithm is improved by 2.0%, 2.3%, 5.7%, 8.7% and 9.4%, respectively.…”
Get full text