Search

This paper indicates that the filled function which appeared in one of the papers by Y. L. Shang et al. (2007) is also a tunneling function; that is, we prove that under some general assumptions this function has the characters of both tunneling function and filled function. A solution algorithm based on this T-F function is given and numerical tests from test functions show that our T-F function method is very effective in finding better minima. [ABSTRACT FROM AUTHOR]

This paper proposes a new hybrid optimization method for the phase-frequency characteristics of the double input power system stabilizer (PSS) based on the improved active set algorithm. This method takes the effect of the filtering section optimization on the parameter improvement into account, and the optimized model focuses on the minimum residual sum of squares between the actual and the target phase-frequency characteristics. The result shows that the improved parameters obtained from the proposed method provide much better phase-frequency characteristics than the widely used engineering parameters. The comparison between the proposed method and the typical commercial software indicates the universal superiority of the proposed method. And the studies on the impact of considering the filter section optimization on the phase-frequency improvement show that taking the filter section optimization into account will be beneficial for the phase-frequency improvement, though in application to the PSS2A model and the PSS2B model there are some differences. The achievements obtained in this paper provide a significant reference for the practical PSS parameter modification and improvement. [ABSTRACT FROM AUTHOR]

Most of the current algorithms for solving distributed online optimization problems are based on the first-order method, which are simple in computation but slow in convergence. Newton's algorithm with fast convergence speed needs to calculate the Hessian matrix and its inverse, leading to computationally complex. A distributed online optimization algorithm based on Newton's step is proposed in this paper, which constructs a positive definite matrix by using the first-order information of the objective function to replace the inverse of the Hessian matrix in Newton's method. The convergence of the algorithm is proved theoretically and the regret bound of the algorithm is obtained. Finally, numerical experiments are used to verify the feasibility and efficiency of the proposed algorithm. The experimental results show that the proposed algorithm has an efficient performance on practical problems, compared to several existing gradient descent algorithms. [ABSTRACT FROM AUTHOR]

In this article, a novel methodology has been created based on optimized fuzzy PI controller using position control optimization (PCO). This proposed PCO algorithm ensures better control of brushless direct current motor (BLDCM) in order to reduce steady-state error and oscillation as well as improve the system response by optimizing the speed and position of rotor. The suitability of this technique has been simulated in different stages, so as to infer the optimization in results. The main motivation of this paper is to get better efficiency and optimum response from BLDCM, by comparing its performance characteristics with existing methods. The detailed investigation research through simulation is carried out using MATLAB/Simulink. However, in order to obtain well-defined results, the PCO technique was applied and the performance obtained was highly optimized than previously applied techniques. Through the simulations, the proposed approach can outperform the existing approaches such as PSO and moth-flame algorithm (MFA). [ABSTRACT FROM AUTHOR]

The construction and retrieval of indoor maps are important for indoor positioning and navigation. It is necessary to ensure a good user experience while meeting real-time requirements. Unlike outdoor maps, indoor space is limited, and the relationship between indoor objects is complex which would result in an uneven indoor data distribution and close relationship between the data. A data storage model based on the octree scene segmentation structure was proposed in this paper initially. The traditional octree structure data storage model has been improved so that the data could be backtracked. The proposed method will solve the problem of partition lines within the range of the object data and improve the overall storage efficiency. Moreover, a data retrieval algorithm based on octree storage structure was proposed. The algorithm adopts the idea of "searching for a point, points around the searched point are within the searching range." Combined with the octree neighbor retrieval methods, the closure constraints are added. Experimental results show that using the improved octree storage structure, the retrieval cost is 1/8 of R-tree. However, by using the neighbor retrieval, it improved the search efficiency by about 27% on average. After adding the closure constraint, the retrieval efficiency increases by 25% on average. [ABSTRACT FROM AUTHOR]

HotSpot is an algorithm that can directly mine association rules from real data. Aiming at the problem that the support threshold in the algorithm cannot be set accurately according to the actual scale of the dataset and needs to be set artificially according to experience, this paper proposes a dynamic optimization algorithm with minimum support threshold setting: S_HotSpot algorithm. The algorithm combines simulated annealing algorithm with HotSpot algorithm and uses the global search ability of simulated annealing algorithm to dynamically optimize the minimum support in the solution space. Finally, the Inner Mongolia sandstorm dataset is used for experiment while the wine quality dataset is used for verification, and the association rules screening indicators are set for the mining results. The results show that S_HotSpot algorithm can not only dynamically optimize the selection of support but also improve the quality of association rules as it is mining reasonable number of rules. [ABSTRACT FROM AUTHOR]

Many optimization algorithms have been applied to solve high-dimensional instances of the 0-1 knapsack problem. However, these algorithms often fall into a local optimization trap and thus fail to obtain the global optimal solutions. To circumvent this shortcoming, a hybrid harmony search algorithm with distribution estimation is proposed in this paper. A few important features of the proposed algorithm are as follows: (i) the idea of probability distribution estimation is employed to design the adaptive search strategy, (ii) a fixed improvisation process is presented to improve the algorithm searching ability, (iii) a new method of initialization is used to ensure that the initialization is feasible harmony and (iv) an improved remediation approach is proposed to effectively repair the infeasible solutions. To assess the effectiveness of the proposed algorithm, some experiments are carried out. The experimental results reveal that the proposed algorithm is a reliable and promising alternative for solving the 0-1 knapsack problem. [ABSTRACT FROM AUTHOR]

