720 results
Search Results
2. NUMERICAL COMPUTATION OF ENTROPY-REGULARIZED QUADRATIC OPTIMIZATION PROBLEMS.
- Author
-
PIQIN SHI, CHENGJING WANG, CAN XIANG, and PEIPEI TANG
- Subjects
MATHEMATICAL optimization ,ALGORITHMS ,PROBLEM solving ,MACHINE learning ,NUMERICAL analysis - Abstract
Entropy-regularized quadratic optimization problems are a special class of optimization problems with wide applications in various fields, such as transportation and machine learning. In this paper, we apply the augmented Lagrangian method to this problem with its subproblem solved by the block coordinate descent method. Under certain mild conditions, we analyze the global convergence of this algorithm. Numerical experiments demonstrate the effectiveness of this algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
3. UAV Localization Algorithm Based on Factor Graph Optimization in Complex Scenes.
- Author
-
Dai, Jun, Liu, Songlin, Hao, Xiangyang, Ren, Zongbin, and Yang, Xiao
- Subjects
KALMAN filtering ,GRAPH algorithms ,ALGORITHMS ,AERONAUTICAL navigation ,LOCALIZATION (Mathematics) ,MATHEMATICAL optimization ,PROBLEM solving - Abstract
With the increasingly widespread application of UAV intelligence, the need for autonomous navigation and positioning is becoming more and more important. To solve the problem that UAV cannot perform localization in complex scenes, a new multi-source fusion framework factor graph optimization algorithm is used for UAV localization state estimation in this paper, which is based on IMU/GNSS/VO multi-source sensors. Based on the factor graph model and the iSAM incremental inference algorithm, a multi-source fusion model of IMU/GNSS/VO is established, including the IMU pre-integration factor, IMU bias factor, GNSS factor, and VO factor. Mathematical simulations and validations on the EuRoC dataset show that, when the selected sliding window size is 30, the factor graph optimization (FGO) algorithm can not only meet the requirements of real time and accuracy at the same time, but it also achieves a plug-and-play function in the event of local sensor failures. Finally, compared with the traditional federated Kalman algorithm and the adaptive federated Kalman algorithm, the positioning accuracy of the FGO algorithm in this paper is improved by 1.5–2-fold, and can effectively improve autonomous navigation system robustness and flexibility in complex scenarios. Moreover, the multi-source fusion framework in this paper is a general algorithm framework that can satisfy other scenarios and other types of sensor combinations. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
4. Improved FunkSVD Algorithm Based on RMSProp.
- Author
-
Yue, Xiaochen and Liu, Qicheng
- Subjects
ALGORITHMS ,DEEP learning ,MACHINE learning ,MATHEMATICAL optimization ,PROBLEM solving - Abstract
To solve the problem of low accuracy in the traditional FunkSVD recommendation algorithm, an improved FunkSVD algorithm (RM-FS) is proposed. RM-FS is an improvement of the traditional FunkSVD algorithm, using RMSProp, a deep learning optimization algorithm. The RM-FS algorithm can not only solve the problem of reduced accuracy of the traditional FunkSVD algorithm because of iterative oscillations but also alleviate the impact of data sparseness on the accuracy of the algorithm, achieving the effect of improving the accuracy of the traditional algorithm. The experimental results show that the RM-FS algorithm proposed in this paper effectively improves the accuracy of the recommendation algorithm, which is better than the traditional FunkSVD recommendation algorithm and other improved FunkSVD algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
5. Algorithms for the Reconstruction of Genomic Structures with Proofs of Their Low Polynomial Complexity and High Exactness.
- Author
-
Gorbunov, Konstantin and Lyubetsky, Vassily
- Subjects
DIRECTED graphs ,POLYNOMIALS ,ALGORITHMS ,COMPUTATIONAL complexity ,MATHEMATICAL optimization ,PROBLEM solving ,PATHS & cycles in graph theory ,BIPARTITE graphs - Abstract
The mathematical side of applied problems in multiple subject areas (biology, pattern recognition, etc.) is reduced to the problem of discrete optimization in the following mathematical method. We were provided a network and graphs in its leaves, for which we needed to find a rearrangement of graphs by non-leaf nodes, in which the given functional reached its minimum. Such a problem, even in the simplest case, is NP-hard, which means unavoidable restrictions on the network, on graphs, or on the functional. In this publication, this problem is addressed in the case of all graphs being so-called "structures", meaning directed-loaded graphs consisting of paths and cycles, and the functional as the sum (over all edges in the network) of distances between structures at the endpoints of every edge. The distance itself is equal to the minimal length of sequence from the fixed list of operations, the composition of which transforms the structure at one endpoint of the edge into the structure at its other endpoint. The list of operations (and their costs) on such a graph is fixed. Under these conditions, the given discrete optimization problem is called the reconstruction problem. This paper presents novel algorithms for solving the reconstruction problem, along with full proofs of their low error and low polynomial complexity. For example, for the network, the problem is solved with a zero error algorithm that has a linear polynomial computational complexity; and for the tree the problem is solved using an algorithm with a multiplicative error of at most two, which has a second order polynomial computational complexity. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
6. 基于TVM平台的MEC卷积算法优化.
- Author
-
王朝闻, 蒋林, 李远成, and 朱筠
- Subjects
VIRTUAL machine systems ,PROBLEM solving ,MATHEMATICAL optimization ,MEMORY ,ALGORITHMS - Abstract
Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
- Published
- 2023
- Full Text
- View/download PDF
7. OPTIMIZATION ALGORITHM OF TILTED IMAGE MATCHING BASED ON ADAPTIVE INITIAL OBJECT ASPECT.
- Author
-
Zhang, C., Ge, Y., Zhang, Q., and Guo, B.
- Subjects
IMAGE registration ,LEAST squares ,MATHEMATICAL optimization ,ALGORITHMS ,PROBLEM solving - Abstract
When adopting the matching method of the least squares image based on object-patch to match tilted images, problems like the low degree of connection points for images with the discontinuity of depth or the discrepancy in elevation or low availability of aerotriangulation points would frequently appear. To address such problems, a tilted-image-matching algorithm based on an adaptive initial object-patch is proposed by this paper. By means of the existing initial values of the interior and exterior orientation elements of the tilted image and the information of object points generated in the matching process, the algorithm takes advantage of the method of multi-patch forward intersection and object variance partition so as to adaptively calculate the elevation of the object-patch and the initial value of the normal vector direction angle. Furthermore, this algorithm aims to solve the problem of difficulties in matching the tilted image with its corresponding points brought about by the low accuracy of the initial value of the tilted image when adopting the matching method of the least squares image based on object-patch to match the tilted image with high discrepancy in elevation. We adopt the algorithm as proposed in this paper and the least squares image matching method in which the initial state of the object-patch is horizontal to the object-patch respectively to conduct the verification process of comparing and matching two groups of tilted images. Finally, the effectiveness of the algorithm as proposed in this paper is verified by the testing results. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
8. A fixed structure learning automata‐based optimization algorithm for structure learning of Bayesian networks.
- Author
-
Asghari, Kayvan, Masdari, Mohammad, Soleimanian Gharehchopogh, Farhad, and Saneifard, Rahim
- Subjects
ANT algorithms ,BEES algorithm ,MATHEMATICAL optimization ,MACHINE learning ,ALGORITHMS ,PROBLEM solving ,KNOWLEDGE representation (Information theory) ,METAHEURISTIC algorithms - Abstract
One of the useful knowledge representation tools, which can describe the joint probability distribution between some random variables with a graphical model and can be trained by a dataset, is the Bayesian network (BN). A BN is composed of a network structure and a conditional probability distribution table for each node. Discovering an optimal BN structure is an NP‐hard optimization problem that various meta‐heuristic algorithms are applied to solve this problem by researchers. The genetic algorithms, ant colony optimization, evolutionary programming, artificial bee colony, and bacterial foraging optimization are some of the meta‐heuristic methods to solve this problem using a dataset. Most of these methods are applying a scoring metric to generate the best network structure from a set of candidates. A Fixed Structure Learning Automata‐Based (FSLA‐B) algorithm is presented in this paper to solve the structure learning problem of BNs. There is a fixed structure learning automaton for each pair of vertices in the BN's graph structure in the proposed algorithm. The action of this automaton determines the presence and direction of an edge between the vertices. The proposed algorithm performs a guided search procedure using the FSLA and escapes from local optimums. Several datasets are utilised in this paper to evaluate the performance of the proposed algorithm. By performing various experiments, multiple meta‐heuristic algorithms are compared with the introduced new one. The obtained results represented that the proposed algorithm could produce competitive results and find the near‐optimal solution for the BN structure learning problem. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
9. A Novel Self-Adaptive Cooperative Coevolution Algorithm for Solving Continuous Large-Scale Global Optimization Problems †.
- Author
-
Vakhnin, Aleksei and Sopov, Evgenii
- Subjects
GLOBAL optimization ,COEVOLUTION ,ALGORITHMS ,PROBLEM solving ,MATHEMATICAL optimization ,SELF-adaptive software ,METAHEURISTIC algorithms ,EVOLUTIONARY algorithms - Abstract
Unconstrained continuous large-scale global optimization (LSGO) is still a challenging task for a wide range of modern metaheuristic approaches. A cooperative coevolution approach is a good tool for increasing the performance of an evolutionary algorithm in solving high-dimensional optimization problems. However, the performance of cooperative coevolution approaches for LSGO depends significantly on the problem decomposition, namely, on the number of subcomponents and on how variables are grouped in these subcomponents. Also, the choice of the population size is still an open question for population-based algorithms. This paper discusses a method for selecting the number of subcomponents and the population size during the optimization process ("on fly") from a predefined pool of parameters. The selection of the parameters is based on their performance in the previous optimization steps. The main goal of the study is the improvement of coevolutionary decomposition-based algorithms for solving LSGO problems. In this paper, we propose a novel self-adapt evolutionary algorithm for solving continuous LSGO problems. We have tested this algorithm on 15 optimization problems from the IEEE LSGO CEC'2013 benchmark suite. The proposed approach, on average, outperforms cooperative coevolution algorithms with a static number of subcomponents and a static number of individuals. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
10. INNA: An improved neural network algorithm for solving reliability optimization problems.
- Author
-
Kundu, Tanmay and Garg, Harish
- Subjects
REDUNDANCY in engineering ,ALGORITHMS ,MULTIPLE comparisons (Statistics) ,STATISTICAL hypothesis testing ,MATHEMATICAL optimization ,PARTICLE swarm optimization ,PROBLEM solving - Abstract
The main objective of this paper is to present an improved neural network algorithm (INNA) for solving the reliability-redundancy allocation problem (RRAP) with nonlinear resource constraints. In this RRAP, both the component reliability and the redundancy allocation are to be considered simultaneously. Neural network algorithm (NNA) is one of the newest and efficient swarm optimization algorithms having a strong global search ability that is very adequate in solving different kinds of complex optimization problems. Despite its efficiency, NNA experiences poor exploitation, which causes slow convergence and also restricts its practical application of solving optimization problems. Considering this deficiency and to obtain a better balance between exploration and exploitation, searching procedure for NNA is reconstructed by implementing a new logarithmic spiral search operator and the searching strategy of the learner phase of teaching–learning-based optimization (TLBO) and an improved NNA has been developed in this paper. To demonstrate the performance of INNA, it is evaluated against seven well-known reliability optimization problems and finally compared with other existing meta-heuristics algorithms. Additionally, the INNA results are statistically investigated with the Wilcoxon sign-rank test and Multiple comparison test to show the significance of the results. Experimental results reveal that the proposed algorithm is highly competitive and performs better than previously developed algorithms in the literature. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
11. A Hybrid Golden Jackal Optimization and Golden Sine Algorithm with Dynamic Lens-Imaging Learning for Global Optimization Problems.
- Author
-
Yuan, Panliang, Zhang, Taihua, Yao, Liguo, Lu, Yao, and Zhuang, Weibin
- Subjects
GLOBAL optimization ,ALGORITHMS ,METAHEURISTIC algorithms ,MATHEMATICAL optimization ,PROBLEM solving ,PARTICLE swarm optimization - Abstract
Golden jackal optimization (GJO) is an effective metaheuristic algorithm that imitates the cooperative hunting behavior of the golden jackal. However, since the update of the prey's position often depends on the male golden jackal and there is insufficient diversity of golden jackals in some cases, it is prone to falling into a local optimal optimum. In order to address these drawbacks of GJO, this paper proposes an improved algorithm, called a hybrid GJO and golden sine (S) algorithm (Gold-SA) with dynamic lens-imaging (L) learning (LSGJO). First, this paper proposes novel dual golden spiral update rules inspired by Gold-SA. These rules give GJO the ability to think like a human (Gold-SA), making the golden jackal more intelligent in the process of preying, and improving the ability and efficiency of optimization. Second, a novel nonlinear dynamic decreasing scaling factor is introduced into the lens-imaging learning operator to maintain the population diversity. The performance of LSGJO is verified through 23 classical benchmark functions and 3 complex design problems in real scenarios. The experimental results show that LSGJO converges faster and more accurately than 11 state-of-the-art optimization algorithms, the global and local search ability has improved significantly, and the proposed algorithm has shown superior performance in solving constrained problems. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
12. Multi-objective power distribution optimization using NSGA-II.
- Author
-
Jain, Kunal, Gupta, Shashank, and Kumar, Divya
- Subjects
PROBLEM solving ,ELECTRIC potential ,ELECTRICAL engineering ,MATHEMATICAL optimization ,GENETIC algorithms ,EVOLUTIONARY algorithms ,ALGORITHMS - Abstract
Power distribution is one of the major areas of electrical engineering. The issue of optimized power distribution is of great concern and here it is dealt with as a single- and multi-objective problem. We know that evolutionary algorithms have better efficiency in solving such problems. In this paper, we have applied heuristics non-dominated sorting genetic algorithm II (NSGA-II, multiple objective optimization algorithm) to optimize functions such as corona loss, efficiency, potential drop, resistive loss, and volume of the conductor. The NSGA-II has outperformed other algorithms involving the optimal solution. NSGA-II is not only simple in terms of programming but also achieves the desired high-quality optimal solutions in fewer iterations. After our experiment, we have optimized the various functions presented in this paper. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
13. Anti-UAV High-Performance Computing Early Warning Neural Network Based on PSO Algorithm.
- Author
-
Lei, Yang, Yao, Honglei, Jiang, Bo, Tian, Tian, and Xing, Peifei
- Subjects
GLOBAL optimization ,ALGORITHMS ,MATHEMATICAL optimization ,WARNINGS ,PROBLEM solving - Abstract
In order to effectively solve the problem that the radar detection system is difficult to detect the "low, small, slow" UAV, the high-performance computing early warning neural network is used to recognize the air UAV in real time and extract the target category and image space location information; the PSO algorithm is used to optimize the parameters of the anti-UAV to ensure that the anti-UAV not only relies on factors but also fully combines the dependence of the visual field factor to quickly obtain the optimal solution through analyzing the high-performance computing early warning neural network in this paper. This algorithm is used to initialize the anti-UAV resources and improve the global optimization capability of the algorithm proposed in this paper. Finally, the experimental results show that the proposed PSO algorithm has better high-performance computing early warning performance to meet the actual needs of network high-performance computing early-warning neural networks. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
14. Successive zero-forcing DPC with per-antenna power constraint: Optimal and suboptimal designs
- Author
-
Mats Bengtsson, Markku Juntti, Bjorn Ottersten, and Le-Nam Tran
- Subjects
Mathematical optimization ,Design ,Optimization problem ,Computer science ,MIMO ,Precoder design ,050801 communication & media studies ,Telecommunication links ,Data_CODINGANDINFORMATIONTHEORY ,02 engineering and technology ,Precoding ,Relaxed problem ,Electrical & electronics engineering [C06] [Engineering, computing & technology] ,0508 media and communications ,Fast convergence rate ,Control theory ,0202 electrical engineering, electronic engineering, information engineering ,Constrained optimization ,Power constraints ,Computer Science::Information Theory ,Ingénierie électrique & électronique [C06] [Ingénierie, informatique & technologie] ,Problem solving ,Channel code ,Sub-optimal designs ,05 social sciences ,Optimal systems ,020206 networking & telecommunications ,Radio broadcasting ,MIMO broadcast channels ,Computational complexity ,Dirty paper coding ,Rate of convergence ,Achievable sum rates ,Per-antenna power constraints ,Antennas ,Relaxation (approximation) ,Optimal solutions ,Transmission techniques ,Zero-forcing ,Optimization problems ,Algorithms - Abstract
This paper considers the precoder designs for successive zero-forcing dirty paper coding (SZF-DPC), a suboptimal transmission technique for MIMO broadcast channels (MIMO BCs). Existing precoder designs for SZF-DPC often consider a sum power constraint. In this paper, we address the precoder design for SZF-DPC with per-antenna power constraints (PAPCs), which has not been well studied. First, we formulate the precoder design as a rank-constrained optimization problem, which is generally difficult to handle. To solve this problem, we follow a relaxation approach, and prove that the optimal solution of the relaxed problem is also optimal for the original problem. Considering the relaxed problem, we propose a numerically efficient algorithm to find the optimal solution, which exhibits a fast convergence rate. Suboptimal precoder designs, with lower computational complexity, are also presented, and compared with the optimal ones in terms of achievable sum rate and computational complexity. © 2012 IEEE.
- Published
- 2012
15. Candidate word generation for OCR errors using optimization algorithm.
- Author
-
Pham, D. T., Nguyen, D. Q., Le, A. D., Phan, M. N., and Kromer, P.
- Subjects
MATHEMATICAL optimization ,PROBLEM solving ,ALGORITHMS ,INTERNATIONAL competition ,HEURISTIC algorithms - Abstract
OCR post-processing is an important step to improve OCR text accuracy. It includes two main tasks, error detection and error correction. Hill climbing algorithm is a heuristic search method used for solving optimization problems. In this paper, we present a novel OCR error correction approach using an adapted version of the Hill climbing algorithm. Correction candidates of OCR errors are explored by random character edits and evolved with the Hill climbing. The character edit patterns are obtained from the training data. The proposed model is evaluated on the benchmark dataset in the OCR post-correction competition of the International Conference on Document Analysis and Recognition 2017. It is shown that our model outperforms various baseline approaches in the competition. In addition, the randomness of the proposed algorithm is analyzed to verify its stability under parameter configurations. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
16. Parking Space Detection and Path Planning Based on VIDAR.
- Author
-
Xu, Yi, Gao, Shanshang, Jiang, Guoxin, Gong, Xiaotong, Li, Hongxue, Sang, Xiaoqing, Wang, Liming, Zhu, Ruoyu, and Wang, Yuqiong
- Subjects
HOUGH transforms ,PROBLEM solving ,ALGORITHMS ,MATHEMATICAL optimization - Abstract
The existing automatic parking algorithms often neglect the unknown obstacles in the parking environment, which causes a hidden danger to the safety of the automatic parking system. Therefore, this paper proposes parking space detection and path planning based on the VIDAR method (vision-IMU-based detection and range method) to solve the problem. In the parking space detection stage, the generalized obstacles are detected based on VIDAR to determine the obstacle areas, and then parking lines are detected by the Hough transform to determine the empty parking space. Compared with the parking detection method based on YOLO v5, the experimental results demonstrate that the proposed method has higher accuracy in complex parking environments with unknown obstacles. In the path planning stage, the path optimization algorithm of the A ∗ algorithm combined with the Bezier curve is used to generate smooth curves, and the environmental information is updated in real time based on VIDAR. The simulation results show that the method can make the vehicle efficiently avoid the obstacles and generate a smooth path in a dynamic parking environment, which can well meet the safety and stationarity of the parking requirements. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
17. Optimal allocation of a hybrid photovoltaic‐based DG and DSTATCOM under the load and irradiance variability.
- Author
-
Oda, Eyad S., Ebeed, Mohamed, Abd El Hamed, Amal M., Ali, Abdelfatah, Elbaset, Adel A., and Abdelsattar, Montaser
- Subjects
PROBLEM solving ,COST control ,SOLAR spectra ,MATHEMATICAL optimization ,ALGORITHMS ,RENEWABLE energy sources ,SOLAR radiation - Abstract
Summary: This paper addresses the allocation of a hybrid system that includes PV‐DG and DSTATCOM. The planning problem considers the variations of load demand and solar irradiance under deterministic and probabilistic conditions. An efficient optimization algorithm called MPA is implemented to assign the optimal placement and ratings of the hybrid PV‐DG and DSTATCOM. The considered objective function is a multi‐objective function that includes the annual cost reduction, improvement of voltage profiles, and system stability improvement. The assessment is accomplished with the inclusion of a single and two‐hybrid system on a large 94‐bus system. For validating the effectiveness of the MPA, the yielded results are compared with the PSO, which is considered a commonly used algorithm. In deterministic conditions, the hourly variations of the load demand and solar radiation are considered in four yearly seasons, while in probabilistic conditions, 3 years of hourly historical data of solar irradiance and load demand are utilized to describe the uncertainties of the load demand and solar irradiance. The simulation results demonstrate that the optimal inclusion of a single‐hybrid PV‐DG and DSTATCOM system can enhance the system's technical performance (the voltage profile, the voltage stability) and enhance the economic scheme (total annual cost reduction). In addition, the inclusion of two‐hybrid systems is superior compared with the inclusion of a single‐hybrid system in terms of the considered objective functions, as well as the proposed technique is more efficient for solving the allocation problem of the hybrid system. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
18. Artificial chicken swarm algorithm for multi-objective optimization with deep learning.
- Author
-
Wei, Qianzhou, Huang, Dongru, and Zhang, Yu
- Subjects
MATHEMATICAL optimization ,ALGORITHMS ,PROBLEM solving ,FORAGING behavior ,DEEP learning - Abstract
With the rapid development of computer hardware in the past three decades, various classic algorithms such as neural computing and bionic optimization computing have been widely used in practical problems. This paper extended the new bionic algorithm-flock algorithm proposed in 2014 and obtained a multi-objective flock algorithm to solve the multi-objective problem. This study used aggregate functions to define social ranks, and simulated the foraging behavior of chickens in the process of searching for food in the objective space and found the balance between diversity and convergence when looking for the best Pareto solution. The algorithm took five types of bi-objective functions and four types of three-objective functions as objects and compared it with four more widely used algorithms in multi-objective problems. The results demonstrate that the MOCSO (multi-objective chicken swarm optimization) algorithm shows better results in the optimization of multi-objective problems. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
19. Multi-objective particle swarm optimization with R2 indicator and adaptive method.
- Author
-
Gu, Qinghua, Jiang, Mengke, Jiang, Song, and Chen, Lu
- Subjects
PARTICLE swarm optimization ,PROBLEM solving ,ALGORITHMS ,MATHEMATICAL optimization ,DISTRIBUTION (Probability theory) - Abstract
Multi-objective particle swarm optimization algorithms encounter significant challenges when tackling many-objective optimization problems. This is mainly because of the imbalance between convergence and diversity that occurs when increasing the selection pressure. In this paper, a novel adaptive MOPSO (ANMPSO) algorithm based on R2 contribution and adaptive method is developed to improve the performance of MOPSO. First, a new global best solutions selection mechanism with R2 contribution is introduced to select leaders with better diversity and convergence. Second, to obtain a uniform distribution of particles, an adaptive method is used to guide the flight of particles. Third, a re-initialization strategy is proposed to prevent particles from trapping into local optima. Empirical studies on a large number (64 in total) of problem instances have demonstrated that ANMPSO performs well in terms of inverted generational distance and hyper-volume metrics. Experimental studies on the practical application have also revealed that ANMPSO could effectively solve problems in the real world. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
20. Solving the Dynamic Weapon Target Assignment Problem by an Improved Multiobjective Particle Swarm Optimization Algorithm.
- Author
-
Kong, Lingren, Wang, Jianzhong, and Zhao, Peng
- Subjects
PARTICLE swarm optimization ,MATHEMATICAL optimization ,ASSIGNMENT problems (Programming) ,ALGORITHMS ,PROBLEM solving ,LEARNING strategies - Abstract
Dynamic weapon target assignment (DWTA) is an effective method to solve the multi-stage battlefield fire optimization problem, which can reflect the actual combat scenario better than static weapon target assignment (SWTA). In this paper, a meaningful and effective DWTA model is established, which contains two practical and conflicting objectives, namely, maximizing combat benefits and minimizing weapon costs. Moreover, the model contains limited resource constraints, feasibility constraints and fire transfer constraints. The existence of multi-objective and multi-constraint makes DWTA more complicated. To solve this problem, an improved multiobjective particle swarm optimization algorithm (IMOPSO) is proposed in this paper. Various learning strategies are adopted for the dominated and non-dominated solutions of the algorithm, so that the algorithm can learn and evolve in a targeted manner. In order to solve the problem that the algorithm is easy to fall into local optimum, this paper proposes a search strategy based on simulated binary crossover (SBX) and polynomial mutation (PM), which enables elitist information to be shared among external archive and enhances the exploratory capabilities of IMOPSO. In addition, a dynamic archive maintenance strategy is applied to improve the diversity of non-dominated solutions. Finally, this algorithm is compared with three state-of-the-art multiobjective optimization algorithms, including solving benchmark functions and DWTA model in this article. Experimental results show that IMOPSO has better convergence and distribution than the other three multiobjective optimization algorithms. IMOPSO has obvious advantages in solving multiobjective DWTA problems. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
21. Shared control strategy based on trajectory following and driver intention optimization.
- Author
-
Abi, Lanie, Jin, Dafeng, Xiong, Cenbo, Liu, Xiaohui, and Yu, Liangyao
- Subjects
PROBLEM solving ,INTENTION ,MATHEMATICAL optimization ,BRAKE systems ,ALGORITHMS ,TIRES - Abstract
During the emergency braking process on the split- μ road, the lateral stability of the vehicle is poor, and the intervention of ABS will cause corresponding lateral disturbance. It is difficult for the driver to control the vehicle accurately. Especially at the end of the braking process, due to the withdrawal of ABS, the increase in braking pressure causes the longitudinal force of the tires on both sides to be inconsistent, which reduces the stability of the vehicle at this time. This paper proposed a shared control strategy to solve the related problems. First, a segmented active steering strategy is used in the driver's intention optimization algorithm to optimize the driver's actions in time at the initial stage of the braking process and to optimize the lateral stability of the vehicle by tracking the estimated tire slip angle at the end of the braking process. Then, according to the path envelope based on the driver's path error neglecting feature and the dynamic state of the vehicle, a flexible control transfer mechanism is established. The trajectory following algorithm based on linear quadratic regulator is used to correct the driver's intention optimization algorithm according to the flexible control transfer mechanism. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
22. 基于量子粒子群优化的多波束卫星联合资源分配算法.
- Author
-
高威, 王磊, and 瞿连政
- Subjects
- *
RESOURCE allocation , *MATHEMATICAL optimization , *COMPUTATIONAL complexity , *METAHEURISTIC algorithms , *PARTICLE swarm optimization , *ALGORITHMS , *PROBLEM solving - Abstract
When the meta-heuristic algorithm solves the joint resource allocation problem of multi-beam satellites, the computational complexity increases and the algorithm is difficult to converge due to the time delay constraint and capacity constraint. This paper introduced a penalty mechanism in the objective function, and added a penalty value to the objective function of the invalid solution, so that the optimized solution adaptively satisfied these two constraints. Based on this, this paper proposed a joint resource allocation algorithm based on quantum-behaved particle swarm optimization. Simulation results show that the introduction of the penalty strategy solves the problem of difficulty in handling the delay constraint and capacity constraint when applying the meta-heuristic algorithm. The quantum-behaved particle swarm optimization algorithm with penalty mechanism outperforms the existing joint allocation algorithm in terms of allocation fairness index and total system capacity. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
23. A Hybrid Strategy Improved Whale Optimization Algorithm for Web Service Composition.
- Author
-
Ju, Chuanxiang, Ding, Hangqi, and Hu, Benjia
- Subjects
WEB services ,MATHEMATICAL optimization ,QUALITY of service ,DIFFERENTIAL evolution ,PROBLEM solving ,METAHEURISTIC algorithms ,ALGORITHMS - Abstract
With the rapid growth of the number of web services on the Internet, various service providers provide many similar services with the same function but different quality of service (QoS) attributes. It is a key problem to be solved urgently to select the service composition quickly, meeting the users' QoS requirements from many candidate services. Optimization of web service composition is an NP-hard issue and intelligent optimization algorithms have become the mainstream method to solve this complex problem. This paper proposed a hybrid strategy improved whale optimization algorithm, which is based on the concepts of chaos initialization, nonlinear convergence factor and mutation. By maintaining a balance between exploration and exploitation, the problem of slow or early convergence is overcome to a certain extent. To evaluate its performance more accurately, the proposed algorithm was first tested on a set of standard benchmarks. After, simulations were performed using the real quality of web service dataset. Experimental results show that the proposed algorithm is better than the original version and other meta-heuristic algorithms on average, as well as verifies the feasibility and stability of web service composition optimization. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
24. The effect of different stopping criteria on multi-objective optimization algorithms.
- Author
-
Abu Doush, Iyad, El-Abd, Mohammed, Hammouri, Abdelaziz I., and Bataineh, Mohammad Qasem
- Subjects
MATHEMATICAL optimization ,EVOLUTIONARY algorithms ,PROBLEM solving ,ALGORITHMS - Abstract
Evolutionary multi-objective optimization (EMO) refers to the domain in which an evolutionary algorithm is applied to tackle an optimization problem with multiple objective functions. The literature is rich with many approaches proposed to solve multi-objective problems including the NSGA-II, MOEA/D, and MOPSO algorithms. The proposed approaches include stand-alone as well as hybrid techniques. One critical aspect of any evolutionary algorithm (EA) is the stopping criterion. The selection of a specific stopping criterion can have a considerable effect on the performance and the final solution provided by the EA. A number of different stopping criteria, specifically designed for EMO, have been proposed in the literature. In this paper, the performance of six different EMO algorithms is tested and compared using four stopping criteria. The experiments are performed using the ZDT, DTLZ, CEC2009, Tanaka and Srivana test functions. Experimental results are analyzed to highlight the proper stopping criteria for different algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
25. A primal-dual interior-point method based on various selections of displacement step for symmetric optimization.
- Author
-
Alzalg, Baha
- Subjects
INTERIOR-point methods ,MATHEMATICAL optimization ,ALGORITHMS ,COMPUTER programming ,PROBLEM solving - Abstract
In this paper, we develop a primal-dual central trajectory interior-point algorithm for symmetric programming problems and establish its complexity analysis. The main contribution of the paper is that it uniquely equips the central trajectory algorithm with various selections of the displacement step while solving symmetric programming. To show the efficiency of the proposed algorithm, these selections of calculating the displacement step are compared in numerical examples for second-order cone programming, which is a special case of symmetric programming. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
26. A distribution network reconstruction method with DG and EV based on improved gravitation algorithm.
- Author
-
Sun, Qi, Yu, Yongjin, Li, Debing, and Hu, Xiangqian
- Subjects
GRAVITATION ,ALGORITHMS ,MATHEMATICAL optimization ,ELECTRIC vehicles ,PROBLEM solving - Abstract
In order to solve the problem of distribution network reconstruction with distributed generation (DG) and electric vehicle (EV), a multi-objective distribution network reconstruction model with DG and EV is established in this study. Two rules for opening the loop are proposed to reduce the probability of infeasible solutions. Some measures are proposed to improve traditional gravitational algorithm (GSA). Firstly, the particle swarm algorithm (PSO) is combined to improves the update formula of speed and position. In this way, the global search capability of the GSA is enhanced, which gives the best performance with respect to jump out of the local traps. Furthermore, the processing method for agents that cross the boundary is improved, which increases the diversity of samples while generating elite particles. Hence, this method can improve the efficiency of the algorithm. Finally, the variability of load, DG and EV is considered for dynamic reconstruction. The validity of the optimization algorithm and refactoring strategy are demonstrated by case studies in the paper. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
27. A novel discrete elephant herding optimization for energy-saving flexible job shop scheduling problem with preventive maintenance.
- Author
-
Lu Liu, Qiming Sun, Tianhua Jiang, Guanlong Deng, Qingtao Gong, and Yaping Li
- Subjects
PRODUCTION scheduling ,ALGORITHMS ,ENERGY consumption ,MATHEMATICAL optimization ,PROBLEM solving - Abstract
Recently, energy-saving scheduling issues have attracted more and more attention in the manufacturing field. Meanwhile, in practical production, maintenance planning is viewed as a vital task in the workshop. However, the existing literature about energy-saving scheduling problems rarely consider the effect of preventive maintenance. Therefore, this paper investigates an energy-saving flexible job shop scheduling problem with preventive maintenance. A mathematical model is proposed considering the minimization of total energy consumption. To solve the problem, a novel discrete elephant herding optimization algorithm (NDEHO) is proposed according to the problem's characteristics. To test the NDEHO's performance, the Taguchi design of experiment approach is adopted to get the best combination of parameters in the algorithm. Numerical experiments are conducted based on twenty-four instances, including four benchmark instances and twenty randomly generated instances. Computational data indicate that NDEHO outperforms other compared algorithms for solving the considered problem. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
28. A new human-based metaheuristic algorithm for solving optimization problems on the base of simulation of driving training process.
- Author
-
Dehghani, Mohammad, Trojovská, Eva, and Trojovský, Pavel
- Subjects
METAHEURISTIC algorithms ,PROBLEM solving ,MATHEMATICAL optimization ,LEARNING ,HEURISTIC algorithms ,AUTOMOBILE driving schools ,ALGORITHMS - Abstract
In this paper, a new stochastic optimization algorithm is introduced, called Driving Training-Based Optimization (DTBO), which mimics the human activity of driving training. The fundamental inspiration behind the DTBO design is the learning process to drive in the driving school and the training of the driving instructor. DTBO is mathematically modeled in three phases: (1) training by the driving instructor, (2) patterning of students from instructor skills, and (3) practice. The performance of DTBO in optimization is evaluated on a set of 53 standard objective functions of unimodal, high-dimensional multimodal, fixed-dimensional multimodal, and IEEE CEC2017 test functions types. The optimization results show that DTBO has been able to provide appropriate solutions to optimization problems by maintaining a proper balance between exploration and exploitation. The performance quality of DTBO is compared with the results of 11 well-known algorithms. The simulation results show that DTBO performs better compared to 11 competitor algorithms and is more efficient in optimization applications. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
29. 多策略融合的改进粒子群优化算法.
- Author
-
吴大飞, 杨光永, 樊康生, and 徐天奇
- Subjects
- *
PARTICLE swarm optimization , *MATHEMATICAL optimization , *PROBLEM solving , *ALGORITHMS , *VELOCITY - Abstract
To solve the problems of low convergence accuracy, slow convergence speed and easy to fall into local optimum of traditional particle swarm algorithm, this paper proposed an improved particle swarm algorithm with multistrategy fusion. Firstly, in order to accelerate the convergence speed of free particles, the improved algorithm used a method of updating the position of free particles based on the midperpendicular algorithm. secondly, the improved algorithm designed a strategy of generating exploding particles near the optimal particles to enhance the optimizationseeking accuracy and optimization-seeking speed of the algorithm, and the improved algorithm also designed a particle velocity updating strategy relying only on the global optimal particle position to accommodate the first two strategies. Finally, The algorithm also used the inertia weights and particle position update methods of the simplified particle swarm optimization algorithm based on probabilistic hierarchy. This paper designed a few comparison experiments with other five improved particle swarm algorithms, and the results show that the improved algorithm in this paper has a greater advantage and better performance whether dealing with low-dimensional problems or high-dimensional problems. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
30. Using Variational Quantum Algorithm to Solve the LWE Problem.
- Author
-
Lv, Lihui, Yan, Bao, Wang, Hong, Ma, Zhi, Fei, Yangyang, Meng, Xiangdong, and Duan, Qianheng
- Subjects
PROBLEM solving ,ALGORITHMS ,APPROXIMATION algorithms ,MATHEMATICAL optimization ,DECODING algorithms ,QUBITS - Abstract
The variational quantum algorithm (VQA) is a hybrid classical–quantum algorithm. It can actually run in an intermediate-scale quantum device where the number of available qubits is too limited to perform quantum error correction, so it is one of the most promising quantum algorithms in the noisy intermediate-scale quantum era. In this paper, two ideas for solving the learning with errors problem (LWE) using VQA are proposed. First, after reducing the LWE problem into the bounded distance decoding problem, the quantum approximation optimization algorithm (QAOA) is introduced to improve classical methods. Second, after the LWE problem is reduced into the unique shortest vector problem, the variational quantum eigensolver (VQE) is used to solve it, and the number of qubits required is calculated in detail. Small-scale experiments are carried out for the two LWE variational quantum algorithms, and the experiments show that VQA improves the quality of the classical solutions. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
31. Chaotic slime mould algorithm for economic load dispatch problems.
- Author
-
Singh, Tribhuvan
- Subjects
MYXOMYCETES ,ALGORITHMS ,NONLINEAR functions ,MATHEMATICAL optimization ,PROBLEM solving - Abstract
The economic load dispatch (eld) problem strives to optimize the division of total power demand among the power generators under specified constraints. It is solved by scheduling the generating units of a power plant that meet the load demand with minimum generation cost while satisfying various equality and inequality constraints. Achieving global optimal points is considered difficult due to the involvement of a non-linear objective function and large search domain. The slime mould algorithm (SMA) was recently proposed to solve complex problems. Its convergence rate and capability of capturing optimal global solutions are pretty satisfactory. In this paper, a chaotic number-based slime mould algorithm (CSMA) is suggested for ELD problems the first time. Five test cases with different power demands have been considered to compare the performance of the proposed approach against SMA, salp swarm algorithm (SSA), moth flame optimizer (MFO), grey wolf optimizer (GWO), biogeography based optimizer (BBO), grasshopper optimization algorithm (GOA), multi-verse optimizer (MVO) on 6, 13, 15, 40, and 140 generators ELD problems. The experimental results show that the proposed algorithm reduces the total generation cost significantly. CSMA outperformed SMA in all test cases that justify the effectiveness of chaotic sequences used in the proposed work. Further, three statistical tests have been conducted to justify the competitiveness of the suggested approach. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
32. 神经网络非梯度优化方法研究进展.
- Author
-
盛蕾, 陈希亮, and 康凯
- Subjects
FEEDFORWARD neural networks ,MACHINE learning ,MATHEMATICAL optimization ,PROBLEM solving ,DEEP learning ,ALGORITHMS - Abstract
Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
- Published
- 2022
- Full Text
- View/download PDF
33. A novel and efficient salp swarm algorithm for large-scale QoS-aware service composition selection.
- Author
-
Li, Jun, Ren, Hao, Li, ChenYang, and Chen, Huiling
- Subjects
WEB services ,ALGORITHMS ,METAHEURISTIC algorithms ,SEARCH algorithms ,PROBLEM solving ,COMBINATORIAL optimization ,MATHEMATICAL optimization - Abstract
The rapid growing number of web services has posed new challenges for service composition computing. How to combine services that meet the needs of users in the least amount of time from a huge number of candidate services is a hot topic of research today. As a meta-heuristic algorithm for solving optimization problems, salp swarm algorithm (SSA) has been widely applied to case scenarios in different fields due to its simple structure and high performance. However, QoS-aware service composition is a discrete problem and existing methods are not suitable for it. Therefore, in this paper, we propose an improved SSA integrating chaotic mapping method for QoS service composition selection, named CSSA. Through the randomness and ergodicity of chaos, reducing the possibility of falling into local optimum and strengthening the exploitation capability of the algorithm. In addition, a fuzzy continuous neighborhood search method is used to enhance the local search capability of the algorithm which makes the discrete space of service composition in a way similar to continuous space. Finally, two well-known datasets are used to verify the effectiveness of CSSA compared to three advanced algorithms and original SSA. The test results demonstrate that CSSA has significant advantages and it also has satisfactory performance in large scale scenarios. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
34. A novel hybrid algorithm based on rat swarm optimization and pattern search for parameter extraction of solar photovoltaic models.
- Author
-
Eslami, Mahdiyeh, Akbari, Ehsan, Seyed Sadr, Seyed T., and Ibrahim, Banar F.
- Subjects
PHOTOVOLTAIC power systems ,PARTICLE swarm optimization ,ALGORITHMS ,RATS ,PROBLEM solving ,MATHEMATICAL optimization ,SOLAR energy - Abstract
Parameter extraction of photovoltaic (PV) models based on measured current–voltage data plays an important role in the control, simulation, and optimization of PV systems. Despite the fact that various parameter extraction strategies have been dedicated to solving this problem, they may have certain drawbacks. In this paper, an effective hybrid optimization method based on adaptive rat swarm optimization (ARSO) and pattern search (PS) is presented for effectively and consistently extracting PV parameters. The proposed method employs the global search ability of ARSO and the local search ability of PS. The performance of the new algorithm is investigated using a set of benchmark test functions, and the results are compared with those of the standard RSO and some other methods from the literature. The extraction of parameters from several PV models, such as single‐diode, double‐diode, and PV modules, confirms the performance of the suggested method. Simulation results show that the proposed method surpasses other state‐of‐the‐art procedures in terms of accuracy, reliability, and convergence speed. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
35. 基于改进SA-WOA算法优化热封刀 温度控制系统PID参数的研究.
- Author
-
魏上云, 马靖, 胡晓兵, 李虎, 郭爽, and 章程军
- Subjects
SIMULATED annealing ,TRANSFER functions ,MATHEMATICAL optimization ,PROBLEM solving ,ALGORITHMS - Abstract
Copyright of Journal Of Sichuan University (Natural Sciences Division) / Sichuan Daxue Xuebao-Ziran Kexueban is the property of Editorial Department of Journal of Sichuan University Natural Science Edition and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
- Published
- 2022
- Full Text
- View/download PDF
36. Lamarckian Evolution-Based Differential Evolution Algorithm for Solving KPC Problem.
- Author
-
YANG Xinhua, ZHOU Yufan, SHEN Ailing, LIN Juan, and ZHONG Yiwen
- Subjects
PROBLEM solving ,GREEDY algorithms ,KNAPSACK problems ,ALGORITHMS ,DIFFERENTIAL evolution ,MATHEMATICAL optimization ,BACKPACKS - Abstract
Knapsack problem with a single continuous variable (KPC) is a natural generalization of the standard 0-1 knapsack problem. In KPC, the capacity of the knapsack is not fixed, so it becomes more difficult to solve. In order to overcome the shortcoming that the performance of existing differential evolution (DE) algorithm is not good enough on highdimensional KPC instances, this paper proposes Lamarckian evolution-based DE (LEDE) algorithm to solve KPC. The improvement generated by the greedy repair and optimization operator is inherited to the offspring, which can speed up the convergence speed of DE algorithm and improve the precision of DE algorithm on high-dimensional KPC instances. At the same time, a profit-based greedy optimization strategy is introduced in the greedy repair and optimization operator to optimize the feasible solution generated by greedy repair strategy based on profit weight ratio, so as to help the algorithm jump out of local optimum. The LEDE algorithm is experimentally analyzed on 40 KPC instances. The experimental results show that the Lamarckian evolution and the profit-based greedy optimization strategy can improve the exploitation ability of LEDE algorithm, and LEDE algorithm is better than other intelligent optimization algorithms in terms of obtaining the best solution and the mean solution. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
37. A novel hybrid immune clonal selection algorithm for the constrained corridor allocation problem.
- Author
-
Liu, Junqi, Zhang, Zeqiang, Chen, Feng, Liu, Silu, and Zhu, Lixia
- Subjects
ALGORITHMS ,MATHEMATICAL optimization ,PROBLEM solving - Abstract
Aiming at the lack of relevant research on relationship constraints between facilities in the corridor allocation problem (CAP). In this paper, fixed position constraints and ordering constraints are considered in CAP, and the logistics cost is minimized. Considering that the existing search technology is complicated and time-consuming in dealing with such constrained CAP (cCAP), and immune clone selection algorithm with variable neighborhood operation (ICSAVNS) is provided for solving this problem. Two approaches to initial solution generation are designed to improve the quality of the initial population. A variable neighborhood search operator is embedded to improve the accuracy of the local search. A threshold is set in the mutation operation of the ICSAVNS to achieve population expansion better. A double index of sequences consisting of affinity values and constrained facility index values is used to select and reselect, achieving population compression in the clonal selection part. Finally, by exactly solving the model, the rationality of the model is verified. The hybrid clone selection algorithm is used to solve the cCAP and cbCAP benchmark instances of different sizes, and compared with the state-of-the-art optimization algorithms. The results show that the proposed algorithm exhibits better performance. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
38. Directional mutation and crossover for immature performance of whale algorithm with application to engineering optimization.
- Author
-
Ailiang Qi, Dong Zhao, Fanhua Yu, Heidari, Ali Asghar, Huiling Chen, and Lei Xiao
- Subjects
DIFFERENTIAL evolution ,SWARM intelligence ,MATHEMATICAL optimization ,ENGINEERING models ,ALGORITHMS ,PROBLEM solving ,ENGINEERING - Abstract
In recent years, a range of novel and pseudonovel optimization algorithms has been proposed for solving engineering problems. Swarm intelligence optimization algorithms (SIAs) have become popular methods, and the whale optimization algorithm (WOA) is one of the highly discussed SIAs. However, regardless of novelty concerns about this method, the basic WOA is a weak method compared to top differential evolutions and particle swarm variants, and it suffers from the problem of poor initial population quality and slow convergence speed. Accordingly, in this paper, to increase the diversity of WOA versions and enhance the performance of WOA, a new WOA variant, named LXMWOA, is proposed, and based on the L'evy initialization strategy, the directional crossover mechanism, and the directional mutation mechanism. Specifically, the introduction of the L'evy initialization strategy allows initial populations to be dynamically distributed in the search space and enhances the global search capability of the WOA. Meanwhile, the directional crossover mechanism and the directional mutation mechanism can improve the local exploitation capability of the WOA. To evaluate its performance, using a series of functions and three models of engineering optimization problems, the LXMWOA was compared with a broad array of competitive optimizers. The experimental results demonstrate that the LXMWOA is significantly superior to its exploration and exploitation capability peers. Therefore, the proposed LXMWOA has great potential to be used for solving engineering problems. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
39. STOCHASTIC MULTILEVEL COMPOSITION OPTIMIZATION ALGORITHMS WITH LEVEL-INDEPENDENT CONVERGENCE RATES.
- Author
-
BALASUBRAMANIAN, KRISHNAKUMAR, GHADIMI, SAEED, and NGUYEN, ANTHONY
- Subjects
MATHEMATICAL optimization ,PROBLEM solving ,ALGORITHMS ,MOVING average process - Abstract
In this paper, we study smooth stochastic multilevel composition optimization problems, where the objective function is a nested composition of T functions. We assume access to noisy evaluations of the functions and their gradients, through a stochastic first-order oracle. For solving this class of problems, we propose two algorithms using moving-average stochastic estimates, and analyze their convergence to an e-stationary point of the problem. We show that the first algorithm, which is a generalization of [S. Ghadimi, A. Ruszczynski, and M. Wang, SIAM J. Optim., 30 (2020), pp. 960-979] to the T level case, can achieve a sample complexity of O
T (1/ε6 ) by using minibatches of samples in each iteration, where OT hides constants that depend on T. By modifying this algorithm using linearized stochastic estimates of the function values, we improve the sample complexity to OT (1/ε4 ). This modification not only removes the requirement of having a minibatch of samples in each iteration, but also makes the algorithm parameter-free and easy to implement. To the best of our knowledge, this is the first time that such an online algorithm designed for the (un)constrained multilevel setting obtains the same sample complexity of the smooth single-level setting, under standard assumptions (unbiasedness and boundedness of the second moments) on the stochastic first-order oracle. [ABSTRACT FROM AUTHOR]- Published
- 2022
- Full Text
- View/download PDF
40. IRKO: An Improved Runge-Kutta Optimization Algorithm for Global Optimization Problems.
- Author
-
Devi, R. Manjula, Premkumar, M., Jangir, Pradeep, Elkotb, Mohamed Abdelghany, Elavarasan, Rajvikram Madurai, and Nisar, Kottakkaran Sooppy
- Subjects
GLOBAL optimization ,MATHEMATICAL optimization ,ALGORITHMS ,CONSTRAINED optimization ,PROBLEM solving ,HEURISTIC algorithms - Abstract
Optimization is a key technique for maximizing or minimizing functions and achieving optimal cost, gains, energy, mass, and so on. In order to solve optimization problems, metaheuristic algorithms are essential. Most of these techniques are influenced by collective knowledge and natural foraging. There is no such thing as the best or worst algorithm; instead, there are more effective algorithms for certain problems. Therefore, in this paper, a new improved variant of a recently proposed metaphorless Runge-Kutta Optimization (RKO) algorithm, called Improved Runge-Kutta Optimization (IRKO) algorithm, is suggested for solving optimization problems. The IRKO is formulated using the basic RKO and local escaping operator to enhance the diversification and intensification capability of the basic RKO version. The performance of the proposed IRKO algorithm is validated on 23 standard benchmark functions and three engineering constrained optimization problems. The outcomes of IRKO are compared with seven state-of-the-art algorithms, including the basic RKO algorithm. Compared to other algorithms, the recommended IRKO algorithm is superior in discovering the optimal results for all selected optimization problems. The runtime of IRKO is less than 0.5 s for most of the 23 benchmark problems and stands first for most of the selected problems, including real-world optimization problems. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
41. A hybrid OBL-based firefly algorithm with symbiotic organisms search algorithm for solving continuous optimization problems.
- Author
-
Goldanloo, Mina Javanmard and Gharehchopogh, Farhad Soleimanian
- Subjects
MATHEMATICAL functions ,SEARCH algorithms ,ALGORITHMS ,MATHEMATICAL optimization ,METAHEURISTIC algorithms ,PROBLEM solving - Abstract
The metaheuristic optimization algorithms are relatively new optimization algorithms introduced to solve optimization problems in recent years. For example, the firefly algorithm (FA) is one of the metaheuristic algorithms inspired by the fireflies' flashing behavior. However, its weakness in terms of exploration and early convergence has been pointed out. In this paper, two approaches were proposed to improve the FA. In the first proposed approach, a new improved opposition-based learning FA (IOFA) method was presented to accelerate the convergence and improve the FA's exploration capability. In the second proposed approach, a symbiotic organisms search (SOS) algorithm improved the exploration and exploitation of the first approach; two new parameters set these two goals, and the second approach was named IOFASOS. The purpose of the second method is that in the process of the SOS algorithm, the whole population is effective in the IOFA method to find solutions in the early stages of implementation, and with each iteration, fewer solutions are affected in the population. The experiments on 24 standard benchmark functions were conducted, and the first proposed approach showed a better performance in the small and medium dimensions and exhibited a relatively moderate performance in the higher dimensions. In contrast, the second proposed approach was better in increasing dimensions. In general, the empirical results showed that the two new approaches outperform other algorithms in most mathematical benchmarking functions. Thus, The IOFASOS model has more efficient solutions. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
42. Smart surgical control under RCM constraint using bio-inspired network.
- Author
-
Khan, Ameer Tamoor and Li, Shuai
- Subjects
- *
OPERATIVE surgery , *SURGICAL robots , *PROBLEM solving , *ALGORITHMS , *INTELLIGENT control systems , *MATHEMATICAL optimization - Abstract
In this paper, we propose a control framework for intelligent surgical robots under the Remote Center of Motion (RCM). The goal of a surgical robot is to assist surgeons in performing complex surgeries. RCM constraint implies that the surgical tip attached to the end-effector of the surgical robot does not slide away from the point of the incision while performing surgery. Implementation of a control algorithm to comply with RCM constraints is a complicated task because of the nonlinear model of the surgical robots and stringent conditions of accuracy imposed by the patient's safety. This paper proposes an optimization-driven approach to perform the surgical maneuver under RCM constraints. We then applied a bio-inspired optimization algorithm to solve the problem efficiently. For testing the performance of ZNNBAS, we used MATLAB to simulate a surgical procedure. A 7-DOF surgical robot (KUKA LBR IIWA 7) was used as a test bench for running the simulations. The simulation results show that the ZNNBAS is comparable with BAS, PSO, and GA and efficiently and robustly performed the task commanded maneuvers while enforcing the RCM constraints. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
43. MRL-JAYA: A FUSION OF MRLDE AND JAYA ALGORITHM.
- Author
-
Kumar, Pravesh and Sharma, Amit
- Subjects
ALGORITHMS ,BENCHMARK problems (Computer science) ,LOCALIZATION (Mathematics) ,DIFFERENTIAL evolution ,PROBLEM solving ,MATHEMATICAL optimization - Abstract
Jaya algorithm is a newly developed metahueristics algorithm to solve optimization problems. In this paper we have proposed a new variant named MRL-Jaya which is a fusion of Jaya algorithms with modified random localization based DE (MRLDE) algorithm. MRLJaya connects two algorithms by a systematic approach to utilize the advantage of both in a single variant. MRL-Jaya has tested on 13 traditional and 6 shifted benchmark problems taken from literature. In last the result and comparison shows the efficiency of proposed variant. [ABSTRACT FROM AUTHOR]
- Published
- 2022
44. Load balancing in cloud computing environment using the Grey wolf optimization algorithm based on the reliability: performance evaluation.
- Author
-
Sefati, SeyedSalar, Mousavinasab, Maryamsadat, and Zareh Farkhady, Roya
- Subjects
MATHEMATICAL optimization ,CLOUD computing ,LOAD balancing (Computer networks) ,INFORMATION technology ,METAHEURISTIC algorithms ,PROBLEM solving ,ALGORITHMS - Abstract
The introduction of cloud computing has brought about significant developments in information technology. Users can benefit from the multitude of cloud technology services only by connecting to the internet. In cloud computing, load balancing is the fundamental issue that has challenged experts in this research area. Load balancing helps increase user satisfaction and enhance systems' productivity through efficient and fair work assignments between computing resources. Besides, maintaining a load balancing among resources would be difficult because the resources are usually distributed in a heterogeneous way. Many load-balancing methods try to solve this problem by the metaheuristics algorithm, and each of them attempted to enhance the operation and efficiency of systems. In this paper, Grey wolf optimization (GWO) algorithm has been used based on the resource reliability capability to maintain proper load balancing. In this method, first, the GWO algorithm tries to find the unemployed or busy nodes and, after discovering this node, try to calculate each node's threshold and fitness function. The results of simulation in CloudSim showed that the costs and response time in the proposed method are less than the other methods, and the obtained solutions are ideal. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
45. A long-step feasible predictor-corrector interior-point algorithm for symmetric cone optimization.
- Author
-
Asadi, S., Mansouri, H., Darvay, Zs., Lesaja, G., and Zangiabadi, M.
- Subjects
ALGORITHMS ,PROBLEM solving ,MATHEMATICAL optimization ,ITERATED integrals ,ITERATIVE methods (Mathematics) - Abstract
In this paper, we present a feasible predictor-corrector interior-point method for symmetric cone optimization problem in the large neighbourhood of the central path. The method is generalization of Ai-Zhang's predictor-corrector algorithm to the symmetric cone optimization problem. Starting with a feasible point in given large neighbourhood of the central path, the algorithm still terminates in at most iterations. This matches the best known iteration bound that is usually achieved by short-step methods, thereby, closing the complexity gap between long- and short-step interior-point methods for symmetric cone optimization. The preliminary numerical results on a selected set of NETLIB problems show advantage of the method in comparison with the version of the algorithm that is not based on the predictor-corrector scheme. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
46. An adaptive surrogate-assisted particle swarm optimization for expensive problems.
- Author
-
Li, Xuemei and Li, Shaojun
- Subjects
PARTICLE swarm optimization ,EVOLUTIONARY algorithms ,ALGORITHMS ,PROBLEM solving ,MATHEMATICAL optimization ,RADIAL basis functions - Abstract
To solve engineering problems with evolutionary algorithms, many expensive function evaluations (FEs) are required. To alleviate this difficulty, surrogate-assisted evolutionary algorithms (SAEAs) have attracted increasingly more attention in both academia and industry. Most existing SAEAs either waste computational resources due to the lack of accuracy of the surrogate model or easily fall into the local optimum as the dimension increases. To address these problems, this paper proposes an adaptive surrogate-assisted particle swarm optimization algorithm. In the proposed algorithm, a surrogate model is adaptively selected from a single model and an ensemble model by comparing the best existing solution and the latest obtained solution. Additionally, a model output criterion based on the standard deviation is suggested to improve the stability and generalization ability of the ensemble model. To verify the performance of the proposed algorithm, 10 benchmark functions with different modalities from 10 to 50 dimensions are tested, and the results are compared with those of five state-of-the-art SAEAs. The experimental results indicate that the proposed algorithm performs well for most benchmark functions within a limited number of FEs. Moreover, the performance of the proposed algorithm in solving engineering problems is verified by applying the algorithm to the PX oxidation process. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
47. Design and applications of an advanced hybrid meta-heuristic algorithm for optimization problems.
- Author
-
Parouha, Raghav Prasad and Verma, Pooja
- Subjects
MATHEMATICAL optimization ,PROBLEM solving ,ALGORITHMS ,METAHEURISTIC algorithms ,STATISTICS ,SOCIAL problems ,PARTICLE swarm optimization - Abstract
This paper designed an advanced hybrid algorithm (haDEPSO) to solve the optimization problems, based on multi-population approach. It integrated with suggested advanced DE (aDE) and PSO (aPSO). Where in aDE a novel mutation strategy and crossover probability along with the slightly changed selection scheme are introduced, to avoid premature convergence. And aPSO consists of the novel gradually varying inertia weight and acceleration coefficient parameters, to escape stagnation. So, convergence characteristic of aDE and aPSO provides different approximation to the solution space. Thus, haDEPSO achieve better solutions due to integrating merits of aDE and aPSO. Also in haDEPSO individual population is merged with other in a pre-defined manner, to balance between global and local search capability. The algorithms efficiency is verified through 23 basic, 30 CEC 2014 and 30 CEC 2017 test suite and comparing the results with various state-of-the-art algorithms. The numerical, statistical and graphical analysis shows the effectiveness of these algorithms in terms of accuracy and convergence speed. Finally, three real world problems have been solved to confirm problem-solving capability of proposed algorithms. All these analyses confirm the superiority of the proposed algorithms over the compared algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
48. Adaptive multi-objective particle swarm optimization using three-stage strategy with decomposition.
- Author
-
Huang, Weimin and Zhang, Wei
- Subjects
PARTICLE swarm optimization ,PROBLEM solving ,MATHEMATICAL optimization ,ALGORITHMS - Abstract
Balancing the convergence and the diversity is one of the crucial researches in solving multi-objective problems (MOPs). However, the optimization algorithms are inefficient and require massive iterations. The convergence accuracy and the distribution of the obtained non-dominated solutions are defective in solving complex MOPs. To solve these problems, a novel adaptive multi-objective particle swarm optimization using a three-stage strategy (tssAMOPSO) is proposed in this paper. Firstly, an adaptive flight parameter adjustment is proposed to manage the states of the algorithm, switching between the global exploration and the local exploitation. Then, the three-stage strategy, including adaptive optimization, decomposition, and Gaussian attenuation mutation, is conducted by population in each iteration. The three-stage strategy remarkably promotes the diversity and efficiency of the optimization process. Furthermore, the convergence analysis of three-stage strategy is provided in detail. Finally, particles are equipped with memory interval to improve the reliability of personal best selection. In the maintenance of external archive, the proposed fusion index can enhance the quality of non-dominated solutions directly. A series of benchmark instances, ZDT and DTLZ test suits, are used to verify the performance of tssAMOPSO. Several classical and state-of-the-art algorithms are employed for experimental comparisons. Experimental results show that tssAMOPSO outperforms the other algorithms and achieves admirable comprehensive performance. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
49. Adaptive opposition slime mould algorithm.
- Author
-
Naik, Manoj Kumar, Panda, Rutuparna, and Abraham, Ajith
- Subjects
MYXOMYCETES ,ALGORITHMS ,PROBLEM solving ,SEARCH engines ,MATHEMATICAL optimization - Abstract
Recently, the slime mould algorithm (SMA) has become popular in function optimization, because it effectively uses exploration and exploitation to reach an optimal solution or near-optimal solution. However, the SMA uses two random search agents from the whole population to decide the future displacement and direction from the best search agents, which limits its exploitation and exploration. To solve this problem, we investigate an adaptive approach to decide whether opposition-based learning (OBL) will be used or not. Sometimes, the OBL is used to further increase the exploration. In addition, it maximizes the exploitation by replacing one random search agent with the best one in the position updating. The suggested technique is called an adaptive opposition slime mould algorithm (AOSMA). The qualitative and quantitative analysis of AOSMA is reported using 29 test functions that consisting of 23 classical test functions and 6 recently used composition functions from the IEEE CEC 2014 test suite. The results are compared with state-of-the-art optimization methods. Results presented in this paper show that AOSMA's performance is better than other optimization algorithms. The AOSMA is evaluated using Wilcoxon's rank-sum test. It also ranked one in Friedman's mean rank test. The proposed AOSMA algorithm would be useful for function optimization to solve real-world engineering problems. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
50. Artificial bee colony algorithm with directed scout.
- Author
-
Saleh, Radhwan A. A. and Akay, Rustu
- Subjects
BEES algorithm ,BEE colonies ,PROBLEM solving ,MATHEMATICAL optimization ,ALGORITHMS ,GLOBAL optimization ,HONEYBEES - Abstract
As a relatively new model, the artificial bee colony algorithm (ABC) has shown impressive success in solving optimization problems. Nevertheless, its efficiency is still not satisfactory for some complex optimization problems. This paper has modified ABC and its other recent variants to improve its performance by modifying the scout phase. This modification enhances its exploitation ability by intensifying the regions in the search space, which probably includes reasonable solutions. The experiments were performed on CEC2014, and CEC2015 benchmark suites, real-life problems. And the proposed modification was applied to basic ABC, Gbest-Guided ABC, Depth First Search ABC, and Teaching–Learning Based ABC, and they were compared with their modified counterparts. The results have shown that our modification can successfully increase the performance of the original versions. Moreover, the proposed modified algorithm was compared with the state-of-the-art optimization algorithms, and it produced competitive results. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.