Performance characteristic of an Unmanned Air Vehicle (UAV) is investigated using a newly developed heuristic approach. Almost all flight phases of any air vehicle can be categorized into trim and maneuvering flights. In this paper, a new envelope called trim-ability envelope, is introduced and sketched within the conventional flight envelope for a small UAV. Optimal maneuverability of the inte...

This study focuses on the optimization of the plane structure. Sequential quadratic programming (SQP) will be utilized, which is one of the most efficient methods for solving nonlinearly constrained optimization problems. A new formulation for the second order sensitivity analysis of the two-dimensional finite element will be developed. All the second order required derivatives will be calculat...

In this research, we proposed a new metaheuristic technique for stock portfolio multi-objective optimization employing the combination of Strength Pareto Evolutionary Algorithm (SPEA), Adaptive Neuro-Fuzzy Inference System (ANFIS) and Arbitrage Pricing Theory (APT). To generate the more precise model, ANFIS has implemented to envisage long-term movement values of the Tehran Stock Exchange (TSE)...

Global optimization methods play an important role to solve many real-world problems. Flower pollination algorithm (FP) is a new nature-inspired algorithm, based on the characteristics of flowering plants. In this paper, a new hybrid optimization method called hybrid flower pollination algorithm (FPPSO) is proposed. The method combines the standard flower pollination algorithm (FP) with the par...

In this paper, we derive a portfolio optimization model by minimizing upper and lower bounds of loss probability. These bounds are obtained under a nonparametric assumption of underlying return distribution by modifying the so-called generalization error bounds for the support vector machine, which has been developed in the field of statistical learning. Based on the bounds, two fractional prog...

"% ! !! ! " " :( % ! ! (! ! ! ! ! ! ; %! ! ! % ( :( " ! " ! ! ! ! " ( ! " <% ! ! !% %" ! " " : ! / ! " " ! : ! " % %" ! " " : ! !%:!% ! ! = = = ; % et al. " ! ( ! > " ( ? : : ! ! ( !" ! %" ! " " : ! ? ! % ! "! : ! %! ! ! ! % (: ! ! ! !! ! %! ? : ( ! % <% ( "%

In this paper, we investigate on the decomposition method that was presented by Yu and et al. [1]. We show a note about it. © 2015 Elsevier Inc. All rights reserved.