We consider the problem of the optimization of the functioning of a pumped-storage hydroplant. The problem can be mathematically formulated as an optimal control problem, and when the considered hydromodel is of the fixed-head type, an added complication arises: the solution is of the bangsingular-bang type. In this paper, we propose a simple and efficient optimization algorithm to find the solution. [ABSTRACT FROM AUTHOR]

In order to solve the contradiction between service quality and survival time of wireless sensor networks, a new energy consumption balance model is proposed by shuffled frog leaping algorithm (SFLA). In this model, the mathematical expression of energy consumption in the physical layer is given with transmit power at first, received power, and signal bandwidth, and the objective optimization function of energy consumption balance is built by the total sending energy consumption and transmission power of WSN. Secondly, the long-range dependent characteristic of signal is reduced with wavelet neural network, and the objective optimization function above is solved by shuffled frog leaping algorithm. Finally, the performances between this algorithm and others are studied in simulation experiment, and the results show that this algorithm has greater advantages such as the error frame, the number of survival nodes, and the network lifetime. [ABSTRACT FROM AUTHOR]

The servo system of a permanent-magnet synchronous motor usually consists of current, speed, and position loops. Compared with conventional PI control, finite-control-set model predictive control (FCS-MPC) has the advantage of fast response. Conventional FCS-MPC relies on the precise parameters of system model and has large current ripple. To address that problem, this paper proposed an improved FCS-MPC based on duty ratio optimization in synchronous rotating reference frame. To get more precise voltage vector, the proposed FCS-MPC selects the optimal vector combination and, respectively, calculates the time duration. Moreover, feedback correction is also applied to improve the robustness of the control strategy. The simulation results validate the effectiveness of the algorithm. [ABSTRACT FROM AUTHOR]

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]

Selective harmonics elimination (SHE) is a widely applied control strategy in multilvel inverters for harmonics reduction. SHE is designed for the elimination of low-order harmonics while keeping the fundamental component equal to any previously specified amplitude. This paper proposes a novel bio-inspired metaheuristic optimization algorithm called Black Widow Optimization Algorithm (BWOA) for solving the SHE set of equations. BWOA mimics the spiders' different movement strategies for courtship-mating, guaranteeing the exploration and exploitation of the search space. The optimization results show the reliability of BWOA compared to the state-of-the-art metaheuristic algorithms and show competitive results as a microalgorithm, opening its future application for an on-line optimization calculation in low requirement hardware. [ABSTRACT FROM AUTHOR]

Various black-box optimization problems in real world can be classified as multimodal optimization problems. Neighborhood information plays an important role in improving the performance of an evolutionary algorithm when dealing with such problems. In view of this, we propose a particle swarm optimization algorithm based on dynamic neighborhood to solve the multimodal optimization problem. In this paper, a dynamic ε-neighborhood selection mechanism is first defined to balance the exploration and exploitation of the algorithm. Then, based on the information provided by the neighborhoods, four different particle position updating strategies are designed to further support the algorithm's exploration and exploitation of the search space. Finally, the proposed algorithm is compared with 7 state-of-the-art multimodal algorithms on 8 benchmark instances. The experimental results reveal that the proposed algorithm is superior to the compared ones and is an effective method to tackle multimodal optimization problems. [ABSTRACT FROM AUTHOR]

This paper proposes the shrink Gaussian distribution quantum-behaved optimization (SG-QPSO) algorithm to solve economic dispatch (ED) problems from the power systems area. By shrinking the Gaussian probability distribution near the learning inclination point of each particle iteratively, SG-QPSO maintains a strong global search capability at the beginning and strengthen its local search capability gradually. In this way, SG-QPSO improves the weak local search ability of QPSO and meets the needs of solving the ED optimization problem at different stages. The performance of the SG-QPSO algorithm was obtained by evaluating three different power systems containing many nonlinear features such as the ramp rate limits, prohibited operating zones, and nonsmooth cost functions and compared with other existing optimization algorithms in terms of solution quality, convergence, and robustness. Experimental results show that the SG-QPSO algorithm outperforms any other evaluated optimization algorithms in solving ED problems. [ABSTRACT FROM AUTHOR]

In view of the miniaturization and decentralization characteristics of agricultural equipment factories in China, agricultural equipment manufacturing is well suited to the cloud manufacturing model, but there is no specific research on cloud services optimization for it. To fill the research gap, a cloud service optimization method is proposed in this paper. For the optimization model, the dynamic coefficient strategy and the reliability feedback update strategy are added to the mathematical model to strengthen the applicability of farming season. As optimization algorithm, a dynamic artificial ant-bee colony algorithm (DAABA) based on artificial ant colony algorithm and bee colony algorithm is presented. The optimal fusion evaluation strategy is used to save optimization time by reducing the useless iteration, and the iterative adjustment threshold strategy is adopted to improve the accuracy of cloud service by increasing the size of bee colony. Finally, the performance of DAABA is verified to be more superior by comparing with other algorithms. [ABSTRACT FROM AUTHOR]

