首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   3篇
  免费   0篇
电工技术   1篇
自动化技术   2篇
  2014年   2篇
  2012年   1篇
排序方式: 共有3条查询结果,搜索用时 15 毫秒
1
1.
In this paper a general mathematical model for portfolio selection problem is proposed. By considering a forecasting performance according to the distributional properties of residuals, we formulate an extended mean-variance-skewness model with 11 objective functions. Returns and return errors for each asset obtained using different forecasting techniques, are combined in optimal proportions so as to minimize the mean absolute forecast error. These proportions are then used in constructing six criteria related to the mean, variance and skewness of return forecasts of assets in the future and forecasting errors of returns of assets in the past. The obtained multi-objective model is scalarized by using the conic scalarization method which guarantees to find all non-dominated solutions by considering investor preferences in non-convex multi-objective problems. The obtained scalar problem is solved by utilizing F-MSG algorithm. The performance of the proposed approach is tested on a real case problem generated on the data derived from Istanbul Stock Exchange. The comparison is conducted with respect to different levels of investor preferences over return, variance, and skewness and obtained results are summarized.  相似文献   
2.
The Quadratic Knapsack Problem (QKP) is one of the well-known combinatorial optimization problems. If more than one knapsack exists, then the problem is called a Quadratic Multiple Knapsack Problem (QMKP). Recently, knapsack problems with setups have been considered in the literature. In these studies, when an item is assigned to a knapsack, its setup cost for the class also has to be accounted for in the knapsack. In this study, the QMKP with setups is generalized taking into account the setup constraint, assignment conditions and the knapsack preferences of the items. The developed model is called Generalized Quadratic Multiple Knapsack Problem (G-QMKP). Since the G-QMKP is an NP-hard problem, two different meta-heuristic solution approaches are offered for solving the G-QMKP. The first is a genetic algorithm (GA), and the second is a hybrid solution approach which combines a feasible value based modified subgradient (F-MSG) algorithm and GA. The performances of the proposed solution approaches are shown by using randomly generated test instances. In addition, a case study is realized in a plastic injection molding manufacturing company. It is shown that the proposed hybrid solution approach can be successfully used for assigning jobs to machines in production with plastic injection, and good solutions can be obtained in a reasonable time for a large scale real-life problem.  相似文献   
3.
A security constrained non-convex environmental/economic power dispatch problem for a lossy electric power system area including limited energy supply thermal units is formulated. An iterative solution method based on modified subgradient algorithm operating on feasible values (F-MSG) and a common pseudo scaling factor for limited energy supply thermal units are used to solve it. In the proposed solution method, the F-MSG algorithm is used to solve the dispatch problem of each subinterval, while the common pseudo scaling factor is employed to adjust the amount of fuel spent by the limited energy supply thermal units during the considered operation period. We assume that limited energy supply thermal units are fueled under take-or-pay (T-O-P) agreement.The proposed dispatch technique is demonstrated on IEEE 30-bus power system with six thermal generating units having non-convex cost rate functions. Two of the generating units are selected as gas-fired limited energy supply thermal units. Pareto optimal solutions for the power system, where the constraint on the amount of fuel consumed by the limited energy supply thermal units is not considered, are calculated first. Later on, the same Pareto optimal solutions for the power system, where the fuel constraint is considered, are recalculated, and the obtained savings in the sum of optimal total fuel cost and total emission cost are presented. The dispatch problem of the first subinterval of the test system was solved previously by means of differential evolution (DE), and a hybrid method based on combination of DE and biogeography based optimization (BBO) for the best cost and the best emission cases in the literature. The results produced by these methods are compared with those of produced by the proposed method in terms of their total cost rate, emission rate and solution time values. It is demonstrated that the proposed method outperforms against the evolutionary methods mentioned in the above in terms of solution time values especially when the exact model of the test system is considered.  相似文献   
1
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号