113 results
Search Results
2. A novel Grouping Coral Reefs Optimization algorithm for optimal mobile network deployment problems under electromagnetic pollution and capacity control criteria.
- Author
-
Salcedo-Sanz, Sancho, García-Díaz, Pilar, Del Ser, Javier, Bilbao, Miren Nekane, and Portilla-Figueras, José Antonio
- Subjects
- *
ALGORITHMS , *POLLUTION , *MATHEMATICAL optimization , *MATHEMATICAL models , *MATHEMATICAL analysis - Abstract
This paper proposes a novel optimization algorithm for grouping problems, the Grouping Coral Reefs Optimization algorithm, and describes its application to a Mobile Network Deployment Problem (MNDP) under four optimization criteria. These criteria include economical cost and coverage, and also electromagnetic pollution control and capacity constraints imposed at the base stations controllers, which are novel in this study. The Coral Reefs Optimization algorithm (CRO) is a recently-proposed bio-inspired approach for optimization, based on the simulation of the processes that occur in coral reefs, including reproduction, fight for space or depredation. This paper presents a grouping version of the CRO, which has not previously evaluated before. Grouping meta-heuristics are characterized by variable-length encoding solutions, and have been successfully applied to a number of different optimization and assignment problems. The GCRO proposed is a novel contribution to the intelligent systems field, which is able to improve results obtained by two alternative grouping algorithms such as grouping genetic algorithms and grouping Harmony Search. The performance of the proposed GCRO and the algorithms for comparison has been tested with real data in a case study of a MNDP in Alcalá de Henares, Madrid, Spain. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
3. An algorithmic approach to group decision making problems under fuzzy and dynamic environment.
- Author
-
Gupta, Mahima and Mohanty, B.K.
- Subjects
- *
ALGORITHMS , *FUZZY systems , *MATHEMATICAL optimization , *MATHEMATICAL models , *MATHEMATICAL analysis - Abstract
Our paper introduces a new methodology to solve group decision-making problems under fuzzy and dynamic environment. The methodology takes group members’ linguistically defined pair wise preferences of alternatives in different time intervals and aggregates them across the intervals to obtain each member's net preference levels. Each member's net preference levels are again aggregated across the members to obtain the group's preference. Our paper attaches higher importance to the members whose involvement in the decision process is more recent than the members who opined their views in the past. The fuzzy aggregation operator, IOWA (Induced Ordered Weighted Average) is used to aggregate their views in accordance to their importance in the group. The Ranked_List algorithm, introduced in our paper, inputs the aggregated views of the members in pair wise form and produces the set of sequences of ranked list of alternatives representing the group's consensus view as output. The Ranked_List algorithm is validated and analyzed through a series of synthetic data sets and its results are compared with a movie selection case study. The methodology is illustrated with a numerical example. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
4. Queuing search algorithm: A novel metaheuristic algorithm for solving engineering optimization problems.
- Author
-
Zhang, Jinhao, Xiao, Mi, Gao, Liang, and Pan, Quanke
- Subjects
- *
ALGORITHMS , *MATHEMATICAL optimization , *MATHEMATICAL analysis , *CONSUMERS , *CUSTOMER services - Abstract
This paper presents a novel metaheuristic algorithm called queuing search (QS), which is inspired from human activities in queuing. Some common phenomena are considered in QS: (1) customers actively follow the queue that provides fast service; (2) each customer service is mainly affected by the staff or customer itself; and (3) a customer can be influenced by others during the service when the queue order is not strictly maintained. The performance of QS is tested on 30 bound-constrained benchmark functions scalable with 30 and 100 dimensions from CEC 2014, 5 standard and 4 challenging constrained engineering optimization problems. Meanwhile, comparisons are performed among the results of QS and some state-of-the-art or well-known metaheuristic algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
5. Multi-objective optimization of an integrated gasification combined cycle for hydrogen and electricity production.
- Author
-
Al-Zareer, Maan, Dincer, Ibrahim, and Rosen, Marc A.
- Subjects
- *
MATHEMATICAL optimization , *HYDROGEN , *ELECTRICITY , *ALGORITHMS , *MATHEMATICAL analysis - Abstract
In this paper, an integrated coal gasification combined cycle system for the production of hydrogen and electricity is optimized in terms of energy and exergy efficiencies, and the amount and cost of the produced hydrogen and electricity. The integrated system is optimized by focusing on the conversion process of coal to syngas. A novel optimization process is developed which integrates an artificial neural network with a genetic algorithm. The gasification system is modeled and simulated with Aspen Plus for large ranges of operating conditions, where the artificial neural network method is used to represent the simulation results mathematically. The mathematical model is then optimized using a genetic algorithm method. The optimization demonstrates that the lower is the grade of coal of the three considered coals, the less expensive is the hydrogen and electricity that can be produced by the considered integrated gasification combined cycle (IGCC) system. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
6. Optimal tracking control of artificial gas-lift process.
- Author
-
Shi, Jing, Al-Durra, Ahmed, and Boiko, Igor
- Subjects
- *
COMPUTER simulation , *ALGORITHMS , *CHOKED flow (Fluid dynamics) , *MATHEMATICAL optimization , *MATHEMATICAL analysis - Abstract
Artificial gas-lift (AGL) technique is commonly used to enhance oil production when the reservoir pressure in wells is not enough to sustain acceptable oil flow rate. However, the gas-lift wells are prone to instability, characterized by regular oscillations of pressure and flow. This phenomenon is known as casing-heading instability. It results in production loss and negative impact on downstream equipment, and has been a challenging problem to both industry and academia. In this paper, a novel concept of optimal tracking control is proposed for stabilization and operating mode transition in gas-lift wells when casing-heading phenomenon occurs. The stability of artificial gas-lift process is ensured by manipulating both gas lift choke and oil production choke, where the openings of both choke valves can vary from fully closed to fully open. Through the simulation of the open-loop system, a stability map of AGL process is produced. Then a trajectory optimization algorithm is developed based on this stability map, which is synthesized with a tracking controller to achieve trajectory optimization control. Also, a nonlinear state observer is designed to ensure estimation of unmeasurable variables. Through simulation studies, the effectiveness of proposed trajectory optimization control is demonstrated. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
7. On the computation and physical interpretation of semi-positive reaction network invariants.
- Author
-
Alobaid, Aisha, Salami, Hossein, and Adomaitis, Raymond A.
- Subjects
- *
CHEMICAL reactions , *INVARIANTS (Mathematics) , *ALGORITHMS , *MATHEMATICAL optimization , *MATHEMATICAL analysis - Abstract
In this paper, we examine the mathematical structure of chemical reaction networks with the goals of identifying reaction invariant states and determining their physical significance. A combined species-reaction graph/convex analysis approach is developed to find semi-positive invariant states associated with a reaction network. Application of this graphical/algebraic reaction network analysis approach to four different chemical processes reveals that reaction invariants can represent conserved quantities other than elemental balances. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
8. Advances and trends in visual crowd analysis: A systematic survey and evaluation of crowd modelling techniques.
- Author
-
Zitouni, M. Sami, Bhaskar, H., Dias, J., and Al-Mualla, M.E.
- Subjects
- *
ARTIFICIAL neural networks , *ARTIFICIAL intelligence , *MATHEMATICAL optimization , *MATHEMATICAL analysis , *ALGORITHMS - Abstract
Visual recognition of crowd dynamics has had a huge impact on several applications including surveillance, situation awareness, homeland security and intelligent environments. However, the state-of-the-art in crowd analysis has become diverse due to factors such as: (a) the underlying definition of a crowd, (b) the constituent elements of the crowd processing model, (c) its application, hence (d) the dataset and (e) the evaluation criteria available for benchmarking. Although such diversity is healthy, the techniques for crowd modelling thus developed have failed to establish credibility therefore becoming unreliable and of questionable validity across different research disciplines. This paper aims to give an account of such issues by deducing key statistical evidence from the existing literature and providing recommendations towards focusing on the general aspects of techniques rather than any specific algorithm. The advances and trends in crowd analysis are drawn in the context of crowd modelling studies published in leading journals and conferences over the past 7 years. Finally, this paper shall also provide a qualitative and quantitative comparison of some existing methods using various publicly available crowd datasets to substantiate some of the theoretical claims. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
9. A three-term conjugate gradient algorithm for large-scale unconstrained optimization problems.
- Author
-
Deng, Songhai and Wan, Zhong
- Subjects
- *
MATHEMATICAL optimization , *PROBLEM solving , *APPROXIMATION theory , *ALGORITHMS , *STOCHASTIC convergence , *MATHEMATICAL analysis - Abstract
In this paper, a three-term conjugate gradient algorithm is developed for solving large-scale unconstrained optimization problems. The search direction at each iteration of the algorithm is determined by rectifying the steepest descent direction with the difference between the current iterative points and that between the gradients. It is proved that such a direction satisfies the approximate secant condition as well as the conjugacy condition. The strategies of acceleration and restart are incorporated into designing the algorithm to improve its numerical performance. Global convergence of the proposed algorithm is established under two mild assumptions. By implementing the algorithm to solve 75 benchmark test problems available in the literature, the obtained results indicate that the algorithm developed in this paper outperforms the existent similar state-of-the-art algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
10. Guided color consistency optimization for image mosaicking.
- Author
-
Xie, Renping, Xia, Menghan, Yao, Jian, and Li, Li
- Subjects
- *
ALGORITHMS , *MATHEMATICAL optimization , *MACHINE theory , *MATHEMATICAL analysis , *MACHINE translating , *SYSTEM analysis - Abstract
This paper studies the problem of color consistency correction for sequential images with diverse color characteristics. Existing algorithms try to adjust all images to minimize color differences among images under a unified energy framework, however, the results are prone to presenting a consistent but unnatural appearance when the color difference between images is large and diverse. In our approach, this problem is addressed effectively by providing a guided initial solution for the global consistency optimization, which avoids converging to a meaningless integrated solution. First of all, to obtain the reliable intensity correspondences in overlapping regions between image pairs, we creatively propose the histogram extreme point matching algorithm which is robust to image geometrical misalignment to some extents. In the absence of the extra reference information, the guided initial solution is learned from the major tone of the original images by searching some image subset as the reference, whose color characteristics will be transferred to the others via the paths of graph analysis. Thus, the final results via global adjustment will take on a consistent color similar to the appearance of the reference image subset. Several groups of convincing experiments on both the synthetic dataset and the challenging real ones sufficiently demonstrate that the proposed approach can achieve as good or even better results compared with the state-of-the-art approaches. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
11. Detecting community structure in complex networks using an interaction optimization process.
- Author
-
Kim, Paul and Kim, Sangwook
- Subjects
- *
COMMUNITY organization , *MATHEMATICAL optimization , *ALGORITHMS , *MATHEMATICAL analysis , *STRUCTURAL analysis (Science) - Abstract
Most complex networks contain community structures. Detecting these community structures is important for understanding and controlling the networks. Most community detection methods use network topology and edge density to identify optimal communities; however, these methods have a high computational complexity and are sensitive to network forms and types. To address these problems, in this paper, we propose an algorithm that uses an interaction optimization process to detect community structures in complex networks. This algorithm efficiently searches the candidates of optimal communities by optimizing the interactions of the members within each community based on the concept of greedy optimization. During this process, each candidate is evaluated using an interaction-based community model. This model quickly and accurately measures the difference between the quantity and quality of intra- and inter-community interactions. We test our algorithm on several benchmark networks with known community structures that include diverse communities detected by other methods. Additionally, after applying our algorithm to several real-world complex networks, we compare our algorithm with other methods. We find that the structure quality and coverage results achieved by our algorithm surpass those of the other methods. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
12. Enhanced parallel cat swarm optimization based on the Taguchi method
- Author
-
Tsai, Pei-Wei, Pan, Jeng-Shyang, Chen, Shyi-Ming, and Liao, Bin-Yih
- Subjects
- *
MATHEMATICAL optimization , *TAGUCHI methods , *ALGORITHMS , *TECHNOLOGY , *ITERATIVE methods (Mathematics) , *INDUSTRIES , *PARTICLE swarm optimization , *MATHEMATICAL analysis - Abstract
Abstract: In this paper, we present an enhanced parallel cat swarm optimization (EPCSO) method for solving numerical optimization problems. The parallel cat swarm optimization (PCSO) method is an optimization algorithm designed to solve numerical optimization problems under the conditions of a small population size and a few iteration numbers. The Taguchi method is widely used in the industry for optimizing the product and the process conditions. By adopting the Taguchi method into the tracing mode process of the PCSO method, we propose the EPCSO method with better accuracy and less computational time. In this paper, five test functions are used to evaluate the accuracy of the proposed EPCSO method. The experimental results show that the proposed EPCSO method gets higher accuracies than the existing PSO-based methods and requires less computational time than the PCSO method. We also apply the proposed method to solve the aircraft schedule recovery problem. The experimental results show that the proposed EPCSO method can provide the optimum recovered aircraft schedule in a very short time. The proposed EPCSO method gets the same recovery schedule having the same total delay time, the same delayed flight numbers and the same number of long delay flights as the . The optimal solutions can be found by the proposed EPCSO method in a very short time. [Copyright &y& Elsevier]
- Published
- 2012
- Full Text
- View/download PDF
13. Penalty function methods and a duality gap for invex optimization problems
- Author
-
Antczak, Tadeusz
- Subjects
- *
DUALITY theory (Mathematics) , *MATHEMATICAL optimization , *NONCONVEX programming , *LAGRANGIAN functions , *MATHEMATICAL analysis , *ALGORITHMS - Abstract
Abstract: In this paper, the penalty function method is used to study duality in nonconvex mathematical programming problems. In particular, we prove the zero duality gap between optimization problems involving invex functions with respect to the same function η and their Lagrangian dual problems. The results proved in the paper are illustrated by suitable examples of nonconvex optimization problems. [Copyright &y& Elsevier]
- Published
- 2009
- Full Text
- View/download PDF
14. Optimized polygonal approximation by dominant point deletion
- Author
-
Masood, Asif
- Subjects
- *
ALGORITHMS , *POLYGONAL numbers , *MATHEMATICAL optimization , *MATHEMATICAL analysis - Abstract
Abstract: An algorithm for polygonal approximation based on dominant point (DP) deletion is presented in this paper. The algorithm selects an initial set of DPs and starts eliminating them one by one depending upon the error associated with each DP. The associated error value is based on global measure. A local optimization of few neighboring points is performed after each deletion. Although the algorithm does not guarantee an optimal solution, the combination of local and global optimization is expected to produce optimal results. The algorithm is extensively tested on various shapes with varying number of DPs and error threshold. In general, optimal results were observed for about 96% of the times. A good comparative study is also presented in this paper [Copyright &y& Elsevier]
- Published
- 2008
- Full Text
- View/download PDF
15. Simulation of IPA gradients in hybrid network systems
- Author
-
Melamed, Benjamin, Pan, Shuo, and Wardi, Yorai
- Subjects
- *
MATHEMATICAL optimization , *DIFFERENTIABLE dynamical systems , *STOCHASTIC systems , *ALGORITHMS , *MATHEMATICAL analysis - Abstract
Infinitesimal perturbation analysis (IPA) provides formulas for random gradients (derivatives) of performance measures with respect to parameters of interest, computed from sample paths of stochastic systems. In practice, IPA derivatives may be computed either from simulation runs or from empirical field data (when the formulas are nonparametric). Nonparametric IPA derivatives in fluid-flow queues have been recently derived for the loss volume and time average of buffer occupancy, with respect to buffer size, and arrival-rate or service-rate parameters. Additionally, these IPA derivatives have been shown to be unbiased in the sense that their expectation and differentiation operators commute, while their traditional discrete counterparts have long been known to be generally biased. Recent work has further shown how to map the computation of IPA derivatives from a fluid-flow queue to a compatible discrete counterpart without an appreciable loss of accuracy in performance measures. Thus, this work holds the promise of potential applications of IPA derivatives to gradient-based optimization of objective functions involving performance metrics parameterized by settable parameters in a queueing network context. This paper is an empirical study of IPA derivatives of individual queues within queueing systems which model telecommunications networks and some of their protocols. As a testbed, we used HNS (Hybrid Network Simulator) — a hybrid Java simulator of queueing networks with traffic streams subject to several telecommunications protocols. More specifically, the hybrid feature of HNS admits models with mixtures of discrete (packet) flows and continuous (fluid) flows, and collects detailed statistics and IPA derivatives for all flow types. The paper outlines the mapping of IPA derivatives from the fluid domain to the packet domain as implemented in HNS, and studies the accuracy of IPA derivatives in compatible fluid and packet queueing models, as well as the stabilization of their values in time. Our experimental results lend empirical support to the contention that IPA derivatives can be accurately computed from discrete versions by adopting a fluid-flow view. Furthermore, the long-run values of various IPA derivatives are empirically shown to stabilize quite fast. Finally, the results provide the basis and motivation for IPA applications to the optimization of telecommunications network design and to potential new open-loop protocols that take advantage of IPA information. [Copyright &y& Elsevier]
- Published
- 2007
- Full Text
- View/download PDF
16. A fuzzy MCDM method for solving marine transshipment container port selection problems
- Author
-
Chou, Chien-Chang
- Subjects
- *
FUZZY algorithms , *ALGORITHMS , *MATHEMATICAL optimization , *MATHEMATICAL analysis - Abstract
Abstract: “Transshipment” is a very popular and important issue in the present international trade container transportation market. In order to reduce the international trade container transportation operation cost, it is very important for shipping companies to choose the best transshipment container port. The aim of this paper is to present a new Fuzzy Multiple Criteria Decision Making Method (FMCDM) for solving the transshipment container port selection problem under fuzzy environment. In this paper we present first the canonical representation of multiplication operation on three fuzzy numbers, and then this canonical representation is applied to the selection of transshipment container port. Based on the canonical representation, the decision maker of shipping company can determine quickly the ranking order of all candidate transshipment container ports and select easily the best one. [Copyright &y& Elsevier]
- Published
- 2007
- Full Text
- View/download PDF
17. A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan
- Author
-
Lian, Zhigang, Jiao, Bin, and Gu, Xingsheng
- Subjects
- *
PRODUCTION scheduling , *ALGORITHMS , *MATHEMATICAL optimization , *MATHEMATICAL analysis - Abstract
Abstract: The job-shop scheduling problem (JSSP) is a branch of production scheduling, and it is well known that this problem is NP-hard. Many different approaches have been applied to JSSP and a rich harvest has been obtained. However, some JSSP, even with moderate size, cannot be solved to guarantee optimality. The standard particle optimization algorithm generally is used to solve continuous optimization problems, and is used rarely to solve discrete problems such as JSSP. This paper presents a similar PSO algorithm to solve JSSP. At the same time, some new valid algorithm operators are proposed in this paper, and through simulation we find out the effectiveness of them. Three representative (Taillard) instances were made by computational experiments, through comparing the SPSO algorithm with standard GA, and we obtained that the SPSOA is more clearly efficacious than standard GA for JSSP to minimize makespan. [Copyright &y& Elsevier]
- Published
- 2006
- Full Text
- View/download PDF
18. Crowded comparison operators for constraints handling in NSGA-II for optimal design of the compensation system in electrical distribution networks
- Author
-
Favuzza, S., Ippolito, M.G., and Sanseverino, E. Riva
- Subjects
- *
MATHEMATICAL optimization , *GENETIC algorithms , *ALGORITHMS , *MATHEMATICAL analysis , *COMBINATORIAL optimization - Abstract
Abstract: This paper proposes an improvement of an efficient multiobjective optimization algorithm, Non-dominated Sorting Genetic Algorithm II, NSGA-II, that has been here applied to solve the problem of optimal capacitors placement in distribution systems. The studied improvement involves the Crowded Comparison Operator and modifies it in order to handle several constraints. The problem of optimal location and sizing of capacitor banks for losses reduction and voltage profile flattening in medium voltage (MV) automated distribution systems is a difficult combinatorial constrained optimization problem which is deeply studied in literature. In this paper, the efficiency of the proposed Crowded Comparison Operator, CCO1, is compared to the efficiency of another Crowded Comparison Operator, CCO2, whose definition derives from the constraint-domination principle proposed by Deb et al. The two operators are tested on difficult test problems as well as on the optimal capacitors placement problem. [Copyright &y& Elsevier]
- Published
- 2006
- Full Text
- View/download PDF
19. A new filled function method for unconstrained global optimization
- Author
-
Yang, Yongjian and Shang, Youlin
- Subjects
- *
MATHEMATICS , *ALGORITHMS , *MATHEMATICAL optimization , *MATHEMATICAL analysis - Abstract
Abstract: In this paper, a new definition of the filled function is given, it is different from the primary definition which was given by Ge in paper [R.P. Ge, A filled function method for finding a global minimzer of a function of several variables, Math. Program. 46 (1990) 191–204]. Based on the definition, a new filled function is proposed, and it has better properties. An algorithm for unconstrained global optimization is developed from the new filled function. The implementation of the algorithm on several test problems is reported with satisfactory numerical results. [Copyright &y& Elsevier]
- Published
- 2006
- Full Text
- View/download PDF
20. Time-Invariant Dynamic Systems identification based on the qualitative features of the response
- Author
-
Flores, Juan J. and Pastor, Nelio
- Subjects
- *
ALGORITHMS , *MATHEMATICAL optimization , *ELECTRIC circuits , *MATHEMATICAL analysis - Abstract
Abstract: The problem of Systems Identification starts with a time-series of observed data and tries to determine the simplest model capable of exhibiting the observed behavior. This optimization problem searches the model from a space of possible models. In this paper, we present the theory and algorithms to perform Qualitative and Quantitative Systems Identification for Linear Time-Invariant Dynamic Systems. The methods described here are based on successive elimination of the components of the system''s response. Sinusoidals of high frequencies are eliminated first, then their carrying waves. We continue with the process until we obtain a non-oscillatory carrier. At this point, we determine the order of the carrier. This procedure allows us to determine how many sinusoidal components and exponential components are found in the impulse response of the system under study. The number of components determines the order of the system. The paper is composed of two important parts, the statement of some mathematical properties of the responses of Linear Time Invariant Dynamic Systems, and the proposal of a set of filters that allows us to implement the recognition algorithm. We present the application of the proposed methodology to analyze and model the electrical circuits and electrical power systems. [Copyright &y& Elsevier]
- Published
- 2005
- Full Text
- View/download PDF
21. DC programming and DCA for sparse optimal scoring problem.
- Author
-
Le Thi, Hoai An and Phan, Duy Nhat
- Subjects
- *
ALGORITHMS , *MATHEMATICAL functions , *MATHEMATICAL analysis , *MATHEMATICAL optimization , *COMPUTER programming - Abstract
Linear Discriminant Analysis (LDA) is a standard tool for classification and dimension reduction in many applications. However, the problem of high dimension is still a great challenge for the classical LDA. In this paper we consider the supervised pattern classification in the high dimensional setting, in which the number of features is much larger than the number of observations and present a novel approach to the sparse optimal scoring problem using the zero-norm. The difficulty in treating the zero-norm is overcome by using appropriate continuous approximations such that the resulting problems are solved by alternating schemes based on DC (Difference of Convex functions) programming and DCA (DC Algorithms). The experimental results on both simulated and real datasets show the efficiency of the proposed algorithms compared to the five state-of-the-art methods. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
22. Recursive minimum component algorithms for parameter estimation of dynamic systems.
- Author
-
Li, Huxiong, Mu, Bingxian, and Zuo, Lei
- Subjects
- *
ALGORITHMS , *MATHEMATICAL analysis , *MATHEMATICAL optimization , *DYNAMICAL systems , *STOCHASTIC systems - Abstract
Minimum component analysis is an elegant and promising approach to system identification. This paper focuses on developing related recursive algorithms. Two algorithms are presented. In the first approach, rank-one modification is used to get an accurate and quickly convergent algorithm. However, its drawback is low computational efficiency. Therefore, the second algorithm is proposed to realize faster computation. The simulation results verify the effectiveness of both algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
23. A hybrid backtracking search optimization algorithm for nonlinear optimal control problems with complex dynamic constraints.
- Author
-
Su, Zikang, Wang, Honglun, and Yao, Peng
- Subjects
- *
ALGORITHMS , *MATHEMATICAL analysis , *MATHEMATICAL optimization , *NONLINEAR systems , *DYNAMICAL systems - Abstract
Nonlinear optimal control (NOC) problem with complex dynamic constraints (CDC) is difficult to compute even with direct method. In this paper, a hybrid two-stage approach integrating an improved backtracking search optimization algorithm (IBSA) with the hp-adaptive Gauss pseudo-spectral methods (hpGPM) is proposed. Firstly, BSA is improved to enhance its convergent speed and the global search ability, by adopting the harmony search strategy and an adaptive amplitude control factor with individual optimum fitness feedback. Then, at the beginning stage of the hybrid search process, an initialization generator is constructed using IBSA to find a near optimum solution. When the change in fitness function approaches to a predefined value which is small enough, the search process is replaced by hpGPM to accelerate the search process and find an accurate solution. By this way, the hybrid algorithm is able to find a global optimum more quickly and accurately. Two NOC problems with CDC are examined using the proposed algorithm, and the corresponding Monte Carlo simulations are conducted. The comparison results show the hybrid algorithm achieves better performance in convergent speed, accuracy and robustness. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
24. On-line twin independent support vector machines.
- Author
-
Alamdar, Fatemeh, Ghane, Sara, and Amiri, Ali
- Subjects
- *
PATTERN recognition systems , *PATTERN perception , *ALGORITHMS , *MATHEMATICAL optimization , *MATHEMATICAL analysis - Abstract
The success of SVM in solving pattern recognition problems has encouraged researcher to extend the development of different versions. They are well-known for their robustness and good generalization performance. In many real-world applications, the data to be trained are available on-line in a sequential fashion and because of space and time requirements, batch training methods are not suitable. This paper proposes a new fast on-line algorithm called OTWISVM. It defines two optimization problems and incremental learning is done based of them. Two hyperplanes are generated as decision functions thus each of them is closer to one of the two classes and is as far as possible from the other. The solution is constructed via two subsets of linearly independent samples seen so far, and is always bounded. Good accuracy and notable speed of the method was tested and affirmed both on ordinary and noisy data sets as opposed to similar algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
25. A unified associative memory model based on external inputs of continuous recurrent neural networks.
- Author
-
Zhou, Caigen, Zeng, Xiaoqin, Yu, Jianjiang, and Jiang, Haibo
- Subjects
- *
ARTIFICIAL neural networks , *ARTIFICIAL intelligence , *ALGORITHMS , *MATHEMATICAL optimization , *MATHEMATICAL analysis - Abstract
A unified associative memory model with a novel method for designing associative memories is presented in this paper. Based on continuous recurrent neural networks, bipolar patterns inputted from external can cause the output of neural networks to be memorized patterns. In the method, two conditions relevant to external inputs are derived to ensure the network states converge to a stable interval, and an exponential stable criterion is proposed for the network being a bipolar associative memory with higher recall speed. By introducing a tunable slope activation function and considering time delay, the proposed model is general and can recall the memorized patterns in auto-associative and hetero-associative way, while higher robust and more flexible memory can be obtained through the proposed method. Experimental verification demonstrates the effectiveness and generalization of the proposed method. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
26. An optimized second order stochastic learning algorithm for neural network training.
- Author
-
Liew, Shan Sung, Khalil-Hani, Mohamed, and Bakhteri, Rabia
- Subjects
- *
MACHINE learning , *ARTIFICIAL neural networks , *ALGORITHMS , *MATHEMATICAL optimization , *MATHEMATICAL analysis - Abstract
This paper proposes an improved stochastic second order learning algorithm for supervised neural network training. The proposed algorithm, named bounded stochastic diagonal Levenberg–Marquardt (B-SDLM), utilizes both gradient and curvature information to achieve fast convergence while requiring only minimal computational overhead than the stochastic gradient descent (SGD) method. B-SDLM has only a single hyperparameter as opposed to most other learning algorithms that suffer from the hyperparameter overfitting problem due to having more hyperparameters to be tuned. Experiments using the multilayer perceptron (MLP) and convolutional neural network (CNN) models have shown that B-SDLM outperforms other learning algorithms with regard to the classification accuracies and computational efficiency (about 5.3% faster than SGD on the mnist-rot-bg-img database). It can classify all testing samples correctly on the face recognition case study based on AR Purdue database. In addition, experiments on handwritten digit classification case studies show that significant improvements of 19.6% on MNIST database and 17.5% on mnist-rot-bg-img database can be achieved in terms of the testing misclassification error rates (MCRs). The computationally expensive Hessian calculations are kept to a minimum by using just 0.05% of the training samples in its estimation or updating the learning rates once per two training epochs, while maintaining or even achieving lower testing MCRs. It is also shown that B-SDLM works well in the mini-batch learning mode, and we are able to achieve 3.32 × performance speedup when deploying the proposed algorithm in a distributed learning environment with a quad-core processor. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
27. Research on dynamic modeling and simulation of axial-flow pumping system based on RBF neural network.
- Author
-
Wu, Qinghui, Wang, Xinjun, and Shen, Qinghuan
- Subjects
- *
PUMPING machinery , *ARTIFICIAL neural networks , *ALGORITHMS , *MATHEMATICAL optimization , *MATHEMATICAL analysis - Abstract
Dynamic model is an important issue for research on stability, dynamic characteristics, surge and control technique of axial-flow pumping system, and such a model is usually characterized by complex nonlinearity, strong coupling and time-varying mathematical equation. For the convenience of establishing model and highly effective computing, dynamic characteristics of the whole system are divided into four parts: pump lift-flow characteristics, pipeline characteristics, mechanical characteristics of asynchronous motor and torque characteristics of pump load. Each part is a nonlinear subsystem, and there are complex coupling relations among each other. In the paper, each part of the pump system is modeled respectively by mechanisms of hydrodynamics, transmission dynamics, electromechanics and affinity law. Considering that the axial-flow pump is characterized by nonlinearity and parameters are difficultly estimated in the low flow operation area and that the data of pump head-flow can be easily tested under the speed of power frequency, a modeling method combined with the RBF neural network is proposed, where hidden layer parameters are optimized by K means clustering algorithm, and the weights are trained by least square method. At last the whole simulation model of the axial-flow pumping system is set up, and the validity of the proposed modeling method is verified through simulation. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
28. Quantized subgradient algorithm with limited bandwidth communications for solving distributed optimization over general directed multi-agent networks.
- Author
-
Huang, Chicheng, Li, Huaqing, Xia, Dawen, and Xiao, Li
- Subjects
- *
ALGORITHMS , *MATHEMATICAL models , *MATHEMATICAL analysis , *MATHEMATICAL optimization , *DATA transmission systems - Abstract
In this paper, we consider the quantized distributed optimization problem over general directed digital multi-agent networks, where the communication channels have limited data transmission rates. To solve the optimization problem, a distributed quantized subgradient algorithm is presented among agents. Based on an encoder–decoder scheme and a zoom-in technique, we can achieve not only a consensus, but also an optimal solution. In particular, we study two cases of the quantization levels of each connected directed digital communication channel. One is under the case that the quantization levels are time-varying at each time step, and the other is under the case of fixed quantization level. Two rigorous theoretical analyses are performed and the optimal solutions can be obtained asymptotically. Moreover, the upper bound of the quantization levels at each time step and the convergence rate are analytically characterized. The effectiveness of proposed algorithm is demonstrated by two illustrative examples. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
29. Multi-attribute search framework for optimizing extended belief rule-based systems.
- Author
-
Yang, Long-Hao, Wang, Ying-Ming, Su, Qun, Fu, Yang-Geng, and Chin, Kwai-Sang
- Subjects
- *
DECISION making , *BIG data , *ALGORITHMS , *MATHEMATICAL optimization , *MATHEMATICAL analysis - Abstract
The advantages and applications of rule-based systems have caused them to be widely recognized as one of the most popular systems in human decision-making, due to their accuracy and efficiency. To improve the performance of rule-based systems, there are several issues proposed to be focused. First, it is unnecessary to take the entire rule base into consideration during each decision-making process. Second, there is no need to visit the entire rule base to search for the key rules. Last, the key rules for each decision-making process should be different. This paper focuses on an advanced extended belief rule base (EBRB) system and proposes a multi-attribute search framework (MaSF) to reconstruct the relationship between rules in the EBRB to form the MaSF-based EBRB. MaSFs can be divided into k -dimensional tree (KDT)-based MaSFs and Burkhard–Keller (BKT)-based MaSFs. The former is targeted at decision-making problems with small-scale attribute datasets, while the latter is for those with large-scale attribute datasets. Based on the MaSF-based EBRB, the k -neighbor search and the best activated rule set algorithms are further proposed to find both the unique and the desired rules for each decision-making process without visiting the entire EBRB, especially when handling classification problems with large attribute datasets. Two sets of experiments based on benchmark datasets with different numbers of attributes are performed to analyze the difference between KDT-based MaSFs and BKT-based MaSFs, and to demonstrate how to use MaSFs to improve the accuracy and efficiency of EBRB systems. MaSFs and their corresponding algorithms are also regarded as a general optimization framework that can be used with other rule-based systems. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
30. An optimisation-oriented model of distributed supply-chain
- Author
-
Ghirardi, Marco, Menga, Giuseppe, and Sacco, Nicola
- Subjects
- *
MATHEMATICAL models , *MATHEMATICAL optimization , *SUPPLY chains , *ALGORITHMS , *LAGRANGIAN functions , *MATHEMATICAL analysis - Abstract
Abstract: In this paper, a suitable model of distributed supply-chains (DSCs) is presented with the aim of providing a tool for DSC decentralised optimisation. To cope with this challenge, in the first part of the paper, a general model for distributed supply-chain including suppliers, processing units, assemblers, and transportation systems is presented with the aim of keeping the framework as general as possible. In the second part of the paper, an optimisation algorithm is also discussed. [Copyright &y& Elsevier]
- Published
- 2008
- Full Text
- View/download PDF
31. An ensemble of intelligent water drop algorithms and its application to optimization problems.
- Author
-
Alijla, Basem O., Wong, Li-Pei, Lim, Chee Peng, Khader, Ahamad Tajudin, and Al-Betar, Mohammed Azmi
- Subjects
- *
ALGORITHMS , *COMPUTER programming , *MATHEMATICAL models , *MATHEMATICAL analysis , *MATHEMATICAL optimization - Abstract
The Intelligent Water Drop (IWD) algorithm is a recent stochastic swarm-based method that is useful for solving combinatorial and function optimization problems. In this paper, we propose an IWD ensemble known as the Master-River, Multiple-Creek IWD (MRMC-IWD) model, which serves as an extension of the modified IWD algorithm. The MRMC-IWD model aims to improve the exploration capability of the modified IWD algorithm. It comprises a master river which cooperates with multiple independent creeks to undertake optimization problems based on the divide-and-conquer strategy. A technique to decompose the original problem into a number of sub-problems is first devised. Each sub-problem is then assigned to a creek, while the overall solution is handled by the master river. To empower the exploitation capability, a hybrid MRMC-IWD model is introduced. It integrates the iterative improvement local search method with the MRMC-IWD model to allow a local search to be conducted, therefore enhancing the quality of solutions provided by the master river. To evaluate the effectiveness of the proposed models, a series of experiments pertaining to two combinatorial problems, i.e., the travelling salesman problem (TSP) and rough set feature subset selection (RSFS), are conducted. The results indicate that the MRMC-IWD model can satisfactorily solve optimization problems using the divide-and-conquer strategy. By incorporating a local search method, the resulting hybrid MRMC-IWD model not only is able to balance exploration and exploitation, but also to enable convergence towards the optimal solutions, by employing a local search method. In all seven selected TSPLIB problems, the hybrid MRMC-IWD model achieves good results, with an average deviation of 0.021% from the best known optimal tour lengths. Compared with other state-of-the-art methods, the hybrid MRMC-IWD model produces the best results (i.e. the shortest and uniform reducts of 20 runs) for all13 selected RSFS problems. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
32. Stud krill herd algorithm.
- Author
-
Wang, Gai-Ge, Gandomi, Amir H., and Alavi, Amir H.
- Subjects
- *
ALGORITHMS , *MATHEMATICAL optimization , *GLOBAL optimization , *MATHEMATICAL analysis , *STOCHASTIC convergence , *MATHEMATICAL functions , *SWARM intelligence - Abstract
Abstract: Recently, Gandomi and Alavi proposed a meta-heuristic optimization algorithm, called Krill Herd (KH), for global optimization [Gandomi AH, Alavi AH. Krill Herd: A New Bio-Inspired Optimization Algorithm. Communications in Nonlinear Science and Numerical Simulation, 17(12), 4831–4845, 2012.]. This paper represents an optimization method to global optimization using a novel variant of KH. This method is called the Stud Krill Herd (SKH). Similar to genetic reproduction mechanisms added to KH method, an updated genetic reproduction schemes, called stud selection and crossover (SSC) operator, is introduced into the KH during the krill updating process dealing with numerical optimization problems. The introduced SSC operator is originated from original Stud genetic algorithm. In SSC operator, the best krill, the Stud, provides its optimal information for all the other individuals in the population using general genetic operators instead of stochastic selection. This approach appears to be well capable of solving various functions. Several problems are used to test the SKH method. In addition, the influence of the different crossover types on convergence and performance is carefully studied. Experimental results indicate an instructive addition to the portfolio of swarm intelligence techniques. [Copyright &y& Elsevier]
- Published
- 2014
- Full Text
- View/download PDF
33. Solving 0-1 knapsack problems based on amoeboid organism algorithm.
- Author
-
Zhang, Xiaoge, Huang, Shiyan, Hu, Yong, Zhang, Yajuan, Mahadevan, Sankaran, and Deng, Yong
- Subjects
- *
KNAPSACK problems , *PROBLEM solving , *ALGORITHMS , *DISCRETE systems , *MATHEMATICAL optimization , *NUMERICAL analysis , *MATHEMATICAL analysis - Abstract
Abstract: The 0-1 knapsack problem is an open issue in discrete optimization problems, which plays an important role in real applications. In this paper, a new bio-inspired model is proposed to solve this problem. The proposed method has three main steps. First, the 0-1 knapsack problem is converted into a directed graph by the network converting algorithm. Then, for the purpose of using the amoeboid organism model, the longest path problem is transformed into the shortest path problem. Finally, the shortest path problem can be well handled by the amoeboid organism algorithm. Numerical examples are given to illustrate the efficiency of the proposed model. [Copyright &y& Elsevier]
- Published
- 2013
- Full Text
- View/download PDF
34. Minimum flow problem on network flows with time-varying bounds
- Author
-
Salehi Fathabadi, H., Khodayifar, S., and Raayatpanah, M.A.
- Subjects
- *
MATHEMATICAL optimization , *ALGORITHMS , *PATTERN perception , *GRAPH theory , *MATHEMATICAL analysis , *MATHEMATICAL models - Abstract
Abstract: In this paper, we consider the minimum flow problem on network flows in which the lower arc capacities vary with time. We will show that this problem for set {0,1,…, T} of time points can be solved by at most n minimum flow computations, by combining of preflow-pull algorithm and reoptimization techniques (no matter how many values of T are given). Running time of the presented algorithm is O(n 2 m). [Copyright &y& Elsevier]
- Published
- 2012
- Full Text
- View/download PDF
35. Homological optimality in Discrete Morse Theory through chain homotopies
- Author
-
Molina-Abril, Helena and Real, Pedro
- Subjects
- *
HOMOLOGY theory , *MATHEMATICAL optimization , *MORSE theory , *HOMOTOPY theory , *ALGORITHMS , *MATHEMATICAL analysis , *VECTOR fields - Abstract
Abstract: Morse theory is a fundamental tool for analyzing the geometry and topology of smooth manifolds. This tool was translated by Forman to discrete structures such as cell complexes, by using discrete Morse functions or equivalently gradient vector fields. Once a discrete gradient vector field has been defined on a finite cell complex, information about its homology can be directly deduced from it. In this paper we introduce the foundations of a homology-based heuristic for finding optimal discrete gradient vector fields on a general finite cell complex K. The method is based on a computational homological algebra representation (called homological spanning forest or HSF, for short) that is an useful framework to design fast and efficient algorithms for computing advanced algebraic-topological information (classification of cycles, cohomology algebra, homology A(∞)-coalgebra, cohomology operations, homotopy groups, …). Our approach is to consider the optimality problem as a homology computation process for a chain complex endowed with an extra chain homotopy operator. [Copyright &y& Elsevier]
- Published
- 2012
- Full Text
- View/download PDF
36. A novel P systems based optimization algorithm for parameter estimation of proton exchange membrane fuel cell model
- Author
-
Yang, Shipin and Wang, Ning
- Subjects
- *
PROTON exchange membrane fuel cells , *MATHEMATICAL optimization , *ALGORITHMS , *SIMULATION methods & models , *PARAMETER estimation , *MUTATIONS (Algebra) , *STOCHASTIC convergence , *MATHEMATICAL analysis - Abstract
Abstract: Accurate kinetic models are of great significance for the simulation and analysis for hydrogen fuel cells. The proton exchange membrane (PEM) fuel cell is a complex nonlinear, multi-variable system. The mathematical modeling of PEM fuel cell usually leads to nonlinear parameter estimation problems which often contain more than one minimum. In this paper, a novel bio-inspired P systems based optimization algorithm, named BIPOA, is proposed to solve PEM fuel cell model parameter estimation problems. In BIPOA, the nested membrane structure and new rules such as adaptive mutation rule, partial migration rule and autophagy rule are combined to improve the algorithm''s global search capacities and convergence accuracy. Studies on some benchmark test functions indicate that the BIPOA outperforms the other two methods (PSOPS and GAs) in both convergence speed and accuracy. In addition, experimental results reveal that the model predictive outputs are in better agreement with the actual experimental data. Therefore, the BIPOA is a helpful and reliable technique for estimating the PEM fuel cell model parameters and is available to other complex parameter estimation problems of fuel cell models. [Copyright &y& Elsevier]
- Published
- 2012
- Full Text
- View/download PDF
37. Application of generalized diagonal dominance in wireless sensor network optimization problems
- Author
-
Cvetković, Lj. and Kostić, V.
- Subjects
- *
WIRELESS sensor networks , *MATHEMATICAL optimization , *ALGORITHMS , *GAME theory , *MATRICES (Mathematics) , *MATHEMATICAL analysis - Abstract
Abstract: The recent application of the diagonal dominance in the development of the optimization algorithms in the wireless sensor networks design, has been done by Yuan and Yu (2006) , extended in Yu et al. (2006) , and surveyed in Machado and Tekinay . In this paper, we will use the concept of generalized diagonal dominance, to improve the obtained results regarding the power control game, in three directions. We also discuss the applicability of such improvements. [Copyright &y& Elsevier]
- Published
- 2012
- Full Text
- View/download PDF
38. Plant-wide control strategy applied to the Tennessee Eastman process at two operating points
- Author
-
Molina, G.D., Zumoffen, D.A.R., and Basualdo, M.S.
- Subjects
- *
CONTROL theory (Engineering) , *CHEMICAL plants , *ENERGY consumption , *MATHEMATICAL analysis , *MATHEMATICAL optimization , *DYNAMO (Computer program language) , *ALGORITHMS - Abstract
Abstract: This work presents a new plant-wide control strategy able to be applied on large scale chemical plants. It is based on an extension of the non square relative gain array (NRG) theoretical concepts, introduced by Chang and Yu (1990), and the generalized relative disturbance gain (GRDG) presented in Chang and Yu (1992). The extension of the NRG is useful for searching the best group of controlled variables (CVs) independently of the problem dimensionality. Meanwhile, the extension of the GRDG allows configure the loops pairing by considering the trade-off between servo and regulator behavior. It can be done thanks to define a proper function, named net load effect, accounting both set point and disturbances effects. Even though these concepts are not new, the main contribution of this paper is the selection of the adequate objective function. It is mathematically expressed in a new way, in terms of Frobenius norm of specific matrices related with the models of the plant and very useful for evaluating the process interaction. Then, it drives the search supported by genetic algorithms (GA), which evaluates all the possible combinations of input–output variables. It allows to solve successfully and with less computational effort the combinatorial optimization problem, even though the high dimension usually involved in large scale chemical plants. The use of the relative gain array (RGA) can also be considered for pairing purpose, but in some cases it could drive to a less effective structure. The use of relative normalized gain array (RNGA) for pairing the selected CVs with the most suitable MVs is able to lead to best control structures only if a dynamic model of the plant is available. Therefore, it must be emphasized that this approach is developed for working in cases where only steady-state plant information is available. However, if a dynamic model is disposable too the algorithm is extended to use it. In addition, a mathematical demonstration is presented so as to understand why is possible to find a well conditioned control structure. The methodology is tested in the Tennessee Eastman (TE) process at the base case proposed by Downs and Vogel (1992), and at an optimized working point presented by Ricker (1995). Both working points show two quite different scenarios. Thus, a set of dynamic simulations for both cases and the hardware requirements compared to the previous suggested are given to proof the capacity of this approach. [Copyright &y& Elsevier]
- Published
- 2011
- Full Text
- View/download PDF
39. An extended one-versus-rest support vector machine for multi-label classification
- Author
-
Xu, Jianhua
- Subjects
- *
SUPPORT vector machines , *LEARNING classifier systems , *MACHINE learning , *ALGORITHMS , *COMPUTER science , *QUADRATIC programming , *MATHEMATICAL optimization , *MATHEMATICAL analysis - Abstract
Abstract: Hybrid strategy, which generalizes a specific single-label algorithm while one or two data decomposition tricks are applied implicitly or explicitly, has become an effective and efficient tool to design and implement various multi-label classification algorithms. In this paper, we extend traditional binary support vector machine by introducing an approximate ranking loss as its empirical loss term to build a novel support vector machine for multi-label classification, resulting into a quadratic programming problem with different upper bounds of variables to characterize label correlation of individual instance. Further, our optimization problem can be solved via combining one-versus-rest data decomposition trick with modified binary support vector machine, which dramatically reduces computational cost. Experimental study on ten multi-label data sets illustrates that our method is a powerful candidate for multi-label classification, compared with four state-of-the-art multi-label classification approaches. [Copyright &y& Elsevier]
- Published
- 2011
- Full Text
- View/download PDF
40. Image segmentation by iterated region merging with localized graph cuts
- Author
-
Peng, Bo, Zhang, Lei, Zhang, David, and Yang, Jian
- Subjects
- *
DIGITAL image processing , *ALGORITHMS , *MATHEMATICAL optimization , *GRAPHIC methods , *EXPERIMENTS , *MATHEMATICAL analysis - Abstract
Abstract: This paper presents an iterated region merging-based graph cuts algorithm which is a novel extension of the standard graph cuts algorithm. Graph cuts addresses segmentation in an optimization framework and finds a globally optimal solution to a wide class of energy functions. However, the extraction of objects in a complex background often requires a lot of user interaction. The proposed algorithm starts from the user labeled sub-graph and works iteratively to label the surrounding un-segmented regions. In each iteration, only the local neighboring regions to the labeled regions are involved in the optimization so that much interference from the far unknown regions can be significantly reduced. Meanwhile, the data models of the object and background are updated iteratively based on high confident labeled regions. The sub-graph requires less user guidance for segmentation and thus better results can be obtained under the same amount of user interaction. Experiments on benchmark datasets validated that our method yields much better segmentation results than the standard graph cuts and the Grabcut methods in either qualitative or quantitative evaluation. [Copyright &y& Elsevier]
- Published
- 2011
- Full Text
- View/download PDF
41. A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems
- Author
-
Ben-Ameur, Walid and Neto, José
- Subjects
- *
MATHEMATICAL optimization , *POLYNOMIALS , *ALGORITHMS , *QUADRATIC programming , *COMBINATORIAL geometry , *MATHEMATICAL analysis - Abstract
Abstract: Determining the cells of an arrangement of hyperplanes is a classical problem in combinatorial geometry. In this paper we present an efficient recursive procedure to solve it. In fact, by considering a connection between the latter problem and optimality conditions of unconstrained quadratic optimization problems in the following form: , with , we can show the proposed algorithm solves problems of the form in polynomial time when the rank of the matrix is fixed and the number of its positive diagonal entries is . [Copyright &y& Elsevier]
- Published
- 2011
- Full Text
- View/download PDF
42. Directed searching optimization algorithm for constrained optimization problems
- Author
-
Zou, Dexuan, Liu, Haikuan, Gao, Liqun, and Li, Steven
- Subjects
- *
MATHEMATICAL optimization , *CONSTRAINED optimization , *STOCHASTIC convergence , *FUNCTIONAL analysis , *ALGORITHMS , *GENETIC mutation , *VECTOR analysis , *BIODIVERSITY , *MATHEMATICAL analysis - Abstract
Abstract: A directed searching optimization algorithm (DSO) is proposed to solve constrained optimization problems in this paper. The proposed algorithm includes two important operations — position updating and genetic mutation. Position updating enables the non-best solution vectors to mimic the best one, which is beneficial to the convergence of the DSO; genetic mutation can increase the diversity of individuals, which is beneficial to preventing the premature convergence of the DSO. In addition, we adopt the penalty function method to balance objective and constraint violations. We can obtain satisfactory solutions for constrained optimization problems by combining the DSO and the penalty function method. Experimental results indicate that the proposed algorithm can be an efficient alternative on solving constrained optimization problems. [Copyright &y& Elsevier]
- Published
- 2011
- Full Text
- View/download PDF
43. High-dimensional objective optimizer: An evolutionary algorithm and its nonlinear analysis
- Author
-
Huang, Jun, Huang, Xiaohong, Ma, Yan, and Liu, Yanbing
- Subjects
- *
MATHEMATICAL optimization , *ARTIFICIAL intelligence , *NONLINEAR statistical models , *MARTINGALES (Mathematics) , *STOCHASTIC convergence , *MATHEMATICAL analysis , *ALGORITHMS , *COMPUTER science - Abstract
Abstract: Last few years have witnessed the development of various multi-objective evolutionary algorithms since they allow the generation of the overall Pareto front for multi-objective optimizations. With the problems in the real-world becoming more and more complex, however, no reported work in the literature focuses on the high-dimensional objective optimizations (HOPs). In this paper, we propose an evolutionary algorithm named HOEA (high-dimensional objective evolutionary algorithm) for HOPs. By adopting the concept of nonlinear definition for optimizing object, HOPs can be solved by HOEA, while the well-known multi-objective evolutionary algorithms work poorly on HOPs. We further analyze the nonlinear dynamic properties of HOEA on the basis of martingale theoretical framework. The theoretical results indicate that this new algorithm is indeed capable of achieving convergence. We also conduct experiments on HOEA with two representative test instances. The experimental results either confirm our theoretical results or show that the proposed algorithm is efficient and effective for HOPs. [Copyright &y& Elsevier]
- Published
- 2011
- Full Text
- View/download PDF
44. Exact optimization for the -Compressive Sensing problem using a modified Dantzig–Wolfe method
- Author
-
Borghi, Alexandre, Darbon, Jérôme, and Peyronnet, Sylvain
- Subjects
- *
MATHEMATICAL optimization , *MATHEMATICAL decomposition , *SIMPLEXES (Mathematics) , *LINEAR programming , *ALGORITHMS , *MATHEMATICAL analysis - Abstract
Abstract: This paper considers the -Compressive Sensing problem and presents an efficient algorithm that computes an exact solution. The idea consists in reformulating the problem such that it yields a modified Dantzig–Wolfe decomposition that allows to efficiently apply all standard simplex pivoting rules. Experimental results show the superiority of our approach compared to standard linear programming methods. [Copyright &y& Elsevier]
- Published
- 2011
- Full Text
- View/download PDF
45. A novel modified differential evolution algorithm for constrained optimization problems
- Author
-
Zou, Dexuan, Liu, Haikuan, Gao, Liqun, and Li, Steven
- Subjects
- *
ALGORITHMS , *MATHEMATICAL optimization , *MATHEMATICAL analysis , *NUMERICAL analysis , *CONSTRAINED optimization , *COMPUTER programming - Abstract
Abstract: A novel modified differential evolution algorithm (NMDE) is proposed to solve constrained optimization problems in this paper. The NMDE algorithm modifies scale factor and crossover rate using an adaptive strategy. For any solution, if it is at a standstill, its own scale factor and crossover rate will be adjusted in terms of the information of all successful solutions. We can obtain satisfactory feasible solutions for constrained optimization problems by combining the NMDE algorithm and a common penalty function method. Experimental results show that the proposed algorithm can yield better solutions than those reported in the literature for most problems, and it can be an efficient alternative to solving constrained optimization problems. [Copyright &y& Elsevier]
- Published
- 2011
- Full Text
- View/download PDF
46. Pairwise optimized Rocchio algorithm for text categorization
- Author
-
Miao, Yun-Qian and Kamel, Mohamed
- Subjects
- *
ALGORITHMS , *CATEGORIES (Mathematics) , *COMPARATIVE studies , *SUPPORT vector machines , *MATHEMATICAL optimization , *MATHEMATICAL analysis - Abstract
Abstract: This paper examines the Rocchio algorithm and its application in text categorization. Existing approaches using global parameters optimization of Rocchio algorithm result in choosing one fixed prototype representing each category for multi-category text categorization problems. Therefore, they have limited discriminating power on different category’s distribution and their parameter optimization methods are based on weak representation ability of the negative samples consisting of several categories. We present a pairwise optimized Rocchio algorithm, which dynamically adjusts the prototype position between pairs of categories. Experiments were conducted on three benchmark corpora, the 20-Newsgroup, Reuters-21578 and TDT2. The results confirm that our proposed pairwise method achieves encouraging performance improvement over the conventional Rocchio method. A comparative study with the top notch text classifier Support Vector Machine (SVM) also shows the pairwise Rocchio method achieves competitive results. [ABSTRACT FROM AUTHOR]
- Published
- 2011
- Full Text
- View/download PDF
47. A solution to illumination direction estimation of a shaded image: Genetic algorithm
- Author
-
Chow, Chi Kin and Yuen, Shiu Yin
- Subjects
- *
LIGHTING , *ALGORITHMS , *IMAGE processing , *MATHEMATICAL optimization , *GENETIC programming , *GENETIC algorithms , *MATHEMATICAL analysis , *OPERATIONS research - Abstract
Abstract: In oblique shape from shading (SfS), the illumination direction is essential for recovering the 3D surface of a shaded image. On the other hand, fast marching methods (FMM) are SfS algorithms that use the mechanism of wave propagation to reconstruct the surface. In this paper, the estimation of illumination direction is addressed and we model it as an optimization problem. The idea is to minimize the inconsistency of wave propagation of FMM during the reconstruction. As the consistency of wave propagation is a multi-modal function of illumination direction, genetic algorithm (GA) is utilized. The proposed algorithm is examined on four synthetic models and a real world object. The experimental results show that the proposed algorithm is superior to benchmark methods. [Copyright &y& Elsevier]
- Published
- 2010
- Full Text
- View/download PDF
48. An efficient cultural self-organizing migrating strategy for economic dispatch optimization with valve-point effect
- Author
-
Coelho, Leandro dos Santos and Mariani, Viviana Cocco
- Subjects
- *
MATHEMATICAL optimization , *ALGORITHMS , *LOAD dispatching in electric power systems , *ELECTRIC power production , *NUMERICAL analysis , *STOCHASTIC analysis , *SELF-organizing systems , *GROUP theory , *MATHEMATICAL analysis - Abstract
Abstract: Recently, a new class of stochastic optimization algorithm called SOMA (self-organizing migrating algorithm) was proposed in the literature. SOMA works on a population of potential solutions called specimen and it is based on the self-organizing behavior of groups of individuals in a “social environment”. This paper proposes a SOMA approach combined with a cultural algorithm (CSOMA) technique based on normative knowledge as an alternative method to solving the economic load dispatch problem of thermal generators with the valve-point effect. The classical SOMA and CSOMA approaches are validated for two test systems consisting of 13 and 40 thermal generators whose non-smooth fuel cost function takes into account the valve-point loading effects. Numerical results indicate that performance of the CSOMA present best results when compared with results of others optimization methods found in the literature in solving load dispatch problems with the valve-point effect. [ABSTRACT FROM AUTHOR]
- Published
- 2010
- Full Text
- View/download PDF
49. Maximum flow problem on dynamic generative network flows with time-varying bounds
- Author
-
Fathabadi, Hassan Salehi and Hosseini, Seyed Ahmad
- Subjects
- *
GRAPH theory , *MATHEMATICAL decomposition , *LINEAR programming , *FLUID dynamics , *ALGORITHMS , *MATHEMATICAL optimization , *MATHEMATICAL analysis - Abstract
Abstract: This paper considers a new class of network flows, called dynamic generative network flows in which, the flow commodity is dynamically generated at a source node and dynamically consumed at a sink node and the arc-flow bounds are time dependent. Then the maximum dynamic flow problem in such networks for a pre-specified time horizon T is defined and mathematically formulated in both arc flow and path flow presentations. By exploiting the special structure of the problem, an efficient algorithm is developed to solve the general form of the dynamic problem as a minimum cost static flow problem. [Copyright &y& Elsevier]
- Published
- 2010
- Full Text
- View/download PDF
50. Interactive optimization approach for optimal impulsive rendezvous using primer vector and evolutionary algorithms
- Author
-
Luo, Ya-Zhong, Zhang, Jin, Li, Hai-yang, and Tang, Guo-Jin
- Subjects
- *
MATHEMATICAL optimization , *ALGORITHMS , *VECTOR analysis , *CIRCLE , *OPERATIONS research , *MATHEMATICAL analysis - Abstract
Abstract: In this paper, a new optimization approach combining primer vector theory and evolutionary algorithms for fuel-optimal non-linear impulsive rendezvous is proposed. The optimization approach is designed to seek the optimal number of impulses as well as the optimal impulse vectors. In this optimization approach, adding a midcourse impulse is determined by an interactive method, i.e. observing the primer-magnitude time history. An improved version of simulated annealing is employed to optimize the rendezvous trajectory with the fixed-number of impulses. This interactive approach is evaluated by three test cases: coplanar circle-to-circle rendezvous, same-circle rendezvous and non-coplanar rendezvous. The results show that the interactive approach is effective and efficient in fuel-optimal non-linear rendezvous design. It can guarantee solutions, which satisfy the Lawden''s necessary optimality conditions. [Copyright &y& Elsevier]
- Published
- 2010
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.