Cloud computing is a new computing paradigm to deliver computing resources as services over the Internet. Under such a paradigm, cloud users can rent computing resources from cloud providers to provide their services. The goal of cloud users is to minimize the resource rental cost while meeting the service requirements. In reality, cloud providers often offer multiple pricing models for virtual machine (VM) instances, including on-demand and reserved pricing models. Moreover, the workload of cloud users varies with time and is not known a priori. Therefore, it is challenging for cloud users to determine the optimal cloud resource provisioning. In this paper, we propose a two-phase cloud resource provisioning algorithm. In the first phase, we formulate the resource reservation problem as a two-stage stochastic programming problem, and solve it by the sample average approximation method and the dual decomposition method. In the second phase, we propose a hybrid ARIMA-Kalman model to predict the workload, and determine the number of on-demand instances based on the predicted workload. The effectiveness of the proposed two-phase algorithm is evaluated using a real-world workload trace and Amazon EC2's pricing models. The simulation results show that the proposed algorithm can significantly reduce the operational cost while guaranteeing the service level agreement (SLA). [ABSTRACT FROM AUTHOR]

Scalable Video Coding (SVC) is a powerful solution to video application over heterogeneous networks and diversified end users. In the recent years, works mostly concentrate on transported layers or path for a single layer in the Software-Defined Network (SDN). This paper proposes the Novel Hybrid Optimization Algorithm for Scalable Video Coding (NHO-SVC) based on Genetic Algorithm to select the layer and path simultaneously. The algorithm uses the 0/1 knapsack programming model to set up the model, predicts the network states by the Autoregressive Integrated Moving Average Model (ARIMA), and then, makes decision based on Genetic Algorithm. [ABSTRACT FROM AUTHOR]

We try a new algorithm to solve the generalized Nash equilibrium problem (GNEP) in the paper. First, the GNEP is turned into the nonlinear complementarity problem by using the Karush–Kuhn–Tucker (KKT) condition. Then, the nonlinear complementarity problem is converted into the nonlinear equation problem by using the complementarity function method. For the nonlinear equation equilibrium problem, we design a coevolutionary immune quantum particle swarm optimization algorithm (CIQPSO) by involving the immune memory function and the antibody density inhibition mechanism into the quantum particle swarm optimization algorithm. Therefore, this algorithm has not only the properties of the immune particle swarm optimization algorithm, but also improves the abilities of iterative optimization and convergence speed. With the probability density selection and quantum uncertainty principle, the convergence of the CIQPSO algorithm is analyzed. Finally, some numerical experiment results indicate that the CIQPSO algorithm is superior to the immune particle swarm algorithm, the Newton method for normalized equilibrium, or the quasivariational inequalities penalty method. Furthermore, this algorithm also has faster convergence and better off-line performance. [ABSTRACT FROM AUTHOR]

Conjugate gradient methods are well-known methods which are widely applied in many practical fields. CD conjugate gradient method is one of the classical types. In this paper, a modified three-term type CD conjugate gradient algorithm is proposed. Some good features are presented as follows: (i) A modified three-term type CD conjugate gradient formula is presented. (ii) The given algorithm possesses sufficient descent property and trust region property. (iii) The algorithm has global convergence with the modified weak Wolfe–Powell (MWWP) line search technique and projection technique for general function. The new algorithm has made great progress in numerical experiments. It shows that the modified three-term type CD conjugate gradient method is more competitive than the classical CD conjugate gradient method. [ABSTRACT FROM AUTHOR]

Many people use traditional methods such as quasi-Newton method and Gauss–Newton-based BFGS to solve nonlinear equations. In this paper, we present an improved particle swarm optimization algorithm to solve nonlinear equations. The novel algorithm introduces the historical and local optimum information of particles to update a particle's velocity. Five sets of typical nonlinear equations are employed to test the quality and reliability of the novel algorithm search comparing with the PSO algorithm. Numerical results show that the proposed method is effective for the given test problems. The new algorithm can be used as a new tool to solve nonlinear equations, continuous function optimization, etc., and the combinatorial optimization problem. The global convergence of the given method is established. [ABSTRACT FROM AUTHOR]

In the practical application of WSN (wireless sensor network), location information of the sensor nodes has become one of the essential information pieces in the whole network. At present, some localization algorithms use intelligent optimization algorithm to optimize the node group directly. Although the overall localization error is reduced, the location deviation of individual unknown nodes will be larger, and the large number of iterations will cause a large energy consumption of nodes. Aiming at the above problems, this paper comes up with a two-stage WSN localization algorithm based on the degree of K-value collinearity (DC-K) and improved grey wolf optimization. The first stage is aiming at the defects of the existing collinearity algorithm, putting forward the concept of DC-K, according to the K-value to carry out the initial location in the first stage. The second stage is using the improved grey wolf optimization algorithm to optimize the location results which were obtained in the first stage, so as to get more accurate location results. The experimental results display that this localization algorithm with a better localization accuracy has high robustness and has fewer iterations in the optimization process, which greatly reduces the energy consumption of nodes. [ABSTRACT FROM AUTHOR]

