Search

Particle swarm optimization algorithms (PSOA) is a metaheuristic algorithm used to optimize computational problems using candidate solutions or particles based on selected quality measures. Despite the extensive research published, studies that critically examine its recent scientific developments and research impact are lacking. Therefore, the publication trends and research landscape on PSOA research were examined. The Preferred Reporting Items for Systematic Reviews and Meta-Analyses (PRISMA) and bibliometric analysis techniques were applied to identify and analyze the published documents indexed in Scopus from 2001 to 2021. The published documents on PSOA increased from 8 to 1,717 (21,362.50%) due to the growing applications of PSOA in solving computational problems. "Conference papers" is the most common document type, whereas the most prolific researcher on PSOA is Andries P. Engelbrecht (South Africa). The most active affiliation (Ministry of Education) and funding organization (National Natural Science Foundation) are based in China. The research landscape on PSOA revealed high levels of publications, citations, and collaborations among the top authors, institutions, and countries worldwide. Keywords co-occurrence analysis revealed that "particle swarm optimization (PSO)" occurred more frequently than others. The findings of the study could provide researchers and policymakers with insights into the prospects and challenges of PSOA research relative to similar algorithms in the literature. [ABSTRACT FROM AUTHOR]

In the three‐phase grid‐connected current‐source inverters (CSIs), the resonance result from the AC‐side CL filter and the quality of the grid‐current waveform under the unbalanced and harmonic grid voltage conditions are two issues deserving attention. To solve the two problems, a continuous control set‐model predictive control (CCS‐MPC) method based on the optimization theory is proposed in the two‐phase synchronous coordinate frame in this paper. The constructed cost function takes grid‐connected current and output current of the inverter as control target, and obtains its optimal solution under the least‐squares method, where the optimal inverter‐side current reference is composed of inductor‐current proportional feedback, capacitor‐voltage proportional feedback, and inverter‐side current steady‐state value feedforward. The proposed method can easily realize the normal operation of three‐phase grid‐connected CSIs because the method can be determined by only one parameter under the unbalanced and distorted grids. Furthermore, in the proposed method, the proportional feedback of capacitor voltage can effectively suppress the CL filter resonance. Finally, simulation and experimental results verify the effectiveness of the proposed control strategy. [ABSTRACT FROM AUTHOR]

In this paper, we investigate a distributed interval optimization problem whose local functions are interval functions rather than scalar functions. Focusing on distributed interval optimization, this paper presents a distributed primal-dual algorithm. A criterion is introduced under which linear convergence to the Pareto solution of distributed interval optimization problems can be achieved without strong convexity. Lastly, a numerical simulation is presented to illustrate the linear convergence of the algorithm that has been proposed. [ABSTRACT FROM AUTHOR]

As industrial practices continue to evolve, complex process industries often exhibit characteristics such as multivariate correlation, dynamism, and nonlinearity, making traditional mechanism modeling inadequate in terms of addressing the intricacies of complex industrial problems. In recent years, with advancements in control theory and industrial practices, there has been a substantial increase in the volume of industrial data. Data-driven dynamic operation optimization techniques have emerged as effective solutions for handling complex industrial processes. By responding to dynamic environmental changes and utilizing advanced optimization algorithms, it is possible to achieve dynamic operational optimization in industrial processes, thereby reducing costs and emissions, improving efficiency, and increasing productivity. This correlates nicely with the goals set forth by conventional process operation optimization theories. Nowadays, this dynamic, data-driven strategy has shown significant potential in complex process industries characterized by multivariate correlations and nonlinear behavior. This paper approaches the subject from a data-driven perspective by establishing dynamic optimization models for complex industries and reviewing the state-of-the-art time series forecasting models to cope with changing objective functions over time. Meanwhile, aiming at the problem of concept drift in time series, this paper summarizes new concept drift detection methods and introduces model update methods to solve this challenge. In addressing the problem of solving dynamic multi-objective optimization problems, the paper reviews recent developments in dynamic change detection and response methods while summarizing commonly used as well as the latest performance measures for dynamic multi-objective optimization problems. In conclusion, a discussion of the research progress and challenges in the relevant domains is undertaken, followed by the proposal of potential directions for future research. This review will help to deeply understand the importance and application prospects of data-driven dynamic operation optimization in complex industrial fields. [ABSTRACT FROM AUTHOR]

The parameter optimization of hybrid electric vehicle is very complex and has always been the focus of research, due to the highly intertwined relationship between powertrain configurations and EMS. In addition, automated powertrain is typical cyber-physics system that contains discrete states, such as modes and gears. Transition between discrete states is a contributing factor that causes discomfort. Therefore, in order to solve the above problems, this paper proposes a multi-objective dynamic optimization algorithm considering mode transition. The algorithm consists of two layers. The first layer optimizes fuel economy and dynamic performance, the second layer optimizes ride comfort and smoothness performance, and the results of the second layer are returned to the first layer for re-optimization in real time. The mode transition frequency is used as the comfort objective function, and the threshold value of the engine high efficiency working area is added to the optimization parameter selection. The results show that the optimization method proposed in this paper realizes the parameter decoupling, and the optimization results achieve the global optimization. Effectively improves the vehicle performance and reduces engine start-stop frequently. [ABSTRACT FROM AUTHOR]

