Parallel chaos optimization algorithm with migration and merging operation

Chaos optimization algorithm (COA) utilizes the chaotic maps to generate the pseudo-random sequences mapped as the decision variables for global optimization applications. A kind of parallel chaos optimization algorithm (PCOA) has been proposed in our former studies to improve COA. The salient feature of PCOA lies in its pseudo-parallel mechanism. However, all individuals in the PCOA search independently without utilizing the fitness and diversity information of the population. In view of the limitation of PCOA, a novel PCOA with migration and merging operation (denoted as MMO-PCOA) is proposed in this paper. Specifically, parallel individuals are randomly selected to be conducted migration and merging operation with the so far parallel solutions. Both migration and merging operation exchange information within population and produce new candidate individuals, which are different from those generated by stochastic chaotic sequences. Consequently, a good balance between exploration and exploitation can be achieved in the MMO-PCOA. The impacts of different one-dimensional maps and parallel numbers on the MMO-PCOA are also discussed. Benchmark functions and parameter identification problems are used to test the performance of the MMO-PCOA. Simulation results, compared with other optimization algorithms, show the superiority of the proposed MMO-PCOA algorithm.     

Weighted Superposition Attraction (WSA): A swarm intelligence algorithm for optimization problems – Part 2: Constrained optimization

This paper is the second one of the two papers entitled “Weighted Superposition Attraction (WSA) Algorithm”, which is about the performance evaluation of the WSA algorithm in solving the constrained global optimization problems. For this purpose, the well-known mechanical design optimization problems, design of a tension/compression coil spring, design of a pressure vessel, design of a welded beam and design of a speed reducer, are selected as test problems. Since all these problems were formulated as constrained global optimization problems, WSA algorithm requires a constraint handling method for tackling them. For this purpose we have selected 6 formerly developed constraint handling methods for adapting into WSA algorithm and analyze the effect of the used constraint handling method on the performance of the WSA algorithm. In other words, we have the aim of producing concluding remarks over the performance and robustness of the WSA algorithm through a set of computational study in solving the constrained global optimization problems. Computational study indicates the robustness and the effectiveness of the WSA in terms of obtained results, reached level of convergence and the capability of coping with the problems of premature convergence, trapping in a local optima and stagnation.     

Control theory for stochastic distributed parameter systems,an engineering perspective

The main purpose of this paper is to survey some recent progresses on control theory for stochastic distributed parameter systems, i.e., systems governed by stochastic differential equations in infinite dimensions, typically by stochastic partial differential equations. We will explain the new phenomenon and difficulties in the study of controllability and optimal control problems for one dimensional stochastic parabolic equations and stochastic hyperbolic equations. In particular, we shall see that both the formulation of corresponding stochastic control problems and the tools to solve them may differ considerably from their deterministic/finite-dimensional counterparts. More importantly, one has to develop new tools, say, the stochastic transposition method introduced in our previous works, to solve some problems in this field.     

Multiobjective PSO based adaption of neural network topology for pixel classification in satellite imagery

The proposed work involves the multiobjective PSO based adaption of optimal neural network topology for the classification of multispectral satellite images. It is per pixel supervised classification using spectral bands (original feature space). This paper also presents a thorough experimental analysis to investigate the behavior of neural network classifier for given problem. Based on 1050 number of experiments, we conclude that following two critical issues needs to be addressed: (1) selection of most discriminative spectral bands and (2) determination of optimal number of nodes in hidden layer. We propose new methodology based on multiobjective particle swarm optimization (MOPSO) technique to determine discriminative spectral bands and the number of hidden layer node simultaneously. The accuracy with neural network structure thus obtained is compared with that of traditional classifiers like MLC and Euclidean classifier. The performance of proposed classifier is evaluated quantitatively using Xie-Beni and β indexes. The result shows the superiority of the proposed method to the conventional one.     

Liner services network design and fleet deployment with empty container repositioning

Transportation demand of shipping container fluctuates due to the seasonality of international trade, thus, every 3–6 months, the liner company has to alter its current liner shipping service network, redeploy ships and design cargo routes with the objective of minimizing the total cost. To solve the problem, the paper presents a mixed integer linear program model. The proposed model incorporates several relevant constraints, such as weekly frequency, the transshipment of cargo between two or more service routes, and transport time. Extensive numerical experiments based on realistic date of Asia–Europe–Oceania shipping operations show that the proposed model can solve real-case problems efficiently by CPLEX. The results demonstrate that the model can reduce ship’s capacity consumption and raise ships’ capacity utilization.     