The optimization of high-dimensional functions is an important problem in both science and engineering. Particle swarm optimization is a technique often used for computing the global optimum of a multivariable function. In this paper, we develop a new particle swarm optimization algorithm that can accurately compute the optimal value of a high-dimensional function. The iteration process of the algorithm is comprised of a number of large iteration steps, where a large iteration step consists of two stages. In the first stage, an expansion procedure is utilized to effectively explore the high-dimensional variable space. In the second stage, the traditional particle swarm optimization algorithm is employed to compute the global optimal value of the function. A translation step is applied to each particle in the swarm after a large iteration step is completed to start a new large iteration step. Based on this technique, the variable space of a function can be extensively explored. Our analysis and testing results on high-dimensional benchmark functions show that this algorithm can achieve optimization results with significantly improved accuracy, compared with traditional particle swarm optimization algorithms and a few other state-of-the-art optimization algorithms based on particle swarm optimization. [ABSTRACT FROM AUTHOR]

Back analysis for seepage parameters is a classic issue in hydraulic engineering seepage calculations. Considering the characteristics of inversion problems, including high dimensionality, numerous local optimal values, poor convergence performance, and excessive calculation time, a biological immune mechanism-based quantum particle swarm optimization (IQPSO) algorithm was proposed to solve the inversion problem. By introducing a concentration regulation strategy to improve the population diversity and a vaccination strategy to accelerate the convergence rate, the modified algorithm overcame the shortcomings of traditional PSO which can easily fall into a local optimum. Furthermore, a simple multicore parallel computation strategy was applied to reduce computation time. The effectiveness and practicability of IQPSO were evaluated by numerical experiments. In this paper, taking one concrete face rock-fill dam (CFRD) as a case, a back analysis for seepage parameters was accomplished by utilizing the proposed optimization algorithm and the steady seepage field of the dam was analysed by the finite element method (FEM). Compared with immune PSO and quantum PSO, the proposed algorithm had better global search ability, convergence performance, and calculation rate. The optimized back analysis could obtain the permeability coefficient of CFRD with high accuracy. [ABSTRACT FROM AUTHOR]

To improve convergence speed and search accuracy, this paper proposes an improved quantum-behaved particle swarm optimization algorithm based on Levy flight. The improved algorithm reduces the probability of a local optimal solution through Levy flight and enhances the accuracy of the later search through a postsearch strategy. During the search process, the probability of quantum behavior is retained and the directivity of the particles is strengthened. According to the simulation comparison results, the improved quantum-behaved particle swarm algorithm exhibits faster convergence speed and higher accuracy. [ABSTRACT FROM AUTHOR]

We propose a derivative-free trust region algorithm with a nonmonotone filter technique for bound constrained optimization. The derivative-free strategy is applied for special minimization functions in which derivatives are not all available. A nonmonotone filter technique ensures not only the trust region feature but also the global convergence under reasonable assumptions. Numerical experiments demonstrate that the new algorithm is effective for bound constrained optimization. Locally, optimal parameters with respect to overall computational time on a set of test problems are identified. The performance of the best choice of parameter values obtained by the algorithm we presented which differs from traditionally used values indicates that the algorithm proposed in this paper has a certain advantage for the nondifferentiable optimization problems. [ABSTRACT FROM AUTHOR]

Signal sparse representation has attracted much attention in a wide range of application fields. A central aim of signal sparse representation is to find a sparse solution with the fewest nonzero entries from an underdetermined linear system, which leads to various optimization problems. In this paper, we propose an Adaptive Gradient Projection (AGP) algorithm to solve the piecewise convex optimization in signal sparse representation. To find a sparser solution, AGP provides an adaptive stepsize to move the iteration solution out of the attraction basin of a suboptimal sparse solution and enter the attraction basin of a sparser solution. Theoretical analyses are used to show its fast convergence property. The experimental results of real-world applications in compressed spectrum sensing show that AGP outperforms the traditional detection algorithms in low signal-to-noise-ratio environments. [ABSTRACT FROM AUTHOR]

We introduce a new computational tool called the Boundary Learning Optimization Tool (BLOT) that identifies the boundaries of the performance capabilities achieved by general flexure system topologies if their geometric parameters are allowed to vary from their smallest allowable feature sizes to their largest geometrically compatible feature sizes for given constituent materials. The boundaries generated by the BLOT fully define the design spaces of flexure systems and allow designers to visually identify which geometric versions of their synthesized topologies best achieve desired combinations of performance capabilities. The BLOT was created as a complementary tool to the freedom and constraint topologies (FACT) synthesis approach in that the BLOT is intended to optimize the geometry of the flexure topologies synthesized using the FACT approach. The BLOT trains artificial neural networks to create models of parameterized flexure topologies using numerically generated performance solutions from different design instantiations of those topologies. These models are then used by an optimization algorithm to plot the desired topology’s performance boundary. The model-training and boundary-plotting processes iterate using additional numerically generated solutions from each updated boundary generated until the final boundary is guaranteed to be accurate within any average error set by the user. A FACT-synthesized flexure topology is optimized using the BLOT as a simple case study. [ABSTRACT FROM AUTHOR]