With remarkable learning capabilities and swift operational speeds, artificial intelligence (AI) can assist researchers in swiftly extracting valuable patterns, trends, and associations from subjective information. Tribological behaviors are characterized by dependence on systems, evolution with time, and multidisciplinary coupling. The friction process involves a variety of phenomena, including mechanics, thermology, electricity, optics, magnetics, and so on. Hence, tribological information possesses the distinct characteristics of being multidisciplinary, multilevel, and multiscale, so that the application of AI in tribology is highly extensive. To delineate the scope, classification, and recent trends of AI implementation in tribology, this review embarks on exploration of the tribology research domain. It comprehensively outlines the utilization of AI in basic theory of tribology, intelligent tribology, component tribology, extreme tribology, bio-tribology, green tribology, and other fields. Finally, considering the emergence of "tribo-informatics" as a novel interdisciplinary field, which combines tribology with informatics, this review elucidates the future directions and research framework of "AI for tribology". In this paper, tribo-system information is divided into 5 categories: input information (I), system intrinsic information (S), output information (O), tribological state information (Ts), and derived state information (Ds). Then, a fusion method among 5 types of tribo-system information and different AI technologies (regression, classification, clustering, and dimension reduction) has been proposed, which enables tribo-informatics methods to solve common problems such as tribological behavior state monitoring, behavior prediction, and system optimization. The purpose of this review is to offer a systematic comprehension of tribo-informatics and to inspire new research ideas of tribo-informatics. Ultimately, it aspires to enhance the efficiency of problem-solving in tribology. [ABSTRACT FROM AUTHOR]

Clustering ensemble can be regarded as a mathematical optimization problem, and the genetic algorithm has been widely used as a powerful tool for solving such optimization problems. However, the existing research on clustering ensemble based on the genetic algorithm model has mainly focused on unsupervised approaches and has been limited by parameters like crossover probability and mutation probability. This paper presents a semi-supervised clustering ensemble based on the genetic algorithm model. This approach utilizes pairwise constraint information to strengthen the crossover process and mutation process, resulting in enhanced overall algorithm performance. To validate the effectiveness of the proposed approach, extensive comparative experiments were conducted on 9 diverse datasets. The results of the experiments demonstrate the superiority of the proposed algorithm in terms of clustering accuracy and robustness. In summary, this paper introduces a novel semi-supervised approach based on the genetic algorithm model. The utilization of pair-wise constraint information enhances the algorithm's performance, making it a promising solution for real-world clustering problems. [ABSTRACT FROM AUTHOR]

Virtualization technology, as the technical support for cloud computing, frees users from the limitations of hardware resources. Dynamic migration technology enables virtual machines to be moved across hosts, and services running on the virtual machines are basically uninterrupted during the migration process, which greatly facilitates the maintenance work in the data center. However, dynamic migration needs to transmit a large amount of repeated data. In order to improve the migration efficiency, this paper conducts the following research on the original pre-copy algorithm. First, we introduce a high dirty page determination algorithm based on the locality principle to classify memory pages and propose an improved memory migration pre-copy algorithm on this basis. Second, in order to solve the problem that the pre-copy algorithm cannot converge under a high load, an improved VM downtime determination algorithm is proposed. Third, the paper also introduces the LZ4 compression algorithm to further optimize the memory migration process. Finally, this paper implements the above optimization scheme on a KVM platform and tests its performance. It is compared with the native pre-copy algorithm and Three-Phase Optimization algorithm (TPO). The result shows that the optimized scheme significantly reduces the total migration time and downtime. [ABSTRACT FROM AUTHOR]

The efficient design of the aerodynamic surfaces in the aircraft allows the optimal performance of the vehicle and the reduction of the fuel consumption. Among these surfaces, the wing is the main contributor to the force which lifts the aircraft enabling the flight. However, the application of this force out of the center of gravity generates a moment that must be balanced through a force applied in the Horizontal-Tail-Plane (HTP) reaching the longitudinal trim of the aircraft. Traditionally, the design of the wing and HTP have been performed iteratively attaining suboptimal or time ineffective results. In this paper, we solve this problem through the application of a Genetic Algorithm for the combined optimization of the wing and the HTP by adjusting the aspect ratio, the taper ratio, the twist angle and the incidence angle of both surfaces to produce the optimal balance of lift adjusting its distribution to an elliptical configuration and enabling the longitudinal trim. Results show the automatic adjustment of the parameters of the aerodynamic surfaces thus fulfilling the objectives of this paper. [ABSTRACT FROM AUTHOR]

