共查询到20条相似文献,搜索用时 78 毫秒
1.
2.
一种基于支持向量机预测模型的精度提高方法与应用 总被引:1,自引:0,他引:1
李运蒙 《数学的实践与认识》2004,34(8):19-22
介绍了支持向量机模型的特点 ,针对该模型在经济预测中的应用 ,提出了一种提高该模型预测精度的方法 ,并进行了理论分析和实际应用的验证 ,说明了该方法能够获得更加准确的预测结果 . 相似文献
3.
4.
5.
6.
在保证供应不间断的前提下,讨论了多供应点、多时间需求的协作供应问题,建立了使包括运输成本、购货成本以及库存成本在内的总成本最小的数学模型.设计了一个求解该模型的算法,证明了该算法的可行性和最优性,并给出了该算法的算法复杂度.最后给出了一个算例,和相关算法相比较可知该算法更具有实际应用价值. 相似文献
7.
多联票据的印刷过程包括排版、单联印刷和多联配页与装订三个过程。该过程是柔性的流水生产线与装配混合的生产系统。本文研究了该系统中的票据印刷生产调度问题,目标是最小化所有产品的最大完成时间(Makespan)。该问题到目前为止还没有人研究,本文首先建立了该问题的混合整数规划模型,然后提出了该模型的求解方法,并给出了该问题的下界。最后的量化示例和算例试验表明本文的模型是有效的。 相似文献
8.
9.
基于模糊评价法的企业经理人的绩效评估 总被引:8,自引:0,他引:8
为了建立一套对企业经理人的绩效进行科学、合理检测的评价体系,首先建立了一套反映企业经理人绩效的二级指标体系,然后构建了一个评价企业经理人绩效的模糊综合评价模型,并将该模糊综合评价模型应用到一个具体的企业,得到了该企业经理人各绩效指标的权重,再通过对该企业具体经理人对应的各二级绩效指标进行评价,然后采用模糊算法计算得到了该经理人的综合绩效分.该评价体系简单方便,有助于企事业单位对自己的高级员工进行有效的人事管理. 相似文献
10.
11.
12.
求解TSP的子空间遗传算法 总被引:17,自引:0,他引:17
为避免遗传算法在计算过程中搜索冗余空间而耗费不必要的资源及时间,本提出了一种以经费遗传算法为基础,通过分析问题的特殊解集,以找出原问题解空间的区域特征从而构造出缩小算法搜索空间的子空间遗传算法,并用它求解TSP。结果表明,该算法实施起来非常有效。 相似文献
13.
14.
Xiaodi Li R. Rakkiyappan C. Pradeep 《Communications in Nonlinear Science & Numerical Simulation》2012,17(10):3894-3905
This paper investigates the global robust stability problem of Markovian switching uncertain stochastic genetic regulatory networks with unbounded time-varying delays and norm bounded parameter uncertainties. The structure variations at discrete time instances during the process of gene regulations known as hybrid genetic regulatory networks based on Markov process is proposed. The jumping parameters considered here are generated from a continuous-time discrete-state homogeneous Markov process, which are governed by a Markov process with discrete and finite state space. The concept of global robust μ-stability in the mean square for genetic regulatory networks is given. Based on Lyapunov function, stochastic theory and Itô’s differential formula, the stability criteria are presented in the form of linear matrix inequalities (LMIs). Numerical examples are presented to demonstrate the effectiveness of the main result. 相似文献
15.
本文基于最新的机会约束规划理论,提出了两类随机环境下资金预算问题的整数规划模型,并且设计了一种基于随机模拟的遗传算法来计算给出的模型.为了例证算法的有效性,本文给出了两类模型的数值例子,并且对其中一个例子给出了不同的参数,测试遗传算法的有效性,数值例子及测试结果均显示,本文所设计的基于随机模拟的遗传算法对于解决本文提出的两类模型是有效的. 相似文献
16.
17.
This paper discusses portfolio selection problem in fuzzy environment. In the paper, semivariance is originally presented for fuzzy variable, and three properties of the semivariance are proven. Based on the concept of semivariance of fuzzy variable, two fuzzy mean-semivariance models are proposed. To solve the new models in general cases, a fuzzy simulation based genetic algorithm is presented in the paper. In addition, two numerical examples are also presented to illustrate the modelling idea and the effectiveness of the designed algorithm. 相似文献
18.
A groundwater management problem is presented involving pumping cost minimization with both well discharges and well locations as decision variables. A grid of candidate well locations is set up and optimal arrangements of wells are sought within this discrete space. A genetic algorithm approach is presented with the following particular features: (a) A suitable scaling is applied to the objective function in order to alleviate its regionally flat behavior. (b) No penalty functions are involved in constraint handling. Instead, the feasible region is transformed into a rectangular domain. The transformation introduced is proved to be bijective. (c) A binary representation of well configurations is presented and compared to a combinatorial one. The binary representation necessitates the introduction of specially designed genetic operators. Besides purely genetic algorithms, the concept of cellular automaton is introduced as the basis of an alternative formulation of the optimization problem. The lattice of the cellular automaton provides the discrete set of candidate well positions. The well configuration is represented by a group of agents occupying an equal number of lattice sites. The agents change positions as dictated by the structure of the automaton and, also, by an associated genetic algorithm, which directs the evolution of the whole scheme toward an optimal configuration. An improved performance of this approach is noted and discussed in comparison to the purely genetic algorithm schemes of the present work. A simulated annealing approach is also applied to the same problem for comparison purposes. Finally, a new and more efficient hybrid annealing–genetic approach is introduced and discussed. 相似文献
19.