This paper gives a modified Hestenes and Stiefel (HS) conjugate gradient algorithm under the Yuan-Wei-Lu inexact line search technique for large-scale unconstrained optimization problems, where the proposed algorithm has the following properties: (1) the new search direction possesses not only a sufficient descent property but also a trust region feature; (2) the presented algorithm has global convergence for nonconvex functions; (3) the numerical experiment showed that the new algorithm is more effective than similar algorithms. [ABSTRACT FROM AUTHOR]

Innovation and institutional governance are the key enabling factors of cluster ecosystem development. Its synergistic effects play an important role in enhancing ecosystem competitiveness. In this paper, pseudocode language is applied to cluster ecosystem cooperative model reasoning. The coordination and optimization of the innovation system and institutional governance system were studied in a biomedical cluster. Besides, Pearson algorithm was used to test the correlation degree of elements in three Chinese biomedical clusters. The results show that, in Zhangjiang and Nanchang biomedical clusters, the synergistic correlation coefficient between the innovation system and the institutional governance system fluctuates around 0.8. However, in Tonghua biomedical cluster, the synergy correlation coefficient fluctuated around -0.2. The fluctuation range between the two clusters was large. After adjusting the range of order parameters, the rank of synergy trend was Zhangjiang > Nanchang > Tonghua. Finally, further analysis shows that Zhangjiang and Nanchang biomedical clusters can achieve the optimal synergy state by adjusting innovation and institutional governance, but Tonghua cannot. Therefore, the collaboration between the innovation system and institutional governance system provides some reference for the high-quality development of the cluster ecosystem. [ABSTRACT FROM AUTHOR]

A novel filled function is given in this paper to find a global minima for a nonsmooth constrained optimization problem. First, a modified concept of the filled function for nonsmooth constrained global optimization is introduced, and a filled function, which makes use of the idea of the filled function for unconstrained optimization and penalty function for constrained optimization, is proposed. Then, a solution algorithm based on the proposed filled function is developed. At last, some preliminary numerical results are reported. The results show that the proposed approach is promising. [ABSTRACT FROM AUTHOR]

Cloud computing platforms have been extensively using scientific workflows to execute large-scale applications. However, multiobjective workflow scheduling with scientific standards to optimize QoS parameters is a challenging task. Various metaheuristic scheduling techniques have been proposed to satisfy the QoS parameters like makespan, cost, and resource utilization. Still, traditional metaheuristic approaches are incompetent to maintain agreeable equilibrium between exploration and exploitation of the search space because of their limitations like getting trapped in local optimum value at later evolution stages and higher-dimensional nonlinear optimization problem. This paper proposes an improved Fruit Fly Optimization (IFFO) algorithm to minimize makespan and cost for scheduling multiple workflows in the cloud computing environment. The proposed algorithm is evaluated using CloudSim for scheduling multiple workflows. The comparative results depict that the proposed algorithm IFFO outperforms FFO, PSO, and GA. [ABSTRACT FROM AUTHOR]

In the context of cloud computing, one problem that is frequently encountered is task scheduling. This problem has two primary implications, which are the planning of tasks on virtual machines and the attenuation of performance. In order to address the problem of task scheduling in cloud computing, requisite nontraditional optimization attitudes to attain the optima of the problem, the present paper puts forth a hybrid multiple-objective approach called hybrid grey wolf and whale optimization (HGWWO) algorithms, that integrates two algorithms, namely, the grey wolf optimizer (GWO) and the whale optimization algorithm (WOA), with the purpose of conjoining the advantages of each algorithm for minimizing costs, energy consumption, and total execution time needed for task implementation, beside that improving the use of resources. Assessment of the aims of the proposed approach is carried out with the help of the tool known as CloudSim. As pointed out by the results of the experimental work undertaken, the proposed approach has the capability of performing at a superior level by comparison to the original algorithms GWO and WOA on their own with regard to costs, energy consumption, makespan, use of resources, and degree of imbalance. [ABSTRACT FROM AUTHOR]

This paper combines system identification, direct data-driven control, and optimization algorithm to design two controllers for one cascade control system, that is, the inner controller and the outer controller. More specifically, when these two controllers in the cascade control system are parameterized by two unknown parameter vectors, respectively, the problem of controller design is changed to parameter identification. To avoid the modeling process for the unknown plants in the cascade control system, a direct data-driven control scheme is proposed to identify those two parameter vectors through minimizing two optimization problems, which do not need any knowledge of the unknown plants. Furthermore, the detailed first-order gradient algorithm is applied to solve our constructed optimization problems, and its convergence property is also analyzed. To extend the above idea to design a nonlinear controller in the cascade control system, a direct data-driven scheme is proposed to get one optimal nonlinear controller, by using some spectral knowledge. Finally, one simulation example of flight simulation is used to prove the efficiency of our proposed direct data-driven control for the cascade control system. [ABSTRACT FROM AUTHOR]