Agent-based evolutionary, computational systems have been proven to be an efficient concept for solving complex computational problems. This paper is an extension of [Biełaszek, S., Piętak, K., & Kisiel-Dorohinicki, M. (2021). New extensions of reproduction operators in solving LABS problem using EMAS meta-heuristic. Springer, cop. 2021. – Lecture Notes in Artificial Intelligence, Computational collective intelligence 12876 304-316. 13th International Conference, ICCCI 2021: Rhodes, Greece, September 29ŰOctober 1, 2021.] where we proposed new variants of reproduction operators together with new heuristics for the generation of initial population, dedicated to LABS – a hard discrete optimization problem. In this research, we verify if the proposed recombination operators improve EMAS efficiency also with different local optimization techniques such as Tabu Search and Self-avoiding walk, and therefore can be seen as better recombination operators dedicated to LABS problem in general. This paper recalls the definition of new recombination variants dedicated to LABS and verify if they can be successfully used in many different evolutionary configurations. [ABSTRACT FROM AUTHOR]

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]

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]

In this paper, we focus on using the low-rank factorization approach to solve the SDP relaxation of a graph equipartition problem, which involves an additional spectral upper bound over the traditional linear SDP. We discuss the equivalence between the decomposed problem and the original SDP problem. We also derive a sufficient condition, under which a second order stationary point of the non-convex problem is also a global minimum. Moreover, the constraints of the non-convex problem involve an algebraic variety with conducive geometric properties which we analyse. We also develop a method to escape from a non-optimal singular point on this variety. This allows us to use Riemannian optimization techniques to solve the SDP problem very efficiently with certified global optimality. [ABSTRACT FROM AUTHOR]

Unconventional events exacerbate the imbalance between regional transportation demand and limited road network resources. Scientific and efficient path planning serves as the foundation for rapidly restoring equilibrium to the road network. In real large-scale road networks, especially during emergencies, it is usually difficult to obtain or predict accurate dynamic traffic network flows in real-time, which is used to support equilibrium path planning. Moreover, the traditional iterative methods cannot meet the real-time demand of emergency equilibrium path planning decision generation. To solve the above problems, this paper proposes a hybrid control architecture for path planning based on equilibrium traffic assignment theory. The architecture introduces the travelers' real-time travel data and constructs a spatio-temporal neural network, which captures the evolution of traffic network loads. Adaptive multi-graph fusion technology is used to mix the background traffic flow data and the traveler's real-time Origin–Destination (OD) data, to mine the dynamic correlation between the traffic state and the travelers' travel. Based on the real-time prediction of dynamic network states, equilibrium mapping learning is carried out to pre-allocate potential travel demands and construct equilibrium traffic graphs based on system optimization traffic assignment. Finally, individual evacuation path strategies are generated online in a data-driven manner in real time to achieve improved resilience in the transportation system. [ABSTRACT FROM AUTHOR]

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]

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]

This paper presents a novel Fourier spectral method that utilizes optimization techniques to ensure the positivity and conservation of moments in the space of trigonometric polynomials. We rigorously analyze the accuracy of the new method and prove that it maintains spectral accuracy. To solve the optimization problem, we propose an efficient Newton solver that has a quadratic convergence rate. Numerical examples are provided to demonstrate the high accuracy of the proposed method. Our method is also integrated into the spectral solver of the Boltzmann equation, showing the benefit of our approach in applications. [ABSTRACT FROM AUTHOR]

In this paper, different methods are utilized to solve the coordination issue involving directional overcurrent relays (DOCRs) and distance relays. The proper coordination of DOCRs and distance relays is a critical issue for system security in electrical networks. Finding the DOCRs setting, pickup current(Ip) and timed dial setting (TDS), and operating time for zone-2 of distance relays is the primary objective of solving the coordination problem. The constant parameters A & B of the directional overcurrent relay that are responsible to control the form of the relay´s characteristics as well as the Ip and TDS have been regarded as variables in this problem. The optimal value for these four DOCR settings has been determined using different optimization techniques. The primary and backup relays must operate sequentially and without any violations, and this must be guaranteed by optimization techniques. In order to determine the operation time for zone-2 and DOCRs setting, optimization methods are examined utilizing the 8-bus and IEEE 30-bus networks. Different optimization algorithms, including recent and traditional techniques, are compared. The obtained results show the superiority of the genetic algorithm (GA) in solving the coordination problem of distance relays and DOCRs. Also, the obtained results prove the ability of the GA method compared to the particle swarm algorithm (PSO), grey wolf optimization (GWO), water cycle technique (WCA), equilibrium optimizer (EO), African vultures optimization algorithm (AVOA), flow direction algorithm (FDA), and gorilla troops optimizer (GTO) techniques. [ABSTRACT FROM AUTHOR]

Production problems have a significant impact on the on-time delivery of orders, resulting in deviations from planned scenarios. Therefore, it is crucial to predict interruptions during scheduling and to find optimal production sequencing solutions. This paper introduces a selflearning framework that integrates association rules and optimisation techniques to develop a scheduling algorithm capable of learning from past production experiences and anticipating future problems. Association rules identify factors that hinder the production process, while optimisation techniques use mathematical models to optimise the sequence of tasks and minimise execution time. In addition, association rules establish correlations between production parameters and success rates, allowing corrective factors for production quantity to be calculated based on confidence values and success rates. The proposed solution demonstrates robustness and flexibility, providing efficient solutions for Flow-Shop and Job-Shop scheduling problems with reduced calculation times. The article includes two Flow-Shop and Job-Shop examples where the framework is applied. [ABSTRACT FROM AUTHOR]

