Related references
Note: Only part of the references are listed.
Article
Engineering, Multidisciplinary
Fang Guo et al.
Summary: This paper studies the problem of weapon transportation support scheduling on an aircraft carrier deck and presents a novel solution architecture. By considering the interference of the carrier-based aircraft deck layout, a mixed integer formulation is established to minimize the total objective. A bi-population immune algorithm is proposed to solve the problem, which outperforms all compared algorithms and significantly improves efficiency. The established model and algorithm effectively respond to the weapon support requirements of carrier-based aircraft under different sortie missions.
DEFENCE TECHNOLOGY
(2023)
Article
Computer Science, Interdisciplinary Applications
Hoang-Le Minh et al.
Summary: In this paper, a variable velocity strategy particle swarm optimization (VVS-PSO) is introduced for solving optimization problems. VVS-PSO improves convergence rate and accuracy by adding a new term to the velocity updating process. Experimental results demonstrate the high accuracy and reliability of VVS-PSO in optimization and structural damage assessment problems.
ENGINEERING WITH COMPUTERS
(2023)
Article
Optics
Dan Liu et al.
Summary: This paper combines the improved ant colony algorithm to study the logistics distribution path design and optimization. The fusion of genetic algorithm and improved ant colony algorithm transforms the path optimal solution into the initial distribution of pheromone, and the mutation operator expands the search space and accelerates the convergence to the optimal solution. The logistics distribution route optimization design and optimization method based on the improved ant colony algorithm proposed in this paper has good results.
Article
Computer Science, Artificial Intelligence
Xuan Wu et al.
Summary: In this work, we use Surprisingly Popular Algorithm (SPA) as an additional metric to evaluate particle performance in addition to fitness. This allows particles that are not widely known to be selected as learning exemplars. We also propose a Euclidean distance-based adaptive topology where each particle only connects to a limited number of particles with the shortest Euclidean distance. Moreover, we apply the adaptive topology to heterogeneous populations to solve large-scale problems more effectively.
SWARM AND EVOLUTIONARY COMPUTATION
(2023)
Article
Computer Science, Artificial Intelligence
Fereshteh Karimi et al.
Summary: This article proposes a method called SemiACO, based on Ant Colony Optimization, for the semi-supervised feature selection problem. It finds features by considering minimum redundancy and maximum relevancy, using a nonlinear heuristic function and a Temporal Difference reinforcement learning algorithm.
EXPERT SYSTEMS WITH APPLICATIONS
(2023)
Article
Oceanography
Pan Gao et al.
Summary: Due to rapid economic growth, the shipping industry has become increasingly important. Relying solely on crew decisions for ship collision avoidance measures may lead to hidden dangers in navigation safety, especially with the increase in ship density and complexity of ship routes. This study considers the ship collision avoidance path planning problem with carbon emission constraint and proposes a modified potential field ant colony algorithm to solve it effectively. Simulation results show that the algorithm improves the accuracy of route prediction and anti-collision based on automatic identification system (AIS) data.
OCEAN & COASTAL MANAGEMENT
(2023)
Article
Computer Science, Artificial Intelligence
Teng Ren et al.
Summary: This study establishes a mathematical model to optimize vehicle routing with the objective of minimizing total cost, considering traffic conditions, satisfaction, and energy saving and emission reduction. An improved ant colony optimization algorithm is designed to solve the model, and its effectiveness is verified through numerical simulations.
SWARM AND EVOLUTIONARY COMPUTATION
(2023)
Article
Computer Science, Artificial Intelligence
Zhengyi Chai et al.
Summary: This paper proposes a symmetric uncertainty based decomposition multi-objective immune algorithm (MOIA/D-SU) for feature selection. Three novel strategies, namely population initialization strategy (PIS), proportional clone strategy (PCS), and population update strategy (PUS), are introduced. Experimental results demonstrate that MOIA/D-SU can better balance the conflicting goals of reducing feature number and improving classification accuracy, and achieve higher classification accuracy.
SWARM AND EVOLUTIONARY COMPUTATION
(2023)
Article
Computer Science, Artificial Intelligence
Wei Li et al.
Summary: The traveling salesman problem (TSP) is a challenging problem with various proposed solution methods, including the ant colony optimization (ACO) algorithm. However, the performance of ACO is limited by convergence to local optima and computational accuracy. To address these limitations, this study presents a novel ACO algorithm called HSDACO. HSDACO incorporates heterogeneous population automation, smoothing techniques, differential information updating, and evolutionary state estimation and adjustment to improve solution quality and convergence speed for TSP instances.
APPLIED SOFT COMPUTING
(2023)
Article
Automation & Control Systems
Yuan-Hao Jiang et al.
Summary: Rail-guided vehicles are widely used in logistics management to replace manual labor for material handling operations. However, optimizing the material transfer path for rail-guided vehicles with large dimensions is challenging. This research proposes a large-scale differential evolution algorithm based on a transdifferentiation strategy, which enables individuals with poor fitness to regain maturity and maintain population diversity. The algorithm demonstrates superior performance in achieving higher output rates and stable effects, regardless of processing parameters, making it valuable for key component processing in the ship and aviation manufacturing industries.
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE
(2023)
Article
Computer Science, Artificial Intelligence
Ilhan Ilhan et al.
Summary: The traveling salesman problem is a popular combinatorial optimization problem that is difficult to solve and has high time complexity. Researchers use it as a standard test bench to evaluate the performance of new algorithms for solving real-world problems. This study proposes a new simulated annealing algorithm called LBSA-CO, which introduces innovations in solution improvement, crossover, and local search. The algorithm utilizes OX1 and ER operators for faster convergence, and parameter tuning is done using the Taguchi method. Experimental results show that the proposed method outperforms state-of-the-art methods on multiple instances.
NEURAL COMPUTING & APPLICATIONS
(2022)
Article
Computer Science, Artificial Intelligence
Wei Yuan et al.
Summary: The article introduces the application of adaptive and non-adaptive optimization methods in deep learning, proposes a new non-adaptive method SGD(MD) based on the idea of difference, and experimental results show that in some cases it is even better than popular adaptive optimization methods.
APPLIED INTELLIGENCE
(2022)
Article
Chemistry, Multidisciplinary
Sara Perez-Carabaza et al.
Summary: Ant Colony Optimization (ACO) is a family of metaheuristics inspired by the foraging behavior of ants, with the most advanced algorithms being MMAS and ACS.
APPLIED SCIENCES-BASEL
(2022)
Article
Mathematics
Abu Saleh Bin Shahadat et al.
Summary: Ant Colony Optimization (ACO) is a widely studied bio-inspired algorithm that generates feasible solutions for combinatorial optimization problems. This study proposes an improved ACO-based method, called ACO with Adaptive Visibility (ACOAV), which utilizes a new distance metric and partial solution updates to generate better solutions for the Traveling Salesman Problem (TSP).
Article
Biochemical Research Methods
Yu-Hang Yin et al.
Summary: Accurate prediction of DNA-protein binding is crucial for studying gene expression regulation. MSDenseNet, a novel computational method, combines a fault-tolerant coding scheme with dense connection deep neural networks to improve the performance of DPB prediction. The method utilizes powerful feature representation, multi-scale convolutions, and advanced neural networks, achieving better results compared to state-of-the-art methods.
ANALYTICAL BIOCHEMISTRY
(2022)
Article
Engineering, Multidisciplinary
Lian Lian
Summary: An adaptive multi-objective optimization artificial immune algorithm is proposed for reactive power optimization. The algorithm ranks antibodies using a non-inferior solution ranking method based on Pareto coefficient, and ensures convergence through fitness evaluation mechanism and adaptive cloning operator. Chaotic random sequence is added to the mutation operator to enhance antibody population diversity. A multi-objective reactive power optimization model considering minimum active power loss, maximum static voltage stability margin and optimal voltage level is established. The designed algorithm is effective in improving the economic operation and voltage stability of the power grid.
AIN SHAMS ENGINEERING JOURNAL
(2022)
Article
Computer Science, Interdisciplinary Applications
Gonzalo Lera-Romero et al.
Summary: This study focuses on the time-dependent traveling salesman problem and proposes a labeling-based algorithm to solve it. Experimental results show that the algorithm outperforms other algorithms on a large number of benchmark instances and improves upon the minimum tour duration problem.
INFORMS JOURNAL ON COMPUTING
(2022)
Article
Engineering, Electrical & Electronic
Marcos Tostado-Veliz et al.
Summary: This paper addresses the efficient Power-Flow solution of ill-conditioned cases, suggesting modifications to the standard structure of the Continuous Newton's method. A new Power-Flow solver is developed based on the introduced solution framework and the results show promising improvements in robustness and efficiency.
INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS
(2021)
Article
Computer Science, Interdisciplinary Applications
Davoud Sedighizadeh et al.
Summary: The Particle Swarm Optimization (PSO) algorithm, a nature-inspired meta-heuristic, has evolved into various variants due to its flexibility in parameters and concepts. The Generalized Particle Swarm Optimization (GEPSO) algorithm enriches the original PSO by incorporating new terms and dynamic inertia weight updates, leading to improved performance in continuous space optimization.
MATHEMATICS AND COMPUTERS IN SIMULATION
(2021)
Article
Computer Science, Artificial Intelligence
Yong Wang et al.
Summary: The study combines the hybrid symbiotic organisms search (SOS) and ant colony optimization (ACO) algorithms for solving the traveling salesman problem (TSP), demonstrating improved performance through adaptive parameter optimization and validating the results through experiments.
APPLIED SOFT COMPUTING
(2021)
Article
Microbiology
Xiaoling Wang et al.
Summary: Self-healing is an intrinsic ability in multicellular organisms, including bacterial biofilms. The healing process of biofilm cuts depends on factors such as cut geometries, biofilm properties, substrate properties, and environmental conditions. The rate of healing along the cut is heterogeneous, with potential for rapid healing under certain conditions. Further study on phenotypic evolution and cell differentiation provides insights into the mechanisms of biofilm self-healing.
ARCHIVES OF MICROBIOLOGY
(2021)
Article
Computer Science, Information Systems
Bibi Aamirah Shafaa Emambocus et al.
Summary: The Enhanced Swap Sequence based PSO algorithm is proposed by integrating strategies of XPSO into SSPSO to optimize solving TSP problems. The algorithm has been found to provide better solutions with shorter paths compared to SSPSO, but SSPSO converges faster when applied to TSP.
Article
Computer Science, Artificial Intelligence
Nizar Rokbani et al.
Summary: Heuristic computational intelligence techniques are widely used in solving combinatorial optimization problems in large configurations. The collaborative use of bio-inspired heuristics and meta-heuristics like PSO, FA, FPA, and ACO have shown promising results, particularly in addressing TSP problems. The experimental investigations have demonstrated the effectiveness and efficiency of these hybrid approaches in achieving low error rates and balanced performance/time ratios for various TSP test instances.
Review
Computer Science, Information Systems
Sourabh Katoch et al.
Summary: This paper discusses recent advances in genetic algorithms, analyzing selected algorithms of interest in the research community. It helps new and demanding researchers gain a broader understanding of genetic algorithms. The review covers well-known algorithms, genetic operators, research domains, and future research directions in genetic algorithms.
MULTIMEDIA TOOLS AND APPLICATIONS
(2021)
Article
Engineering, Industrial
Saroj Kumar et al.
INDUSTRIAL ROBOT-THE INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH AND APPLICATION
(2020)
Article
Computer Science, Artificial Intelligence
Kang Yang et al.
APPLIED INTELLIGENCE
(2020)
Article
Computer Science, Artificial Intelligence
Wenhong Wei et al.
APPLIED SOFT COMPUTING
(2020)
Article
Computer Science, Artificial Intelligence
Ahamed Fayeez Tuani et al.
APPLIED SOFT COMPUTING
(2020)
Article
Mathematics
Zhaojun Zhang et al.
Article
Computer Science, Information Systems
Ying Cui et al.
Article
Chemistry, Analytical
Fadl Dahan et al.
Article
Chemistry, Analytical
Junfeng Xin et al.
Review
Computer Science, Theory & Methods
C Blum et al.
ACM COMPUTING SURVEYS
(2003)
