Continuous piecewise linear programming via concave optimization and genetic algorithm
Authors:
- 1 December 2012
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 01912216,p. 2509-2514
Abstract
This paper describes continuous piecewise linear (CPWL) programming where the objective and constraints are in the form of hinging hyperplane (HH). And HH has received wide attention due to its simplicity and good performance in system identification. When solving a CPWL programming problem, some excellent features inspire us to come up with more efficient algorithms: the two distinguished states of a hinge function reminds us of application of genetic algorithm, while the piecewise linearity and concavity of the problem of minimization of HH naturally lead to the usage of well developed methods for concave programming, such as the cutting plane method. In order to find the global minima, we propose an improved genetic algorithm (GA) incorporating the cutting plane method. The main improvement lies in three aspects. First, it utilizes binary strings that derive local minima as chromosomes, with the proposed local minima locating method. Second, a stopping criterion has been established to ensure the global optimality of GA, with the structure information provided by γ extension of local minima. And third, genetic operations have also been revised to enhance the performance of the algorithm, which is assessed by the computational experiments.Keywords
This publication has 21 references indexed in Scilit:
- Convergence of genetic algorithmsPattern Recognition and Image Analysis, 2006
- Implementation of min–max MPC using hinging hyperplanes. Application to a heat exchangerControl Engineering Practice, 2004
- A nonlinear model predictive control system based on Wiener piecewise linear modelsJournal of Process Control, 2003
- Control of a solution copolymerization reactor using multi-model predictive controlChemical Engineering Science, 2003
- Polyhedral mixture of linear experts for many-to-one mapping inversion and multiple controllersNeurocomputing, 2001
- Recent developments and trends in global optimizationJournal of Computational and Applied Mathematics, 2000
- Dynamically scheduled MPC of nonlinear processes using hinging hyperplane modelsAIChE Journal, 1998
- On the hinge-finding algorithm for hingeing hyperplanesIEEE Transactions on Information Theory, 1998
- Convergence analysis of canonical genetic algorithmsIEEE Transactions on Neural Networks, 1994
- Global Optimization1990