Optimal control of linear time-varying (LTV) systems is one of the most common problems in engineering, economics, biology, etc. Solving this problem is not always possible, and this motivates us to improve the existing approximate solution methods. In this paper, the optimality conditions are first obtained, and then the well-known variational iteration method, interpolated by B-spline functions, is applied to solve these conditions. The method is also accelerated through the elimination of redundant calculations. Our method provides a feedback controller for LTV optimal control problems and does not need to solve any system of equations or optimization problems at each iteration. The convergence of the proposed method is proved, and the algorithm's efficiency is illustrated through several examples. [ABSTRACT FROM AUTHOR]

University timetabling problems are a yearly challenging task and are faced repeatedly each semester. The problems are considered nonpolynomial time (NP) and combinatorial optimization problems (COP), which means that they can be solved through optimization algorithms to produce the aspired optimal timetable. Several techniques have been used to solve university timetabling problems, and most of them use optimization techniques. This paper provides a comprehensive review of the most recent studies dealing with concepts, methodologies, optimization, benchmarks, and open issues of university timetabling problems. The comprehensive review starts by presenting the essence of university timetabling as NP-COP, defining and clarifying the two formed classes of university timetabling: University Course Timetabling and University Examination Timetabling, illustrating the adopted algorithms for solving such a problem, elaborating the university timetabling constraints to be considered achieving the optimal timetable, and explaining how to analyze and measure the performance of the optimization algorithms by demonstrating the commonly used benchmark datasets for the evaluation. It is noted that meta-heuristic methodologies are widely used in the literature. Additionally, recently, multi-objective optimization has been increasingly used in solving such a problem that can identify robust university timetabling solutions. Finally, trends and future directions in university timetabling problems are provided. This paper provides good information for students, researchers, and specialists interested in this area of research. The challenges and possibilities for future research prospects are also explored. [ABSTRACT FROM AUTHOR]

Aiming at the air defense task requirements for an enemy's large-scale aircraft attack, this paper presents a plan generation algorithm which can quickly give an interception scheme. The main contribution of this paper is the modification of the standard A* algorithm and its combination of the optimization algorithm and air-defence mission. Firstly, the enemy's attack weapon and our defense platform are modeled, and kinetic equations and interception efficiency functions are constructed, and the intercepted criterions are established. Then, the interception-cost mixed optimal function is established to clarify the system optimization objective. Secondly, aiming at the characteristics of strong time sensitivity of air defense interception, a modified A* optimization algorithm with fast convergence characteristics is used to solve the optimization problems, the standard A* algorithm is modified and the optimal air defense interception plan under the condition of mixed performance index is given. Finally, the proposed method is verified by numerical simulations. [ABSTRACT FROM AUTHOR]

During the process of cloud manufacturing, various uncertainties in the real world could have a significant impact on the smooth execution of task, and could render the planned composite manufacturing service (CMS) inefficient or even ineffective. Therefore, this paper proposes an optimal selection method to enhance the robustness of CMS during the planning stage. Firstly, the structure of robust CMS is proposed by arranging the preferred and alternative services for each subtask, and a robust service composition and optimal selection (rSCOS) model of cloud manufacturing is constructed by defining the expected Quality of Service. Then, the gABC-GWO (guiding artificial bee colony – grey wolf optimisation) algorithm is proposed to solve the rSCOS model efficiently, in which three improvement strategies for ABC algorithm are designed according to the characteristics of GWO. Finally, two experiments are implemented and the results show that QoS of the preferred scheme of robust CMS is approximately 1.29% lower than that of CMS on average, while its robustness is improved by 1.81% and 13.14% depending on the two robustness indexes. Compared with other commonly-used intelligence optimisation algorithms, gABC-GWO algorithm possesses better search performance without significantly increasing time consumption, which makes it more suitable for solving rSOCS problems. [ABSTRACT FROM AUTHOR]

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]

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]

In the field of many-objective evolutionary optimization algorithms (MaOEAs), how to maintain the balance between convergence and diversity has been a significant research problem. With the increase of the number of objectives, the number of mutually nondominated solutions increases rapidly, and multi-objective evolutionary optimization algorithms, based on Pareto-dominated relations, become invalid because of the loss of selection pressure in environmental selection. In order to solve this problem, indicator-based many-objective evolutionary algorithms have been proposed; however, they are not good enough at maintaining diversity. Decomposition-based methods have achieved promising performance in keeping diversity. In this paper, we propose a MaOEA based on indicator and decomposition (IDEA) to keep the convergence and diversity simultaneously. Moreover, decomposition-based algorithms do not work well on irregular PFs. To tackle this problem, this paper develops a reference-points adjustment method based on the learning population. Experimental studies of several well-known benchmark problems show that IDEA is very effective compared to ten state-of-the-art many-objective algorithms. [ABSTRACT FROM AUTHOR]

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.)