In order to find the optimal path for emergency evacuation, this paper proposes a dynamic path optimization algorithm based on real-time information to search the optimal path and it takes fire accident as an example to introduce the algorithm principle. Before the accidents, it uses the Dijkstra algorithm to get the prior evacuation network which includes evacuation paths from each node to the exit port. When the accidents occur, the evacuees are unable to pass through the passage where the accident point and the blocking point are located, then the proposed method uses the breadth-first search strategy to solve the path optimization problem based on the prior evacuation network, and it dynamically updates the evacuation path according to the real-time information. Because the prior evacuation network includes global optimal evacuation paths from each node to the exit port, the breadth-first search algorithm only searches local optimal paths to avoid the blockage node or dangerous area. Because the online optimization solves a local pathfinding problem and the entire topology optimization is an offline calculation, the proposed method can find the optimal path in a short time when the accident situation changes. The simulation tests the performances of the proposed algorithm with different situations based on the topology of a building, and the results show that the proposed algorithm is effective to get the optimal path in a short time when it faces changes caused by the factors such as evacuee size, people distribution, blockage location, and accident points. [ABSTRACT FROM AUTHOR]

Reasonable airport runway scheduling is an effective measure to alleviate air traffic congestion. This paper proposes a new model and algorithm for flight scheduling. Considering the factors such as operating conditions and flight safety interval, the runway throughput, flight delays cost, and controller workload composes a multiobjective optimization model. The genetic algorithm combined with sliding time window algorithm is used to solve the model proposed in this paper. Simulation results show that the algorithm presented in this paper gets the optimal results, the runway throughput is increased by 12.87%, the delay cost is reduced by 61.46%, and the controller workload is also significantly reduced compared with FCFS (first come first served). Meanwhile, compared with the general genetic algorithm, it also reduces the time complexity and improves real-time and work efficiency significantly. The analysis results can provide guidance for air traffic controllers to make better air traffic control. [ABSTRACT FROM AUTHOR]

This paper presents a novel differential evolution (DE) algorithm, with its improved version (IDE) for the benchmark functions and the optimal reactive power dispatch (ORPD) problem. Minimization of the total active power loss is usually considered as the objective function of the ORPD problem. The constraints involved are generators, transformers tapings, shunt reactors, and other reactive power sources. The aim of this study is to discover the best vector of control variables to minimize power loss, under the premise of considering the constraints system. In the proposed IDE, a new initialization strategy is developed to construct the initial population for guaranteeing its quality and simultaneously maintaining its diversity. In addition, to enhance the convergence characteristic of the original DE, two kinds of self-adaptive adjustment strategies are employed to update the scaling factor and the crossover factor, respectively, in which the detailed information about the two factors can be exchanged for each generation dynamically. Numerical applications of different cases are carried out on several benchmark functions and two standard IEEE systems, i.e., 14-bus and 30-bus test systems. The results achieved by using the proposed IDE, compared with other optimization algorithms, are discussed and analyzed in detail. The obtained results demonstrated that the proposed IDE can successfully be used to deal with the ORPD problem. [ABSTRACT FROM AUTHOR]

In complex systems like Large-ScaleDistributed Systems (LSDSs) the optimization of resource control is an open issue. The large number of resources and multicriteria optimization requirements make the optimization problem a complex one. The importance of resource control increases with the need of use for industrial process and manufacturing, being a key solution for QoS assuring. This paper presents different solutions for multiobjective decentralized control models for tasks assignment in LSDS. The transaction in real-time complex system is modeled in simulation by tasks which will be scheduled and executed in a distributed system, so a set of specifications and requirements are known. The paper presents a critical analysis of existing solutions and focuses on a genetic-based algorithm for optimization. The contribution of the algorithm is the fitness function that includes multiobjective criteria for optimization in different way. Several experimental scenarios, modeled using simulation, were considered to offer a support for analysis of near-optimal solution for resource selection. [ABSTRACT FROM AUTHOR]

Skyline query computes all the "best" elements which are not dominated by any other elements and thus is very important for decision-making applications. Recently, it is generalized to skyband query and a k-skyband query returns those elements dominated by no more than k, of other elements. To incorporate the skyband operator into the stream engine for monitoring skybands over sliding windows, space usage estimation for skyband operator becomes a critical issue in the query optimizer. In this paper, we firstly introduce the skyband sketch as the cost model. Based on the cost model, we propose an approach for estimating the space usage of skyband operator over sliding windows of data streams under the assumptions of statistical independence across dimensions, no duplicate values over each dimension, and dimension domains totally ordered. Experiments verify that our approaches can estimate the space usage effectively over arbitrarily distributed data. To the best of our knowledge, this is the first work that attempts to address the issue and proposes effective approaches to solve it. [ABSTRACT FROM AUTHOR]

