首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   290篇
  免费   126篇
  国内免费   20篇
  2023年   4篇
  2022年   2篇
  2021年   6篇
  2020年   10篇
  2019年   11篇
  2018年   8篇
  2017年   20篇
  2016年   24篇
  2015年   19篇
  2014年   22篇
  2013年   23篇
  2012年   17篇
  2011年   21篇
  2010年   15篇
  2009年   29篇
  2008年   26篇
  2007年   20篇
  2006年   26篇
  2005年   15篇
  2004年   21篇
  2003年   8篇
  2002年   7篇
  2001年   13篇
  2000年   8篇
  1999年   6篇
  1998年   6篇
  1997年   7篇
  1996年   5篇
  1995年   4篇
  1994年   2篇
  1993年   6篇
  1992年   4篇
  1991年   7篇
  1990年   10篇
  1989年   3篇
  1988年   1篇
排序方式: 共有436条查询结果,搜索用时 15 毫秒
431.
针对传统遗传算法在进行复杂的大范围优化问题时容易陷入局部最优和收敛速度慢的局限,提出采用基于混沌的遗传算法进行反舰导弹航路优化问题的求解。在遗传算法操作时加入混沌操作,扩大了搜索范围,提高了优化速度,有效地解决了解空间巨大带来遗传算法的上述局限性。  相似文献   
432.
Express package carrier networks have large numbers of heavily‐interconnected and tightly‐constrained resources, making the planning process difficult. A decision made in one area of the network can impact virtually any other area as well. Mathematical programming therefore seems like a logical approach to solving such problems, taking into account all of these interactions. The tight time windows and nonlinear cost functions of these systems, however, often make traditional approaches such as multicommodity flow formulations intractable. This is due to both the large number of constraints and the weakness of the linear programming (LP) relaxations arising in these formulations. To overcome these obstacles, we propose a model in which variables represent combinations of loads and their corresponding routings, rather than assigning individual loads to individual arcs in the network. In doing so, we incorporate much of the problem complexity implicitly within the variable definition, rather than explicitly within the constraints. This approach enables us to linearize the cost structure, strengthen the LP relaxation of the formulation, and drastically reduce the number of constraints. In addition, it greatly facilitates the inclusion of other stages of the (typically decomposed) planning process. We show how the use of templates, in place of traditional delayed column generation, allows us to identify promising candidate variables, ensuring high‐quality solutions in reasonable run times while also enabling the inclusion of additional operational considerations that would be difficult if not impossible to capture in a traditional approach. Computational results are presented using data from a major international package carrier. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008  相似文献   
433.
This article considers the empty vehicle redistribution problem in a hub‐and‐spoke transportation system, with random demands and stochastic transportation times. An event‐driven model is formulated, which yields the implicit optimal control policy. Based on the analytical results for two‐depot systems, a dynamic decomposition procedure is presented which produces a near‐optimal policy with linear computational complexity in terms of the number of spokes. The resulting policy has the same asymptotic behavior as that of the optimal policy. It is found that the threshold‐type control policy is not usually optimal in such systems. The results are illustrated through small‐scale numerical examples. Through simulation the robustness of the dynamic decomposition policy is tested using a variety of scenarios: more spokes, more vehicles, different combinations of distribution types for the empty vehicle travel times and loaded vehicle arrivals. This shows that the dynamic decomposition policy is significantly better than a heuristics policy in all scenarios and appears to be robust to the assumptions of the distribution types. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008  相似文献   
434.
一种基于导航点的航天器相对运动轨迹生成策略   总被引:1,自引:0,他引:1       下载免费PDF全文
针对圆(近圆)轨道航天器相对运动的固定时间状态转移问题,提出了一种基于导航点的多脉冲优化轨迹生成策略.从相对运动动力学出发,应用最优控制理论给出了基于连续推力的最优转移轨线,将引入的导航点限定在最优转移轨线上得到其位置参数;然后利用导航点位置参数建立了脉冲约束下的基于脉冲的优化轨迹生成模型,采用二次规划算法求解,通过改变导航点位置和脉冲间隔优化轨迹.仿真算例验证了策略的有效性.  相似文献   
435.
杂合数据的粗糙集属性约简方法   总被引:1,自引:0,他引:1       下载免费PDF全文
针对决策表中属性取值为杂合数据的情况,提出了基于粗糙集理论的属性约简算法.首先给出了对象间在杂合数据下的相似度计算定义.为了获取合理的对象集合的软划分,给出了阈值计算的最优化模型,并基于粗糙集的上、下近似的概念,得到对象集合在条件属性下的上、下近似的覆盖划分.之后,通过各对象基于条件属性和决策属性的上、下近似下的分布矩阵描述,利用最大分布矩阵,直观地得到两种不同观点下的约简结果.实验结果表明了本算法的合理和有效性.  相似文献   
436.
ABSTRACT

This article reviews the book by Ofer Fridman and seeks to situate the strategic debate on hybrid war in the context of debate on the US involvement in Iraq. It points to intellectuals from the Marine Corps having a significant role in the initial development of the hybrid warfare concept at a time of some reservation in US military circles over COIN strategy as this was set out in the field manual FM3-24. Thereafter, the hybrid war concept rapidly spread and became a conceptual device used to explain Russian strategic intentions in the aftermath of the invasion of Ukraine in 2014.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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