Recently, a new swarm intelligence optimization algorithm called the remora optimization algorithm (ROA) was proposed. ROA simulates the remora's behavior of the adsorption host and uses some formulas of the sailfish optimization (SFO) algorithm and whale optimization algorithm (WOA) to update the solutions. However, the performance of ROA is still unsatisfactory. When solving complex problems, ROA's convergence ability requires further improvement. Moreover, it is easy to fall into local optimization. Since the remora depends on the host to obtain food and optimize ROA performance, this paper introduces the mutualistic strategy to strengthen the symbiotic relationship between the remora and the host. Meanwhile, chaotic tent mapping and roulette wheel selection are added to further improve the algorithm's performance. By incorporating the above improvements, this paper proposes an improved remora optimization algorithm with a mutualistic strategy (IROA) and uses 23 benchmark functions in different dimensions and CEC2020 functions to validate the performance of the proposed IROA. Experimental studies on six classical engineering problems demonstrate that the proposed IROA has excellent advantages in solving practical optimization problems. [ABSTRACT FROM AUTHOR]

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]

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]

To solve the problems of high ground stress, low permeability and low coalbed methane recovery, this paper proposes an optimization technique for improving coal seam permeability, i.e., water-gas alternating displacement enhances coalbed methane recovery (WGA-ECBM). The seepage field of gas-water two-phase flow is derived and a multiphase fluid-solid coupling model between physical parameters is established. This paper studies the effects of three displacement methods (water injection, air injection and water-air alternating injection) on methane recovery. The influence of injection pressure and injection duration on the WGA-ECBM technique is also studied. The V C H 4 (methane volume fraction) of the three methods decrease by 17.84%, 12.72% and 44.62% in the borehole, respectively. The influence ranges (diameter) are 24.68 m, 149.73 m and 135.21 m, respectively. Pore pressures and displacement area also increase as injection pressure increases in a 5 MPa gradient. And V C H 4 in the borehole decrease by 35.57%, 43.82%, 46.78% and 51.72% from 10 MPa to 25 MPa, respectively. With the increase of injection duration, the influence range expands significantly but the pore pressure distribution changes little. And V C H 4 decreases slightly in the displaced area and the displacement velocity gradually slows down. This technique promotes multiphase flow migration in coal seam, and increases the displacement range and methane recovery efficiency. [ABSTRACT FROM AUTHOR]

Public resource scheduling refers to the rational allocation and effective use of resources, while public emergency scheduling refers to the rational allocation and effective use of resources in the context of emergencies. Its main purpose is to reduce casualties and property losses caused by emergencies. This paper mainly studies the emergency scheduling of public resources based on line sensing technology and solves the scheduling problem of public resources through algorithm optimization. Firstly, combined with the positioning algorithm of wireless sensor, this paper optimizes the positioning and detection technology of wireless sensor technology. Then, we design an improved multiagent genetic algorithm (MAGA-MTERS) using natural number coding and design a penalty function to solve the model. Then, the algorithm is compared with the traditional genetic algorithm. The results show that the accurate positioning of wireless sensor technology can improve the efficiency of public resource scheduling and save the scheduling cost. The multiagent genetic algorithm optimizes the positioning function of wireless sensor. Compared with the traditional genetic algorithm, MAGA-MTERS algorithm can obtain a better solution. [ABSTRACT FROM AUTHOR]

The objective of this paper is to study the key technology of the mobile communication network optimization system based on artificial intelligence technology. Specific Content. This paper designs the artificial intelligence agent- (IA-) type mobile communication network optimization tool iOS2CMCN, analyzes the relevant intelligent technology introduced into the system, and analyzes the feasibility and practicability of iOS2CMCN through application examples. The results show that the optimization of mobile communication networks is one of the important links in the construction of communication networks and ensuring the quality of network service. In the form of an artificial intelligence agent, iOS2CMCN absorbs the experience and knowledge of a large number of network optimization engineers and experts and realizes the intelligence and automation of mobile communication network optimization. It is proven that the fuzzy technology is introduced in theory, the practical problem is reasonably modeled, and the rule and case reasoning are used to simulate the thinking mode of a human being when solving the problem. It reduces the dependence of network optimization on humans, improves the efficiency of network optimization, and provides a new idea for practical mobile communication network optimization. [ABSTRACT FROM AUTHOR]

In order to improve the congestion of the evacuation plan and further improve the evacuation efficiency, this paper proposes the priority Pareto partial order relation and the vector pheromone routing method based on the priority Pareto partial order relation. Numerical experiments show that compared with the hierarchical multiobjective evacuation path optimization algorithm based on the hierarchical network, the fragmented multiobjective evacuation path optimization algorithm proposed in this paper effectively improves the evacuation efficiency of the evacuation plan and the convergence of the noninferior plan set. However, the congestion condition of the noninferior evacuation plan obtained by the fragmented multiobjective evacuation route optimization algorithm is worse than the congestion condition of the noninferior evacuation plan obtained by the hierarchical multiobjective evacuation route optimization algorithm. The multiple factors that affect the routing process considered in the probability transfer function used in the traditional ant colony algorithm routing method must be independent of each other. However, in actual route selection, multiple factors that affect route selection are not necessarily independent of each other. In order to fully consider the various factors that affect the routing, this paper adopts the vector pheromone routing method based on the traditional Pareto partial order relationship instead of the traditional ant colony algorithm. The model mainly improves the original pheromone distribution and volatilization coefficient of the ant colony, speeds up the convergence speed and accuracy of the algorithm, and obtains ideal candidate solutions. The method is applied to the location of sports facilities and has achieved good results. The experimental results show that the improved ant colony algorithm model designed in this paper is suitable for solving the problem of urban sports facilities location in large-scale space. [ABSTRACT FROM AUTHOR]

