359 results
Search Results
2. 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
3. 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
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. 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
6. 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
7. 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
8. 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
9. 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
10. 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
11. 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
12. 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
13. 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
14. 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
15. 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
16. 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
17. 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
18. 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
19. 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
20. 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
21. 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
22. 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
23. A new optimization algorithm to solve multi-objective problems.
- Author
-
Sharifi, Mohammad Reza, Akbarifard, Saeid, Qaderi, Kourosh, and Madadi, Mohamad Reza
- Subjects
PROBLEM solving ,EVOLUTIONARY algorithms ,MATHEMATICAL optimization ,BENCHMARK problems (Computer science) ,ALGORITHMS ,MOTHS - Abstract
Simultaneous optimization of several competing objectives requires increasing the capability of optimization algorithms. This paper proposes the multi-objective moth swarm algorithm, for the first time, to solve various multi-objective problems. In the proposed algorithm, a new definition for pathfinder moths and moonlight was proposed to enhance the synchronization capability as well as to maintain a good spread of non-dominated solutions. In addition, the crowding-distance mechanism was employed to select the most efficient solutions within the population. This mechanism indicates the distribution of non-dominated solutions around a particular non-dominated solution. Accordingly, a set of non-dominated solutions obtained by the proposed multi-objective algorithm is kept in an archive to be used later for improving its exploratory capability. The capability of the proposed MOMSA was investigated by a set of multi-objective benchmark problems having 7 to 30 dimensions. The results were compared with three well-known meta-heuristics of multi-objective evolutionary algorithm based on decomposition (MOEA/D), Pareto envelope-based selection algorithm II (PESA-II), and multi-objective ant lion optimizer (MOALO). Four metrics of generational distance (GD), spacing (S), spread (Δ), and maximum spread (MS) were employed for comparison purposes. The qualitative and quantitative results indicated the superior performance and the higher capability of the proposed MOMSA algorithm over the other algorithms. The MOMSA algorithm with the average values of CPU time = 2771 s, GD = 0.138, S = 0.063, Δ = 1.053, and MS = 0.878 proved to be a robust and reliable model for multi-objective optimization. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
24. Discrete Semantics-Guided Asymmetric Hashing for Large-Scale Multimedia Retrieval.
- Author
-
Long, Jun, Sun, Longzhi, Hua, Liujie, and Yang, Zhan
- Subjects
PROBLEM solving ,COMPUTER programming education ,MATHEMATICAL optimization ,ALGORITHMS - Abstract
Cross-modal hashing technology is a key technology for real-time retrieval of large-scale multimedia data in real-world applications. Although the existing cross-modal hashing methods have achieved impressive accomplishment, there are still some limitations: (1) some cross-modal hashing methods do not make full consider the rich semantic information and noise information in labels, resulting in a large semantic gap, and (2) some cross-modal hashing methods adopt the relaxation-based or discrete cyclic coordinate descent algorithm to solve the discrete constraint problem, resulting in a large quantization error or time consumption. Therefore, in order to solve these limitations, in this paper, we propose a novel method, named Discrete Semantics-Guided Asymmetric Hashing (DSAH). Specifically, our proposed DSAH leverages both label information and similarity matrix to enhance the semantic information of the learned hash codes, and the ℓ 2 , 1 norm is used to increase the sparsity of matrix to solve the problem of the inevitable noise and subjective factors in labels. Meanwhile, an asymmetric hash learning scheme is proposed to efficiently perform hash learning. In addition, a discrete optimization algorithm is proposed to fast solve the hash code directly and discretely. During the optimization process, the hash code learning and the hash function learning interact, i.e., the learned hash codes can guide the learning process of the hash function and the hash function can also guide the hash code generation simultaneously. Extensive experiments performed on two benchmark datasets highlight the superiority of DSAH over several state-of-the-art methods. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
25. Research on hybrid modified pathfinder algorithm for optimal reactive power dispatch.
- Author
-
SURESH, V. and KUMAR, S. SENTHIL
- Subjects
REACTIVE power ,ALGORITHMS ,CAPACITOR banks ,DIFFERENTIAL evolution ,PROBLEM solving ,MATHEMATICAL optimization - Abstract
Hybridization of meta-heuristic algorithms plays a major role in the optimization problem. In this paper, a new hybrid meta-heuristic algorithm called hybrid pathfinder algorithm (HPFA) is proposed to solve the optimal reactive power dispatch (ORPD) problem. The superiority of the Differential Evolution (DE) algorithm is the fast convergence speed, a mutation operator in the DE algorithm incorporates into the pathfinder algorithm (PFA). The main objective of this research is to minimize the real power losses and subject to equality and inequality constraints. The HPFA is used to find optimal control variables such as generator voltage magnitude, transformer tap settings and capacitor banks. The proposed HPFA is implemented through several simulation cases on the IEEE 118-bus system and IEEE 300-bus power system. Results show the superiority of the proposed algorithm with good quality of optimal solutions over existing optimization techniques, and hence confirm its potential to solve the ORPD problem. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
26. New hybrid shrinking projection algorithm for common fixed points of a family of countable quasi-Bregman strictly pseudocontractive mappings with equilibrium and variational inequality and optimization problems.
- Author
-
Xu, Yongchun and Su, Yongfu
- Subjects
ALGORITHMS ,FIXED point theory ,PROBLEM solving ,MATHEMATICAL mappings ,VARIATIONAL inequalities (Mathematics) ,MATHEMATICAL optimization - Abstract
The purpose of this paper is to introduce and consider a new hybrid shrinking projection algorithm for finding a common element of the set of solutions of a system of equilibrium problems, the set of solutions of a system of variational inequality problems, the set of solutions of a system of optimization problems, the common fixed point set of a uniformly closed family of countable quasi-Bregman strictly pseudocontractive mappings in reflexive Banach spaces. Strong convergence theorems have been proved under the appropriate conditions. The main innovative points in this paper are as follows: (1) the notion of the uniformly closed family of countable quasi-Bregman strictly pseudocontractive mappings is presented and the useful conclusions are given; (2) the relative examples of the uniformly closed family of countable quasi-Bregman strictly pseudocontractive mappings are given in classical Banach spaces $l^{2}$ and $L^{2}$; (3) the hybrid shrinking projection method presented in this paper modified some mistakes in the recent result of Ugwunnadi et al. (Fixed Point Theory Appl. 2014:231, 2014). These new results improve and extend the previously known ones in the literature. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
27. Path optimization of taxi carpooling.
- Author
-
Ma, Changxi, He, Ruichun, and Zhang, Wei
- Subjects
CAR sharing ,PASSENGERS ,PROBLEM solving ,GENETIC algorithms ,MATHEMATICAL optimization ,ATTITUDE (Psychology) - Abstract
The problem that passengers are hard to take taxis while empty driving rate is high widely exists under the traditional taxi operation mode. The implementation of taxi carpooling mode can alleviate the problem in a certain extent. The objective of this study is to optimize the taxi carpooling path. Firstly, the taxi carpooling path optimization model with single objective and its extended model with multiple objectives are built respectively. Then, the single objective path optimization model of taxi carpooling is solved based on the improved single objective genetic algorithm, and the multiple-objective path optimization model of taxi carpooling is solved based on the improved multiple-objective genetic algorithm. Finally, a case study is carried out based on a road network with 24 nodes. The case study results show the path optimization models and algorithms of taxi carpooling proposed in the paper can quickly get the taxi carpooling path, and can increase the income of taxi driver while reduce the cost for passengers. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
28. On the Theoretical Analysis of the Plant Propagation Algorithms.
- Author
-
Sulaiman, Muhammad, Salhi, Abdellah, Khan, Asfandyar, Muhammad, Shakoor, and Khan, Wali
- Subjects
MATHEMATICAL optimization ,ALGORITHMS ,HEURISTIC algorithms ,PROBLEM solving ,STOCHASTIC convergence - Abstract
Plant Propagation Algorithms (PPA) are powerful and flexible solvers for optimisation problems. They are nature-inspired heuristics which can be applied to any optimisation/search problem. There is a growing body of research, mainly experimental, on PPA in the literature. Little, however, has been done on the theoretical front. Given the prominence this algorithm is gaining in terms of performance on benchmark problems as well as practical ones, some theoretical insight into its convergence is needed. The current paper is aimed at fulfilling this by providing a sketch for a global convergence analysis. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
29. A Novel Three-Dimensional Path Planning Method for Fixed-Wing UAV Using Improved Particle Swarm Optimization Algorithm.
- Author
-
Huang, Chen
- Subjects
PARTICLE swarm optimization ,MATHEMATICAL optimization ,ALGORITHMS ,PROBLEM solving ,DRONE aircraft - Abstract
This paper proposed an improved particle swarm optimization (PSO) algorithm to solve the three-dimensional problem of path planning for the fixed-wing unmanned aerial vehicle (UAV) in the complex environment. The improved PSO algorithm (called DCA ∗ PSO) based dynamic divide-and-conquer (DC) strategy and modified A ∗ algorithm is designed to reach higher precision for the optimal flight path. In the proposed method, the entire path is divided into multiple segments, and these segments are evolved in parallel by using DC strategy, which can convert the complex high-dimensional problem into several parallel low-dimensional problems. In addition, A ∗ algorithm is adopted to generated an optimal path from the particle swarm, which can avoid premature convergence and enhance global search ability. When DCA ∗ PSO is used to solve the large-scale path planning problem, an adaptive dynamic strategy of the segment selection is further developed to complete an effective variable grouping according to the cost. To verify the optimization performance of DCA ∗ PSO algorithm, the real terrain data is utilized to test the performance for the route planning. The experiment results show that the proposed DCA ∗ PSO algorithm can effectively obtain better optimization results in solving the path planning problem of UAV, and it takes on better optimization ability and stability. In addition, DCA ∗ PSO algorithm is proved to search a feasible route in the complex environment with a large number of the waypoints by the experiment. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
30. Joint Optimization Algorithm Based on DCA for Three-tier Caching in Heterogeneous Cellular Networks.
- Author
-
Jun Zhang and Qi Zhu
- Subjects
MATHEMATICAL optimization ,ALGORITHMS ,PROBLEM solving ,POISSON processes ,POINT processes ,CACHE memory ,FEMTOCELLS ,RANDOM graphs - Abstract
In this paper, we derive the expression of the cache hitting probability with random caching policy and propose the joint optimization algorithm based on difference of convex algorithm (DCA) in the three-tier caching heterogeneous cellular network assisted by macro base stations, helpers and users. Under the constraint of the caching capacity of caching devices, we establish the optimization problem to maximize the cache hitting probability of the network. In order to solve this problem, a convex function is introduced to convert the nonconvex problem to a difference of convex (DC) problem and then we utilize DCA to obtain the optimal caching probability of macro base stations, helpers and users for each content respectively. Simulation results show that when the density of caching devices is relatively low, popular contents should be cached to achieve a good performance. However, when the density of caching devices is relatively high, each content ought to be cached evenly. The algorithm proposed in this paper can achieve the higher cache hitting probability with the same density. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
31. Set Theoretical Variants of Optimization Algorithms for System Reliability-based Design of Truss Structures.
- Author
-
Kaveh, Ali, Hamedani, Kiarash Biabani, and Kamalinejad, Mohammad
- Subjects
MATHEMATICAL optimization ,TRUSSES ,PROBLEM solving ,ALGORITHMS ,RELIABILITY in engineering ,STRUCTURAL reliability ,FAILURE mode & effects analysis - Abstract
In this paper, recently developed set theoretical variants of the teaching-learning-based optimization (TLBO) algorithm and the shuffled shepherd optimization algorithm (SSOA) are employed for system reliability-based design optimization (SRBDO) of truss structures. The set theoretical variants are designed based on a simple framework in which the population of candidate solutions is divided into some number of smaller well-arranged sub-populations. In addition, the framework is applied to the Jaya algorithm, leading to a set-theoretical variant of the Jaya algorithm. So far, most of the reliability-based design optimization studies have focused on the reliability of single structural members. This is due to the fact that the optimization problems with system reliability-based constraints are computationally expensive to solve. This is especially the case of statically redundant structures, where the number of failure modes is so high that it is impractical to identify all of them. System-level reliability analysis of truss structures is carried out by the branch and bound method by which the stochastically dominant failure paths are identified within a reasonable time. At last, three numerical examples, including size optimization of truss structures, are presented to illustrate the effectiveness of the proposed SRBDO approach. The results indicate the efficiency and applicability of the set theoretical optimization algorithms to solve the SRBDO problems of truss structures. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
32. A bi-stage surrogate-assisted hybrid algorithm for expensive optimization problems.
- Author
-
Ren, Zhihai, Sun, Chaoli, Tan, Ying, Zhang, Guochen, and Qin, Shufen
- Subjects
PROBLEM solving ,MATHEMATICAL optimization ,BENCHMARK problems (Computer science) ,TABU search algorithm ,HEURISTIC algorithms ,ALGORITHMS ,METAHEURISTIC algorithms - Abstract
Surrogate-assisted meta-heuristic algorithms have shown good performance to solve the computationally expensive problems within a limited computational resource. Compared to the method that only one surrogate model is utilized, the surrogate ensembles have shown more efficiency to get a good optimal solution. In this paper, we propose a bi-stage surrogate-assisted hybrid algorithm to solve the expensive optimization problems. The framework of the proposed method is composed of two stages. In the first stage, a number of global searches will be conducted in sequence to explore different sub-spaces of the decision space, and the solution with the maximum uncertainty in the final generation of each global search will be evaluated using the exact expensive problems to improve the accuracy of the approximation on corresponding sub-space. In the second stage, the local search is added to exploit the sub-space, where the best position found so far locates, to find a better solution for real expensive evaluation. Furthermore, the local and global searches in the second stage take turns to be conducted to balance the trade-off of the exploration and exploitation. Two different meta-heuristic algorithms are, respectively, utilized for the global and local search. To evaluate the performance of our proposed method, we conduct the experiments on seven benchmark problems, the Lennard–Jones potential problem and a constrained test problem, respectively, and compare with five state-of-the-art methods proposed for solving expensive problems. The experimental results show that our proposed method can obtain better results, especially on high-dimensional problems. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
33. A PROXY APPROACH TO MULTI-ATTRIBUTE DECISION MAKING.
- Author
-
Oppenheimer, Kenneth R.
- Subjects
DECISION making ,DECISION theory ,SEQUENTIAL analysis ,MATHEMATICAL optimization ,APPROXIMATION theory ,MATHEMATICAL models ,PRIVATE schools ,ALGORITHMS ,PROBLEM solving ,CURRICULUM - Abstract
This paper combines two rival preference modeling techniques in a new approach to multi-attribute decision making. Currently existing multi-attribute procedures use either global or local preference modeling. In the global modeling technique, a single preference function is constructed in the large; its maximum is the optimal alternative. In the local procedure, sequential approximations of the preference function are constructed in the small. Each approximation generates a trial solution. Under suitable conditions, each trial solution is preferred to its predecessor, so the trial sequence eventually reaches the optimum. Each technique has advantages and disadvantages; this paper combines the desirable features of both techniques in a new improved method. This new method, called the proxy approach, uses the advantages of one technique to overcome the disadvantages of the other. This paper first develops the theoretical aspects of the proxy approach and then compares it to existing procedures. Finally, the proxy algorithm is applied to a curriculum planning problem and numerous insights are gained. [ABSTRACT FROM AUTHOR]
- Published
- 1978
- Full Text
- View/download PDF
34. A DYNAMIC PROGRAMMING ALGORITHM FOR CHECK SORTING.
- Author
-
Murphy, Frederic H. and Stohr, Edward A.
- Subjects
BANKING industry ,BANK management ,SORTING devices ,BANK deposits ,DYNAMIC programming ,MATHEMATICAL programming ,MATHEMATICAL optimization ,SHIPMENT of goods ,CHECKS ,ALGORITHMS ,PROBLEM solving - Abstract
The motivation for this paper is a problem faced by banks which process large volumes of deposited checks. The checks must be separated by bank number before shipment to the Federal Reserve or other banks. The sorting is usually accomplished using a reader-sorter which reads the magnetic ink characters on the checks and separates them into different "pockets." This paper characterizes the optimal sorting strategy and describes an efficient procedure for finding the optimal solution for problems of the size generally found in practice. The algorithm is based on a two state dynamic programming recursion in which characterization theorems are used to drastically reduce the size of the state space and in which the storage requirements are minimal. The paper includes an analysis of computational experience and describes how the algorithm can be used in a real time environment with deadlines. [ABSTRACT FROM AUTHOR]
- Published
- 1977
- Full Text
- View/download PDF
35. Bio-Inspired Algorithms and Its Applications for Optimization in Fuzzy Clustering.
- Author
-
Valdez, Fevrier, Castillo, Oscar, and Melin, Patricia
- Subjects
MATHEMATICAL optimization ,BIOLOGICALLY inspired computing ,PROBLEM solving ,METAHEURISTIC algorithms ,FUZZY algorithms ,PHENOMENOLOGICAL biology ,ALGORITHMS - Abstract
In recent years, new metaheuristic algorithms have been developed taking as reference the inspiration on biological and natural phenomena. This nature-inspired approach for algorithm development has been widely used by many researchers in solving optimization problems. These algorithms have been compared with the traditional ones and have demonstrated to be superior in many complex problems. This paper attempts to describe the algorithms based on nature, which are used in optimizing fuzzy clustering in real-world applications. We briefly describe the optimization methods, the most cited ones, nature-inspired algorithms that have been published in recent years, authors, networks and relationship of the works, etc. We believe the paper can serve as a basis for analysis of the new area of nature and bio-inspired optimization of fuzzy clustering. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
36. Archimedes optimization algorithm: a new metaheuristic algorithm for solving optimization problems.
- Author
-
Hashim, Fatma A., Hussain, Kashif, Houssein, Essam H., Mabrouk, Mai S., and Al-Atabany, Walid
- Subjects
PROBLEM solving ,METAHEURISTIC algorithms ,MATHEMATICAL optimization ,ARCHIMEDES' principle ,PARTICLE swarm optimization ,ALGORITHMS - Abstract
The difficulty and complexity of the real-world numerical optimization problems has grown manifold, which demands efficient optimization methods. To date, various metaheuristic approaches have been introduced, but only a few have earned recognition in research community. In this paper, a new metaheuristic algorithm called Archimedes optimization algorithm (AOA) is introduced to solve the optimization problems. AOA is devised with inspirations from an interesting law of physics Archimedes' Principle. It imitates the principle of buoyant force exerted upward on an object, partially or fully immersed in fluid, is proportional to weight of the displaced fluid. To evaluate performance, the proposed AOA algorithm is tested on CEC'17 test suite and four engineering design problems. The solutions obtained with AOA have outperformed well-known state-of-the-art and recently introduced metaheuristic algorithms such genetic algorithms (GA), particle swarm optimization (PSO), differential evolution variants L-SHADE and LSHADE-EpSin, whale optimization algorithm (WOA), sine-cosine algorithm (SCA), Harris' hawk optimization (HHO), and equilibrium optimizer (EO). The experimental results suggest that AOA is a high-performance optimization tool with respect to convergence speed and exploration-exploitation balance, as it is effectively applicable for solving complex problems. The source code is currently available for public from: https://www.mathworks.com/matlabcentral/fileexchange/79822-archimedes-optimization-algorithm [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
37. GBUO: "The Good, the Bad, and the Ugly" Optimizer.
- Author
-
Givi, Hadi, Dehghani, Mohammad, Montazeri, Zeinab, Morales-Menendez, Ruben, Ramirez-Mendoza, Ricardo A., Nouri, Nima, and Chang, Shu-Wei
- Subjects
PROBLEM solving ,MATHEMATICAL optimization ,ALGORITHMS ,MULTIMODAL user interfaces - Abstract
Optimization problems in various fields of science and engineering should be solved using appropriate methods. Stochastic search-based optimization algorithms are a widely used approach for solving optimization problems. In this paper, a new optimization algorithm called "the good, the bad, and the ugly" optimizer (GBUO) is introduced, based on the effect of three members of the population on the population updates. In the proposed GBUO, the algorithm population moves towards the good member and avoids the bad member. In the proposed algorithm, a new member called ugly member is also introduced, which plays an essential role in updating the population. In a challenging move, the ugly member leads the population to situations contrary to society's movement. GBUO is mathematically modeled, and its equations are presented. GBUO is implemented on a set of twenty-three standard objective functions to evaluate the proposed optimizer's performance for solving optimization problems. The mentioned standard objective functions can be classified into three groups: unimodal, multimodal with high-dimension, and multimodal with fixed dimension functions. There was a further analysis carried-out for eight well-known optimization algorithms. The simulation results show that the proposed algorithm has a good performance in solving different optimization problems models and is superior to the mentioned optimization algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
38. LSO-FastSLAM: A New Algorithm to Improve the Accuracy of Localization and Mapping for Rescue Robots.
- Author
-
Zhu, Daixian, Ma, Yinan, Wang, Mingbo, Yang, Jing, Yin, Yichen, and Liu, Shulin
- Subjects
PARTICLE swarm optimization ,WIRELESS localization ,ROBOTS ,DIVISION of labor ,ALGORITHMS ,MATHEMATICAL optimization ,PROBLEM solving - Abstract
This paper improves the accuracy of a mine robot's positioning and mapping for rapid rescue. Specifically, we improved the FastSLAM algorithm inspired by the lion swarm optimization method. Through the division of labor between different individuals in the lion swarm optimization algorithm, the optimized particle set distribution after importance sampling in the FastSLAM algorithm is realized. The particles are distributed in a high likelihood area, thereby solving the problem of particle weight degradation. Meanwhile, the diversity of particles is increased since the foraging methods between individuals in the lion swarm algorithm are different so that improving the accuracy of the robot's positioning and mapping. The experimental results confirmed the improvement of the algorithm and the accuracy of the robot. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
39. Optimization Algorithm's Problems: Comparison Study.
- Author
-
Nabi, Rebaz M., Azad, Rania, Saeed, Soran, and Nabi, Rebwar M.
- Subjects
MATHEMATICAL optimization ,PROBLEM solving ,ALGORITHMS ,NUMERICAL analysis ,MATHEMATICAL analysis - Abstract
Currently, in various fields and disciplines problem optimization are used commonly. In this concern, we have to define solutions which are two known concepts optimal or near optimal optimization problems in regards to some objects. Usually, it is surely difficult to sort problems out in only one step, but some processes can be followed by us which people usually call it problem solving. Frequently, the solution process is split into various steps which are accomplishing one after the other. Therefore, in this paper we consider some algorithms that help us to sort out problems, for exemplify, finding the shortest path, minimum spanning tree, maximum network flows and maximum matching. More importantly, the algorithm comparison will be presented. Additionally, the limitation of each algorithm. The last but not the least, the future research in this area will be approached. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
40. Simulation Optimization for MRO Systems Operations.
- Author
-
Liu, Pai, Zhang, Xi, Shi, Zhongshun, and Huang, Zewen
- Subjects
REMANUFACTURING ,MATHEMATICAL optimization ,PROBLEM solving ,ALGORITHMS ,UNCERTAINTY - Abstract
In this paper, we address the scheduling issues in a class of maintenance, repair and overhaul systems. By considering all key characteristics such as disassembly, material recovery uncertainty, material matching requirements, stochastic routings and variable processing times, the scheduling problem is formulated into a simulation optimization problem. To solve this difficult problem, we developed two hybrid algorithms based on nested partitions method and optimal computing budged allocation technology. Asymptotic convergence of these two algorithms is proved and numerical results show that the proposed algorithms can generate high quality solutions which outperform the performance of many heuristics. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
41. Combining Lift-and-Project and Reduce-and-Split.
- Author
-
Balas, Egon, Cornuéjols, Gérard, Kis, Tamás, and Nannicini, Giacomo
- Subjects
MIXED integer linear programming ,ALGORITHMS ,COMPUTATIONAL complexity ,CONSTRAINT satisfaction ,PERFORMANCE evaluation ,MATHEMATICAL optimization ,PROBLEM solving - Abstract
Split cuts constitute a class of cutting planes that has been successfully employed by the majority of branch-and-cut solvers for mixed-integer linear programs. Given a basis of the linear programming (LP) relaxation and a split disjunction, the corresponding split cut can be computed with a closed-form expression. In this paper, we use the lift-and-project framework introduced by Balas and Perregaard to provide the basis, and the reduce-and-split algorithm as described by Cornuéjols and Nannicini to compute the split disjunction. We propose a cut generation algorithm that starts from a Gomory mixed-integer cut and alternates between lift-and-project and reduce-and-split in order to strengthen it. This paper has two main contributions. First, we extend the Balas and Perregaard procedure for strengthening cuts arising from split disjunctions involving one variable to split disjunctions on multiple variables. Second, we apply the reduce-and-split algorithm to nonoptimal bases of the LP relaxation. We provide detailed computational testing of the proposed methods. [ABSTRACT FROM AUTHOR]
- Published
- 2013
- Full Text
- View/download PDF
42. Robust Lattice Alignment for K-User MIMO Interference Channels With Imperfect Channel Knowledge.
- Author
-
Huang, Lau, Vincent K. N., Du, Yinggang, and Liu, Sheng
- Subjects
LATTICE theory ,MIMO systems ,GAUSSIAN processes ,SIGNAL-to-noise ratio ,ALGORITHMS ,MATHEMATICAL optimization ,ITERATIVE methods (Mathematics) ,PROBLEM solving ,ELECTROMAGNETIC interference - Abstract
In this paper, we consider a robust lattice alignment design for K-user quasi-static multiple-input multiple-output (MIMO) interference channels with imperfect channel knowledge. With random Gaussian inputs, the conventional interference alignment (IA) method has the feasibility problem when the channel is quasi-static. On the other hand, structured lattices can create structured interference as opposed to the random interference caused by random Gaussian symbols. The structured interference space can be exploited to transmit the desired signals over the gaps. However, the existing alignment methods on the lattice codes for quasi-static channels either require infinite signal-to-noise ratio (SNR) or symmetric interference channel coefficients. Furthermore, perfect channel state information (CSI) is required for these alignment methods, which is difficult to achieve in practice. In this paper, we propose a robust lattice alignment method for quasi-static MIMO interference channels with imperfect CSI at all SNR regimes, and a two-stage decoding algorithm to decode the desired signal from the structured interference space. We derive the achievable data rate based on the proposed robust lattice alignment method, where the design of the precoders, decorrelators, scaling coefficients and interference quantization coefficients is jointly formulated as a mixed integer and continuous optimization problem. The effect of imperfect CSI is also accommodated in the optimization formulation, and hence the derived solution is robust to imperfect CSI. We also design a low complex iterative optimization algorithm for our robust lattice alignment method by using the existing iterative IA algorithm that was designed for the conventional IA method. Numerical results verify the advantages of the proposed robust lattice alignment method compared with the time-division multiple-access (TDMA), two-stage maximum-likelihood (ML) decoding, generalized Han–Kobayashi (HK), distributive IA and conventional IA methods in the literature. [ABSTRACT FROM PUBLISHER]
- Published
- 2011
- Full Text
- View/download PDF
43. Algorithms for Investment Project Distribution on Regions.
- Author
-
Alharbi, Mafawez and Jemmali, Mahdi
- Subjects
NP-hard problems ,ALGORITHMS ,MATHEMATICAL optimization ,INVESTMENTS ,PROBLEM solving ,COMPUTER scheduling - Abstract
This paper proposes an optimization system for solving an NP-hard problem by using several new algorithms and application programs. This study aims to identify a suitable distribution of investment projects across several developed industrial regions. It is assumed that all industrial regions involved have the same economic and strategic characteristics. The problem involves a set of projects that are to be assigned across regions. Each project creates an estimated number of new jobs, and the distribution of projects can be guided by minimizing the maximum total number of newly created jobs. The problem is NP-hard one, and it is difficult to determine the most appropriate distribution. We apply scheduling algorithms in order to solve the analyzed problem. Severalheuristics are developedto obtain the appropriate distribution of newly created jobs across all regions. A branch-and-bound method is employed in order to obtain the exact solution. The performance of the algorithm is demonstrated by the experimental results for a total number of 1850 instances. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
44. Solving k-center problems involving sets based on optimization techniques.
- Author
-
An, Nguyen Thai, Nam, Nguyen Mau, and Qin, Xiaolong
- Subjects
MATHEMATICAL optimization ,NONSMOOTH optimization ,CONVEX sets ,PROBLEM solving ,CONVEX functions ,ALGORITHMS ,RADIUS (Geometry) - Abstract
The continuous k-center problem aims at finding k balls with the smallest radius to cover a finite number of given points in R n . In this paper, we propose and study the following generalized version of the k-center problem: Given a finite number of nonempty closed convex sets in R n , find k balls with the smallest radius such that their union intersects all of the sets. Because of its nonsmoothness and nonconvexity, this problem is very challenging. Based on nonsmooth optimization techniques, we first derive some qualitative properties of the problem and then propose new algorithms to solve the problem. Numerical experiments are also provided to show the effectiveness of the proposed algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
45. CONSTRAINED NONLINEAR OPTIMIZATION BY HEURISTIC PROGRAMMING.
- Author
-
Paviani, D. A. and Himmelblau, D. M.
- Subjects
MATHEMATICAL optimization ,NONLINEAR statistical models ,HEURISTIC ,MATHEMATICAL programming ,ALGORITHMS ,PROBLEM solving - Abstract
This paper develops a new algorithm for solving the general nonlinear programming problem that melds the flexible simplex search of NELDER AND MEAD with various additional rules to take care of equality and/or inequality constraints. The set of violated inequalities and equalities is lumped into one inequality constraint loosely satisfied during the early progress of the optimization and more closely satisfied during its final stages. To permit this type of search, the method sets up a special tolerance criterion, a function that does not depend on either the values of the objective function or the values of the constraints. The new algorithm has solved successfully a number of problems that have been proposed in the literature as test problems. Finally, to indicate the algorithm's capabilities, the paper describes an example composed of a linear objective function of twenty-four variables subject to fourteen nonlinear equalities and thirty inequalities. [ABSTRACT FROM AUTHOR]
- Published
- 1969
- Full Text
- View/download PDF
46. IMPROVED COMBINATORIAL PROGRAMMING ALGORITHMS FOR A CLASS OF ALL-ZERO-ONE INTEGER PROGRAMMING PROBLEMS.
- Author
-
Pierce, John F. and Lasky, Jeffery S.
- Subjects
MATHEMATICAL programming ,COMBINATORIAL optimization ,ALGORITHMS ,MODIFICATIONS ,DYNAMIC programming ,NONLINEAR programming ,INTEGER programming ,MANAGEMENT science ,MATHEMATICAL optimization ,PROBLEM solving - Abstract
In an earlier paper [20] combinatorial programming procedures were presented for solving a class of integer programming problems in which all elements are zero or one. By representing the problem elements in a binary computer as bits in a word and employing logical "and" and "or" operations in the problem-solving process, a number of problems involving several hundred integer variables were solved in a matter of seconds. In the present paper a number of improvements in these earlier algorithms are presented, including a new search strategy, methods for reducing the original problem, and mechanisms for feasibility filtering in multi-word problems. With these improvements problem-solving efficiency has been increased in many instances by an order of magnitude. In addition, the present paper contains computational experience obtained in solving problems for the k-best solutions. [ABSTRACT FROM AUTHOR]
- Published
- 1973
- Full Text
- View/download PDF
47. African buffalo algorithm: Training the probabilistic neural network to solve classification problems.
- Author
-
Alweshah, Mohammed, Rababa, Lobna, Ryalat, Mohammed Hashem, Al Momani, Ammar, and Ababneh, Mohamed F.
- Subjects
AFRICAN buffalo ,PROBLEM solving ,ALGORITHMS ,METAHEURISTIC algorithms ,CLASSIFICATION algorithms ,MATHEMATICAL optimization - Abstract
Classification is used to categorize data and produce decisions for several domains. To improve the accuracy of classification, researchers have tended to hybridize the neural network with other metaheuristic algorithms in order to better exploit and explore the search space and thereby solve many different classification problems in an effective manner. The hybridization of algorithms is now commonplace and has resulted in the creation of novel methods that are more effective in comparison with those that employ a sole algorithm. Therefore, in this paper, a hybridization approach is employed to utilize the African buffalo optimization (ABO) algorithm as an optimizer to adjust the weights of the probabilistic neural network (PNN). The effectiveness of the proposed (ABO-PNN) method is investigated by applying it to several different classification problems. The efficiency of the ABO algorithm is assessed based on the PNN training results produced and its performance is compared with that of different types of optimization algorithm. The performance of the proposed algorithm in terms of classification accuracy is tested on 11 benchmark datasets. The results show that the ABO is better than the firefly algorithm (FA) in terms of both classification accuracy and convergence speed. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
48. A HYBRID CLUSTERING ALGORITHM COMBINING CLOUD MODEL IWO AND K-MEANS.
- Author
-
PAN, GUO, LI, KENLI, OUYANG, AIJIA, ZHOU, XU, and XU, YUMING
- Subjects
ALGORITHMS ,K-means clustering ,PROBLEM solving ,MATHEMATICAL optimization ,CLOUD computing ,PERFORMANCE evaluation - Abstract
In order to overcome the drawbacks of the K-means (KM) for clustering problems such as excessively depending on the initial guess values and easily getting into local optimum, a clustering algorithm of invasive weed optimization (IWO) and KM based on the cloud model has been proposed in the paper. The so-called cloud model IWO (CMIWO) is adopted to direct the search of KM algorithm to ensure that the population has a definite evolution direction in the iterative process, thus improving the performance of CMIWO K-means (CMIWOKM) algorithm in terms of convergence speed, computing precision and algorithm robustness. The experimental results show that the proposed algorithm has such advantages as higher accuracy, faster constringency, and stronger stability. [ABSTRACT FROM AUTHOR]
- Published
- 2014
- Full Text
- View/download PDF
49. Restricted Normal Cones and Sparsity Optimization with Affine Constraints.
- Author
-
Bauschke, Heinz, Luke, D., Phan, Hung, and Wang, Xianfu
- Subjects
MATHEMATICAL optimization ,PROBLEM solving ,PARALLEL computers ,STOCHASTIC convergence ,ALGORITHMS ,ESTIMATION theory - Abstract
The problem of finding a vector with the fewest nonzero elements that satisfies an underdetermined system of linear equations is an NP-complete problem that is typically solved numerically via convex heuristics or nicely behaved nonconvex relaxations. In this paper we consider the elementary method of alternating projections (MAP) for solving the sparsity optimization problem without employing convex heuristics. In a parallel paper we recently introduced the restricted normal cone which generalizes the classical Mordukhovich normal cone and reconciles some fundamental gaps in the theory of sufficient conditions for local linear convergence of the MAP algorithm. We use the restricted normal cone together with the notion of superregularity, which is inherently satisfied for the affine sparse optimization problem, to obtain local linear convergence results with estimates for the radius of convergence of the MAP algorithm applied to sparsity optimization with an affine constraint. [ABSTRACT FROM AUTHOR]
- Published
- 2014
- Full Text
- View/download PDF
50. A Dictionary Learning Approach for Poisson Image Deblurring.
- Author
-
Ma, Liyan, Moisan, Lionel, Yu, Jian, and Zeng, Tieyong
- Subjects
LEARNING ,MATHEMATICAL optimization ,MATHEMATICAL regularization ,SIGNAL-to-noise ratio ,STATISTICS ,PROBLEM solving ,ALGORITHMS - Abstract
The restoration of images corrupted by blur and Poisson noise is a key issue in medical and biological image processing. While most existing methods are based on variational models, generally derived from a maximum a posteriori (MAP) formulation, recently sparse representations of images have shown to be efficient approaches for image recovery. Following this idea, we propose in this paper a model containing three terms: a patch-based sparse representation prior over a learned dictionary, the pixel-based total variation regularization term and a data-fidelity term capturing the statistics of Poisson noise. The resulting optimization problem can be solved by an alternating minimization technique combined with variable splitting. Extensive experimental results suggest that in terms of visual quality, peak signal-to-noise ratio value and the method noise, the proposed algorithm outperforms state-of-the-art methods. [ABSTRACT FROM PUBLISHER]
- Published
- 2013
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.