An optimization model for evaluating the economic impact of availability and maintenance notions during the synthesis and design of a power plant

In this paper, we introduce an optimization strategy in order to comprehensively quantify the impact of availability and maintenance notions during the early stages of synthesis and design of a new natural gas combined cycle power plant. A detailed state-space approach is thoroughly discussed, where influence of maintenance funds on each component's repair rate is directly assessed.In this context, analysis of the reliability characteristics of the system is centered at two designer-adopted parameters, which largely influence the obtained results: the number of components which may fail independently at the same time, and the number of simultaneous failure/repair events.Then, optimal solutions are evaluated as the availability-related parameters and the amount of resources assigned for maintenance actions are varied across a wide range of feasible values, which enable obtaining more accurate and detailed estimations of the expected economic performance for the project when compared with traditional economic evaluation approaches.     

A Global Maximum Error Controller Based Nonlinearity Aware TPWL Method for Reducing Nonlinear Systems

Abstract

Model order reduction is a common practice to reduce large order systems so that their simulation and control become easy. Nonlinearity aware trajectory piecewise linear is a variation of trajectory piecewise linearization technique of order reduction that is used to reduce nonlinear systems. With this scheme, the reduced approximation of the system is generated by weighted sum of the linearized and reduced sub-models obtained at certain linearization points on the system trajectory. This scheme uses dynamically inspired weight assignment that makes the approximation nonlinearity aware. Just as weight assignment, the process of linearization points selection is also important for generating faithful approximations. This article uses a global maximum error controller based linearization points selection scheme according to which a state is chosen as a linearization point if the error between a current reduced model and the full order nonlinear system reaches a maximum value. A combination that not only selects linearization points based on an error controller but also assigns dynamic inspired weights is shown in this article. The proposed scheme generates approximations with higher accuracies. This is demonstrated by applying the proposed method to some benchmark nonlinear circuits including RC ladder network and inverter chain circuit and comparing the results with the conventional schemes.     

A review on some classes of algebraic systems

ABSTRACT

In this paper, we review some algebraic control system. Precisely, linear and bilinear systems on Euclidean spaces and invariant and linear systems on Lie groups. The fourth classes of systems have a common issue: to any class, there exists an associated subgroup. From this object, we survey the controllability property. Especially, from those coming from our contribution to the theory.     

A new decomposition based evolutionary algorithm with uniform designs for many-objective optimization

For many-objective optimization problems, how to get a set of solutions with good convergence and diversity is a difficult and challenging work. In this paper, a new decomposition based evolutionary algorithm with uniform designs is proposed to achieve the goal. The proposed algorithm adopts the uniform design method to set the weight vectors which are uniformly distributed over the design space, and the size of the weight vectors neither increases nonlinearly with the number of objectives nor considers a formulaic setting. A crossover operator based on the uniform design method is constructed to enhance the search capacity of the proposed algorithm. Moreover, in order to improve the convergence performance of the algorithm, a sub-population strategy is used to optimize each sub-problem. Comparing with some efficient state-of-the-art algorithms, e.g., NSGAII-CE, MOEA/D and HypE, on six benchmark functions, the proposed algorithm is able to find a set of solutions with better diversity and convergence.     

Global optimization for power dispatch problems based on theory of moments

Non-convex of an optimal power dispatch problem makes it difficult to guarantee the global optimum. This paper presents a convex relaxation approach, called the Moment Semidefinite Programming (MSDP) method, to facilitate the search for deterministic global optimal solutions. The method employs a sequence of moments, which can linearize polynomial functions and construct positive semidefinite moment matrices, to form an SDP convex relaxation for power dispatch problems. In particular, the rank of the moment matrix is used as a sufficient condition to ensure the global optimality. The same condition can also be leveraged to estimate the number of global optimal solution(s). This method is effectively applied to {0,1}-economic dispatch (ED) problems and optimal power flow (OPF) problems. Simulation results showed that the MSDP method is capable of solving {0,1}-ED problems with integer values directly, and is able to identify if more than one global optimal solutions exist. In additional, the method can obtain rank-1 moment matrices for OPF’s counterexamples of existing SDP method, this ensures the global solution and overcomes the problem that existing SDP method cannot meet the rank-1 condition sometimes.