Virtual enterprise (VE) has to manage its risk effectively in order to guarantee the profit. However, restricting the risk in a VE to the acceptable level is considered difficult due to the agility and diversity of its distributed characteristics. First, in this paper, an optimization model for VE risk management based on distributed decision making model is introduced. This optimization model has two levels, namely, the top model and the base model, which describe the decision processes of the owner and the partners of the VE, respectively. In order to solve the proposed model effectively, this work then applies two powerful artificial intelligence optimization techniques known as evolutionary algorithms (EA) and swarm intelligence (SI). Experiments present comparative studies on the VE risk management problem for one EA and three state-of-the-art SI algorithms. All of the algorithms are evaluated against a test scenario, in which the VE is constructed by one owner and different partners. The simulation results show that the PS²O algorithm, which is a recently developed SI paradigm simulating symbiotic coevolution behavior in nature, obtains the superior solution for VE risk management problem than the other algorithms in terms of optimization accuracy and computation robustness. [ABSTRACT FROM AUTHOR]

This paper presents a new approach for the expected cost-to-go functions modeling used in the stochastic dynamic programming (SDP) algorithm. The SDP technique is applied to the longterm operation planning of electrical power systems. Using state space discretization, the Convex Hull algorithm is used for constructing a series of hyperplanes that composes a convex set. These planes represent a piecewise linear approximation for the expected cost-to-go functions. The mean operational costs for using the proposed methodology were compared with those from the deterministic dual dynamic problem in a case study, considering a single inflow scenario. This sensitivity analysis shows the convergence of both methods and is used to determine the minimum discretization level. Additionally, the applicability of the proposed methodology for two hydroplants in a cascade is demonstrated. With proper adaptations, this work can be extended to a complete hydrothermal system. [ABSTRACT FROM AUTHOR]

This study proposes a novel method of optimal path planning in stochastic constraint network scenarios. We present a dynamic stochastic grid network model containing semienclosed narrow and long constraint information according to the unstructured environment of an underground or mine tunnel. This novel environment modeling (stochastic constraint grid network) computes the most likely global path in terms of a defined minimum traffic cost for a roadheader in such unstructured environments. Designing high-dimensional constraint vector and traffic cost in nodes and arcs based on two- and three-dimensional terrain elevation data in a grid network, this study considers the walking and space constraints of a roadheader to construct the network topology for the traffic cost value weights. The improved algorithm of variation self-adapting particle swarm optimization is proposed to optimize the regional path. The experimental results both in the simulation and in the actual test model settings illustrate the performance of the described approach, where a hybrid, centralized-distributed modeling method with path planning capabilities is used. [ABSTRACT FROM AUTHOR]

Iris localization is one of the most important processes in iris recognition. Because of different kinds of noises in iris image, the localization result may be wrong. Besides this, localization process is time-consuming. To solve these problems, this paper develops an efficient iris localization algorithm via optimization model. Firstly, the localization problem is modeled by an optimization model. Then SIFT feature is selected to represent the characteristic information of iris outer boundary and eyelid for localization. And SDM (Supervised Descent Method) algorithm is employed to solve the final points of outer boundary and eyelids. Finally, IRLS (Iterative Reweighted Least-Square) is used to obtain the parameters of outer boundary and upper and lower eyelids. Experimental result indicates that the proposed algorithm is efficient and effective. [ABSTRACT FROM AUTHOR]

The adaptive operator selection (AOS) and the adaptive parameter control are widely used to enhance the search power in many multiobjective evolutionary algorithms. This paper proposes a novel adaptive selection strategy with bandits for the multiobjective evolutionary algorithm based on decomposition (MOEA/D), named latest stored information based adaptive selection (LSIAS). An improved upper confidence bound (UCB) method is adopted in the strategy, in which the operator usage rate and abandonment of extreme fitness improvement are introduced to improve the performance of UCB. The strategy uses a sliding window to store recent valuable information about operators, such as factors, probabilities, and efficiency. Four common used DE operators are chosen with the AOS, and two kinds of assist information on operator are selected to improve the operators search power. The operator information is updated with the help of LSIAS and the resulting algorithmic combination is called MOEA/D-LSIAS. Compared to some well-known MOEA/D variants, the LSIAS demonstrates the superior robustness and fast convergence for various multiobjective optimization problems. The comparative experiments also demonstrate improved search power of operators with different assist information on different problems. [ABSTRACT FROM AUTHOR]

Optimizing the mutual coherence of a learned dictionary plays an important role in sparse representation and compressed sensing. In this paper, a efficient framework is developed to learn an incoherent dictionary for sparse representation. In particular, the coherence of a previous dictionary (or Gram matrix) is reduced sequentially by finding a new dictionary (or Gram matrix), which is closest to the reference unit norm tight frame of the previous dictionary (or Gram matrix). The optimization problem can be solved by restricting the tightness and coherence alternately at each iteration of the algorithm. The significant and different aspect of our proposed framework is that the learned dictionary can approximate an equiangular tight frame. Furthermore, manifold optimization is used to avoid the degeneracy of sparse representation while only reducing the coherence of the learned dictionary. This can be performed after the dictionary update process rather than during the dictionary update process. Experiments on synthetic and real audio data show that our proposed methods give notable improvements in lower coherence, have faster running times, and are extremely robust compared to several existing methods. [ABSTRACT FROM AUTHOR]