The advent of the cloud computing paradigm allowed multiple organizations to move, compute, and host their applications in the cloud environment, enabling seamless access to a wide range of services with minimal effort. An efficient and dynamic task scheduler is required to handle concurrent user requests for cloud services using various heterogeneous and diversified resources. Improper scheduling can lead to challenges with under or over-utilization of resources, which could waste cloud resources or degrade service performance. Nature-inspired optimization techniques have been proven effective at solving scheduling problems. This paper accomplishes a review of nature-inspired optimization techniques for scheduling tasks in cloud computing. A novel classification taxonomy and comparative review of these techniques in cloud computing are presented in this research. The taxonomy of nature-inspired scheduling techniques is categorized as per the scheduling algorithms, nature of the scheduling problem, type of tasks, the primary objective of scheduling, task-resource mapping scheme, scheduling constraint, and testing environment. Additionally, guidelines for future research issues are also provided, which should undoubtedly benefit researchers and practitioners as well as open the door for newcomers eager to pursue their glory in the field of cloud task scheduling. [ABSTRACT FROM AUTHOR]

Case-based planning is an approach to planning where previous planning experience provides guidance to solving new problems. Such a guidance can be extremely useful, or even necessary, when the new problem is very hard to solve, or the stored previous experience is highly valuable, because, e.g., it was provided or validated by human experts, and the system should try to reuse it as much as possible. To do so, a case-based planning system stores in a library previous planning experience in the form of already encountered problems and their solutions. The quality of such a plan library critically inuences the performance of the planner, and therefore it needs to be carefully designed and created. For this reason, it is also important to update the library during the lifetime of the system, as the type of problems being addressed may evolve or differ from the ones the library was originally designed for. Moreover, like in general case-based reasoning, the library needs to be maintained at a manageable size, otherwise the computational cost of querying it grows excessively, making the entire approach ineffective. In this paper, we formally define the problem of maintaining a library of cases, discuss which criteria should drive the maintenance, study the computational complexity of the maintenance problem, and propose offline techniques to reduce an oversized library that optimize different criteria. Moreover, we introduce a complementary online approach that attempts to limit the growth of the library, and we consider the combination of offline and online techniques to ensure the best performance of the case-based planner. Finally, we experimentally show the practical effectiveness of the offline and online methods for reducing the library. [ABSTRACT FROM AUTHOR]

Dominance breaking is a powerful technique in improving the solving efficiency of Constraint Optimization Problems (COPs) by removing provably suboptimal solutions with additional constraints. While dominance breaking is effective in a range of practical problems, it is usually problem specific and requires human insights into problem structures to come up with correct dominance breaking constraints. Recently, a framework is proposed to generate nogood constraints automatically for dominance breaking, which formulates nogood generation as solving auxiliary Constraint Satisfaction Problems (CSPs). However, the framework uses a pattern matching approach to synthesize the auxiliary generation CSPs from the specific forms of objectives and constraints in target COPs, and is only applicable to a limited class of COPs. This paper proposes a novel rewriting system to derive constraints for the auxiliary generation CSPs automatically from COPs with nested function calls, significantly generalizing the original framework. In particular, the rewriting system exploits functional constraints flattened from nested functions in a high-level modeling language. To generate more effective dominance breaking nogoods and derive more relaxed constraints in generation CSPs, we further characterize how to extend the system with rewriting rules exploiting function properties, such as monotonicity, commutativity, and associativity, for specific functional constraints. Experimentation shows significant runtime speedup using the dominance breaking nogoods generated by our proposed method. Studying patterns of generated nogoods also demonstrates that our proposal can reveal dominance relations in the literature and discover new dominance relations on problems with ineffective or no known dominance breaking constraints. [ABSTRACT FROM AUTHOR]

In this paper, based on the concept of the NFL theorem, that there is no unique algorithm that has the best performance for all optimization problems, a new human-based metaheuristic algorithm called Language Education Optimization (LEO) is introduced, which is used to solve optimization problems. LEO is inspired by the foreign language education process in which a language teacher trains the students of language schools in the desired language skills and rules. LEO is mathematically modeled in three phases: (i) students selecting their teacher, (ii) students learning from each other, and (iii) individual practice, considering exploration in local search and exploitation in local search. The performance of LEO in optimization tasks has been challenged against fifty-two benchmark functions of a variety of unimodal, multimodal types and the CEC 2017 test suite. The optimization results show that LEO, with its acceptable ability in exploration, exploitation, and maintaining a balance between them, has efficient performance in optimization applications and solution presentation. LEO efficiency in optimization tasks is compared with ten well-known metaheuristic algorithms. Analyses of the simulation results show that LEO has effective performance in dealing with optimization tasks and is significantly superior and more competitive in combating the compared algorithms. The implementation results of the proposed approach to four engineering design problems show the effectiveness of LEO in solving real-world optimization applications. [ABSTRACT FROM AUTHOR]

