全文获取类型
收费全文 | 156篇 |
免费 | 19篇 |
国内免费 | 24篇 |
出版年
2022年 | 2篇 |
2021年 | 1篇 |
2020年 | 5篇 |
2019年 | 3篇 |
2018年 | 1篇 |
2017年 | 8篇 |
2016年 | 17篇 |
2015年 | 3篇 |
2014年 | 8篇 |
2013年 | 7篇 |
2012年 | 20篇 |
2011年 | 12篇 |
2010年 | 6篇 |
2009年 | 11篇 |
2008年 | 7篇 |
2007年 | 12篇 |
2006年 | 18篇 |
2005年 | 6篇 |
2004年 | 7篇 |
2003年 | 6篇 |
2002年 | 7篇 |
2001年 | 8篇 |
2000年 | 2篇 |
1999年 | 6篇 |
1998年 | 1篇 |
1997年 | 3篇 |
1996年 | 4篇 |
1995年 | 1篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1992年 | 4篇 |
1990年 | 1篇 |
排序方式: 共有199条查询结果,搜索用时 15 毫秒
171.
基于遗传算法的目标分配优化模型研究 总被引:2,自引:0,他引:2
结合现代防空作战的特点,给出了现代防空作战的目标分配模型,利用遗传算法给出了模型求解的方法及步骤;实践证明该方法解题速度快,结果的精度高,可以为决策者作出科学、准确的决策提供有力支持。 相似文献
172.
173.
174.
175.
Assigning storage locations to incoming or reshuffled containers is a fundamental problem essential to the operations efficiency of container terminals. The problem is notoriously hard for its combinatorial and dynamic nature. In this article, we minimize the number of reshuffles in assigning storage locations for incoming and reshuffled export containers. For the static problem to empty a given stack without any new container arrival, the optimum reshuffle sequence is identified by an integer program (IP). The integer program captures the evolution of stack configurations as a function of decisions and is of interest by itself. Heuristics based on the integer program are then derived. Their competitiveness in accuracy and time are established by extensive numerical runs comparing them with existing heuristics in literature and in practice as well as with extensions of the existing heuristics. Variants of the IP‐based heuristics are then applied to the dynamic problem with continual retrievals and arrivals of containers. Again, numerical runs confirm that the IP‐based heuristic is competitive. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009 相似文献
176.
一般武器-目标分配问题,是使武器发挥最大效能而使目标遭受最大毁伤的最优化问题.遗传算法广泛用于解决最优化问题.提出一种具有贪心优化机制的局部搜索方法,以提高遗传算法的搜索效率,从而迅速找到全局最优解.应用于炮兵武器-目标分配问题的仿真试验结果表明,此算法比现有的其他搜寻算法具有更好的求解效率. 相似文献
177.
178.
This article introduces the Doubly Stochastic Sequential Assignment Problem (DSSAP), an extension of the Sequential Stochastic Assignment Problem (SSAP), where sequentially arriving tasks are assigned to workers with random success rates. A given number of tasks arrive sequentially, each with a random value coming from a known distribution. On a task arrival, it must be assigned to one of the available workers, each with a random success rate coming from a known distribution. Optimal assignment policies are proposed for DSSAP under various assumptions on the random success rates. The optimal assignment algorithm for the general case of DSSAP, where workers have distinct success rate distribution, has an exponential running time. An approximation algorithm that achieves a fraction of the maximum total expected reward in a polynomial time is proposed. The results are illustrated by several numerical experiments. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 124–137, 2016 相似文献
179.
180.