Considering any connected network with unknown initial states for all nodes, the nearest-neighbor rule is utilized for each node to update its own state at every discrete-time step. Distributed function calculation problem is defined for one node to compute some function of the initial values of all the nodes based on its own observations. In this paper, taking into account uncertainties in the network and observations, an algorithm is proposed to compute and explicitly characterize the value of the function in question when the number of successive observations is large enough. While the number of successive observations is not large enough, we provide an approach to obtain the tightest possible bounds on such function by using linear programing optimization techniques. Simulations are provided to demonstrate the theoretical results. [ABSTRACT FROM AUTHOR]

Feature scaling has attracted considerable attention during the past several decades because of its important role in feature selection. In this paper, a novel algorithm for learning scaling factors of features is proposed. It first assigns a nonnegative scaling factor to each feature of data and then adopts a generalized performance measure to learn the optimal scaling factors. It is of interest to note that the proposed model can be transformed into a convex optimization problem: second-order cone programming (SOCP). Thus the scaling factors of features in our method are globally optimal in some sense. Several experiments on simulated data, UCI data sets, and the gene data set are conducted to demonstrate that the proposed method is more effective than previous methods. [ABSTRACT FROM AUTHOR]

This work proposes an analysis on the generalization capabilities for the modified version of the classic Jiles-Atherton model for magnetic hysteresis. The modified model takes into account the use of dynamic parameterization, as opposed to the classic model where the parameters are constant. Two different dynamic parameterizations are taken into account: a dependence on the excitation and a dependence on the response. The identification process is performed by using a novel nonlinear optimization technique called Continuous Flock-of-Starling Optimization Cube (CFSO3), an algorithm belonging to the class of swarm intelligence. The algorithm exploits parallel architecture and uses a supervised strategy to alternate between exploration and exploitation capabilities. Comparisons between the obtained results are presented at the end of the paper. [ABSTRACT FROM AUTHOR]

The flexible job shop scheduling problem (FJSSP) is a practical extension of classical job shop scheduling problem that is known to be NP-hard. In this paper, an effective modified biogeography-based optimization (MBBO) algorithm with machine-based shifting is proposed to solve FJSSP with makespan minimization. The MBBO attaches great importance to the balance between exploration and exploitation. At the initialization stage, different strategies which correspond to two-vector representation are proposed to generate the initial habitats. At global phase, different migration and mutation operators are properly designed. At local phase, a machine-based shifting decoding strategy and a local search based on insertion to the habitat with best makespan are introduced to enhance the exploitation ability. A series of experiments on two well-known benchmark instances are performed. The comparisons between MBBO and other famous algorithms as well as BBO variants prove the effectiveness and efficiency of MBBO in solving FJSSP. [ABSTRACT FROM AUTHOR]

Besides inheriting the properties of classical Bézier curves of degree n, the corresponding λ-Bézier curves have a good performance on adjusting their shapes by changing shape control parameter. Specially, in the case where the shape control parameter equals zero, the λ-Bézier curves degenerate to the classical Bézier curves. In this paper, the shape modification of λ-Bézier curves by constrained optimization of position and tangent vector is investigated. The definition and properties of λ-Bézier curves are given in detail, and the shape modification is implemented by optimizing perturbations of control points. At the same time, the explicit formulas of modifying control points and shape parameter are obtained by Lagrange multiplier method. Using this algorithm, λ-Bézier curves are modified to satisfy the specified constraints of position and tangent vector, meanwhile the shape-preserving property is still retained. In order to illustrate its ability on adjusting the shape of λ-Bézier curves, some curve design applications are discussed, which show that the proposed method is effective and easy to implement. [ABSTRACT FROM AUTHOR]

A fractional order PID (FOPID) controller, which is suitable for control system designing for being insensitive to the variation in system parameter, is proposed for hydroturbine governing system in the paper. The simultaneous optimization for several parameters of controller, that is, Ki, Kd, Kp, λ, and μ, is done by a recently developed metaheuristic nature-inspired algorithm, namely, the firefly algorithm (FA), for the first time, where the selecting, moving, attractiveness behavior between fireflies and updating of brightness, and decision range are studied in detail to simulate the optimization process. Investigation clearly reveals the advantages of the FOPID controller over the integer controllers in terms of reduced oscillations and settling time. The present work also explores the superiority of FA based optimization technique in finding optimal parameters of the controller. Further, convergence characteristics of the FA are compared with optimum integer order PID (IOPID) controller to justify its efficiency. What is more, analysis confirms the robustness of FOPID controller under isolated load operation conditions. [ABSTRACT FROM AUTHOR]