This paper explores and studies recommendation technologies based on content filtering and user collaborative filtering and proposes a hybrid recommendation algorithm based on content and user collaborative filtering. This method not only makes use of the advantages of content filtering but also can carry out similarity matching filtering for all items, especially when the items are not evaluated by any user, which can be filtered out and recommended to users, thus avoiding the problem of early level. At the same time, this method also takes advantage of the advantages of collaborative filtering. When the number of users and evaluation levels are large, the user rating data matrix of collaborative filtering prediction will become relatively dense, which can reduce the sparsity of the matrix and make collaborative filtering more accurate. In this way, the system performance will be greatly improved through the integration of the two. On the basis of the improved collaborative filtering algorithm, a hybrid algorithm based on content and improved collaborative filtering was proposed. By combining user rating with item features, a user feature rating matrix was established to replace the traditional user-item rating matrix. K-means clustering was performed on the user set and recommendations were made. The improved algorithm can solve the problem of data sparsity of traditional collaborative filtering algorithm. At the same time, for new projects, it can also predict users who may be interested in new projects according to the matching of project characteristics and user characteristics scoring matrix and generate push list, which effectively solve the problem of new projects in "cold start." The experimental results show that the improved algorithm in this paper plays a significant role in solving the speed bottleneck problems of data sparsity, cold start, and online recommendation and can ensure a better recommendation quality. [ABSTRACT FROM AUTHOR]

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]

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]

To solve the autonomous navigation problem in complex environments, an efficient motion planning approach is newly presented in this paper. Considering the challenges from large-scale, partially unknown complex environments, a three-layer motion planning framework is elaborately designed, including global path planning, local path optimization, and time-optimal velocity planning. Compared with existing approaches, the novelty of this work is twofold: 1) a novel heuristic-guided pruning strategy of motion primitives is proposed and fully integrated into the state lattice-based global path planner to further improve the computational efficiency of graph search, and 2) a new soft-constrained local path optimization approach is proposed, wherein the sparse-banded system structure of the underlying optimization problem is fully exploited to efficiently solve the problem. We validate the safety, smoothness, flexibility, and efficiency of our approach in various complex simulation scenarios and challenging real-world tasks. It is shown that the computational efficiency is improved by 66.21% in the global planning stage and the motion efficiency of the robot is improved by 22.87% compared with the recent quintic Bézier curve-based state space sampling approach. We name the proposed motion planning framework E $\mathbf {^{3}} $ MoP, where the number 3 not only means our approach is a three-layer framework but also means the proposed approach is efficient in three stages. Note to Practitioners—This paper is motivated by the challenges of motion planning problems of mobile robots. A three-layer motion planning framework is proposed by combining global path planning, local path optimization, and time-optimal velocity planning. For mobile robot navigation applications in semi-structured environments, optimization-based local planners are recommended. Extensive simulation and experimental results show the effectiveness of the proposed motion planning framework. However, due to the non-convexity of the path optimization formulation, the proposed local planner may get stuck in local optima. In future research, we will concentrate on extending the proposed local path optimization approach with the theory of homology classes to maintain several homotopically distinct local paths and seek global optima. [ABSTRACT FROM AUTHOR]

At present, cloud services and cloud manufacturing are developing rapidly, speed and accuracy have become the themes of cloud manufacturing development. The core component of cloud manufacturing is resource portfolio optimization. In cloud manufacturing today, the scale of service portfolios is expanding rapidly, and the number of candidate services which in the service pool is increasing gradually. To adapt to the development of cloud services, an optimization algorithm with faster speed, greater precision and higher stability is required to solve the problem of cloud service composition and optimization (CSCO). To increase the convergence rate and avoid falling into local optima with the artificial bee colony algorithm, a self-learning artificial bee colony genetic algorithm (SLABC-GA) is proposed in this paper, which is based on reinforcement learning (RL), and the RL is used to intelligently select the number of dimensions of each update of a feasible solution. A global optimal individual is used to search and guide the search equation to avoid obtaining local optima and improve algorithm development and the precision of the traditional artificial bee colony algorithm (ABC). A genetic algorithm (GA) is introduced in a later stage of the algorithm to further improve its accuracy and convergence speed. Additionally, this paper analyzes and constructs the self-learning model in SLABC, the optimal learning method is Q-learning algorithm, and designs a reward method and state determination method of RL in the environment of the bee colony algorithm. Finally, a large number of comparative experiments have been carried out, the results show that the accuracy and speed of the SLABC-GA outperform for CSCO problems, and the performance of the SLABC-GA for large-scale CSCO problems is better than that of genetic algorithm (GA) and the traditional artificial bee colony algorithm (ABC). [ABSTRACT FROM AUTHOR]

To solve the problem of publishing company revenue data, a multiobjective optimization algorithm is proposed. Therefore, based on the research on the multipurpose optimization algorithm, this paper proposed a multipurpose optimization hybrid approval algorithm. The proposed algorithm generates a candidate set through the hybrid recommendation algorithm and then uses the multiobjective optimization algorithm to generate recommendation list with optimal accuracy and diversity. MATLABR2017a was used to calculate the c-metric and hypervolume of the measurement data. Besides, Excel was used to calculate the Pareto solution developed in this paper many times. The test environment is running on 64 bit Win10, running 6 GB memory, and the CPU frequency is 2.30 GHz. Experimental decisions were made by comparing the Pareto optimal solutions developed by the input algorithm and the control algorithm in 3 consecutive groups of experimental users. Experimental analysis shows that Pareto believes that the solution developed by the hybrid approval algorithm is multipurpose optimization, superior to the solution developed by the board, and that the algorithm can be used to create realistic and diverse results. [ABSTRACT FROM AUTHOR]

The lightning search algorithm (LSA) is a novel meta-heuristic optimization method, which is proposed in 2015 to solve constraint optimization problems. This paper presents a comprehensive survey of the applications, variants, and results of the so-called LSA. In LSA, the best-obtained solution is defined to improve the effectiveness of the fitness function through the optimization process by finding the minimum or maximum costs to solve a specific problem. Meta-heuristics have grown the focus of researches in the optimization domain, because of the foundation of decision-making and assessment in addressing various optimization problems. A review of LSA variants is displayed in this paper, such as the basic, binary, modification, hybridization, improved, and others. Moreover, the classes of the LSA's applications include the benchmark functions, machine learning applications, network applications, engineering applications, and others. Finally, the results of the LSA is compared with other optimization algorithms published in the literature. Presenting a survey and reviewing the LSA applications is the chief aim of this survey paper. [ABSTRACT FROM AUTHOR]

The aim of this paper is to present dual optimality conditions for the difference of two non-negative valued affine increasing and radiant (IR) functions. We first give a characterization of dual optimality conditions for the difference of two non-negative valued increasing and radiant (IR) functions. Our approach is based on the Toland-Singer formula. [ABSTRACT FROM AUTHOR]

In this paper, we study the nonsmooth multiobjective optimization problems with equilibrium constraints (MOMPEC). First, we extend the Guignard constraint qualification for MOMPEC, and then more constraint qualifications are developed. Also, the relationships between them are investigated. Moreover, we introduce the notion of primal Pareto stationarity and some dual Pareto stationarity concepts for a feasible point of MOMPEC. Some necessary optimality conditions are derived for any Pareto optimality solution of MOMPEC under weak assumptions. Indeed, we just need the objective functions to be locally Lipschitz. Further, we indicate our defined Pareto stationarity concepts are also sufficient conditions under the generalized convexity requirements. [ABSTRACT FROM AUTHOR]

Despite the great achievements accomplished so far in the field of damage detection, the need for a more comprehensive damage detection approach that effectively functions despite several real-world obstacles still exists. Among different methods suggested so far, model-updating holds the most appeal; however, its accuracy and efficiency are seriously challenged when the problem size grows as it fails to solve the problem with an increase in the number of variables. In this paper, a two-step approach is suggested that reduces the problem size in model updating-based damage detection methods by identifying potentially damaged elements using a static strain-based damage identification index over the first step. Therefore, only a few unknown variables will be introduced to the next step, which involves an iterative model-updating process that includes a novel damage-sensitive objective function to determine damage severities in the located elements of the previous step. In this stage, a meta-heuristic optimizer, the Equilibrium Optimizer, is utilized to detect the unknown variables, i.e., damage values. This optimization algorithm is used given that it has not been applied to damage detection problems before. The method is also tested on a number of numerical examples to be validated and the effects of external factors such as measurement noise can be taken into account. Apart from that, a comparative study is also carried out to compare the efficacy of the present work with previous references. Interestingly, the method is capable of detecting damaged elements with great speed and accuracy, and the quality of the results has not been seriously affected in the presence of perturbing factors. Moreover, information from even a limited number of first modes has been enough to solve the problem, which means that the approach does not require all vibration modes. Finally, an experimental verification study is also carried out to demonstrate the capability of the method in detecting damaged elements in real structures. It is shown that the method can detect the damaged element successfully, which is indicative of the practicality of the suggested technique in real-world applications. [ABSTRACT FROM AUTHOR]

Mixed pixels are the main reason for the low accuracy of traditional remote sensing applications. Hyperspectral image unmixing can explore the sub-pixel information of mixed pixels, which is an effective measure to solve the problems of low precision. Current unmixing methods only consider the correlation of local or global pixels and do not fully utilize images information. Based on the above problems, we proposed a novel sparse unmixing model named combining low-rank constrain for similar superpixels and total variation sparse unmixing (CLRSS-TV) in this current research paper. The adjacent similar pixels are clustered first into superpixels, then the superpixels with the same semantic information are merged into a collection. The spatial information of the image is fully considered by twice clustering. Weighted low-rank constraint is imposed on each collection to consider the spectral correlation of pixels. Moreover, the TV regularization and l2,1 norm are utilized to improve the smoothness and row sparsity, respectively. Experimental results reveal that the proposed method is not only competitive with the four state-of-the-art algorithms in simulated and actual datasets, but also has good anti-noise ability and universality. However, this paper still fails to overcome the problem of parameters selection in sparse unmixing, so the future work study intends to adopt the intelligent optimization algorithm to obtain the optimal parameters. [ABSTRACT FROM AUTHOR]