首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   203篇
  免费   9篇
  国内免费   1篇
  213篇
  2025年   2篇
  2024年   2篇
  2023年   3篇
  2022年   2篇
  2021年   2篇
  2020年   1篇
  2019年   6篇
  2018年   1篇
  2017年   7篇
  2016年   4篇
  2015年   2篇
  2014年   10篇
  2013年   12篇
  2012年   16篇
  2011年   15篇
  2010年   10篇
  2009年   7篇
  2008年   9篇
  2007年   13篇
  2006年   15篇
  2005年   11篇
  2004年   8篇
  2003年   7篇
  2002年   3篇
  2001年   10篇
  2000年   4篇
  1999年   7篇
  1998年   4篇
  1997年   1篇
  1996年   3篇
  1995年   3篇
  1994年   1篇
  1993年   5篇
  1992年   5篇
  1991年   1篇
  1990年   1篇
排序方式: 共有213条查询结果,搜索用时 15 毫秒
151.
针对电子侦察卫星的使用约束,及不同任务的调度需求,建立了电子侦察卫星联合侦察的多目标混合整数规划模型.利用进化算法的全局搜索能力和变邻域搜索的局部优化能力,提出了一种多目标进化算法和变邻域搜索相结合两阶段混合调度算法MOEA VNS.针对问题多时间窗组合优化特点,设计了进化算子与邻域移动算子,在确保解多样性的同时使算法...  相似文献   
152.
探月飞船升阻比较低,为实现长纵程飞行,必须采用跳跃式再入方式。在跳跃式再入轨迹在线规划或预测制导中,如何快速准确地预测初次再入段纵程是一个非常关键的问题。针对这一问题,研究提出一种解析预测方法:利用匹配渐进展开方法得到再入纵向运动方程的闭型近似解;将初次再入段轨迹分为三段,第一段采用高度作为积分自变量,并利用复合梯形公式得到纵程,第二段和第三段分别采用二次多项式来拟合阻力加速度-能量剖面,根据近似解结果反解出多项式系数,并将得到的阻力加速度倒数-能量函数进行积分,得到第二段和第三段的纵程;对解析预测方法的精度和计算效率进行分析,结果表明该方法计算精度较高,速度快,可用于跳跃式再入轨迹的在线规划和制导。  相似文献   
153.
This article is a sequel to a recent article that appeared in this journal, “An extensible modeling framework for dynamic reassignment and rerouting in cooperative airborne operations” [ 17 ], in which an integer programming formulation to the problem of rescheduling in‐flight assets due to changes in battlespace conditions was presented. The purpose of this article is to present an improved branch‐and‐bound procedure to solve the dynamic resource management problem in a timely fashion, as in‐flight assets must be quickly re‐tasked to respond to the changing environment. To facilitate the rapid generation of attractive updated mission plans, this procedure uses a technique for reducing the solution space, supports branching on multiple decision variables simultaneously, incorporates additional valid cuts to strengthen the minimal network constraints of the original mathematical model, and includes improved objective function bounds. An extensive numerical analysis indicates that the proposed approach significantly outperforms traditional branch‐and‐bound methodologies and is capable of providing improved feasible solutions in a limited time. Although inspired by the dynamic resource management problem in particular, this approach promises to be an effective tool for solving other general types of vehicle routing problems. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013  相似文献   
154.
利用电化学电位噪声方法检测了不同腐蚀状态304与316两种不镑钢管焊缝区试样在室温碱液中的腐蚀行为,并采用电化学噪声时域谱、频域谱进行了分析,结果表明:不同腐蚀状态焊缝试样的腐蚀电位及噪声时城谱特征不同,可利用电位噪声频城谱的高频斜率K值定性判定是否发生局部腐蚀,同时可根据频城谱中发生事件特殊频率fn区分材料的腐蚀状态...  相似文献   
155.
采用复级数方法首次建立了线性偏微分方程组边值问题的一般解析解法,并用于求解各向异性矩形板平面应力问题,给出各向异性板平面应力问题一般解析解.引入(U,V)=∑∞-∞(A,B)eimπζ,eimπηr,代入控制方程组,推出实数型级数解,将其回代入平衡方程组中任一个,可确定待定系数(A,B)之间关系.将一般解析解代入边界条件,用余弦级数的方法确定待求系数.数值计算验证了解析方法的收敛性.  相似文献   
156.
    
This study considers the block relocation and loading problem in container terminals. The optimal loading sequence and relocation location are simultaneously decided on the basis of the desired ship‐bay and initial yard space configuration. An integer linear programming model is developed to minimize the number of relocations in the yard space on the basis of no shifts in the ship bay. The accuracy of the model is tested on small‐scale scenarios by using CPLEX. Considering the problem size in the real world, we present a rule‐based heuristic method that is combined with a mathematical model for the removal, loading, and relocation operations. The influence of rules on algorithm performance is also analyzed, and the heuristic algorithm is compared with different types of algorithms in the literature. The extensive numerical experiments show the efficiency of the proposed heuristic algorithm.  相似文献   
157.
    
In hinterland container transportation the use of barges is getting more and more important. We propose a real‐life operational planning problem model from an inland terminal operating company, in which the number of containers shipped per barge is maximized and the number of terminals visited per barge is minimized. This problem is solved with an integer linear program (ILP), yielding strong cost reductions, about 20%, compared to the method used currently in practice. Besides, we develop a heuristic that solves the ILP in two stages. First, it decides for each barge which terminals to visit and second it assigns containers to the barges. This heuristic produces almost always optimal solutions and otherwise near‐optimal solutions. Moreover, the heuristic runs much faster than the ILP, especially for large‐sized instances.  相似文献   
158.
    
The cyclic best‐first search (CBFS) strategy is a recent search strategy that has been successfully applied to branch‐and‐bound algorithms in a number of different settings. CBFS is a modification of best‐first search (BFS) that places search tree subproblems into contours which are collections of subproblems grouped in some way, and repeatedly cycles through all non‐empty contours, selecting one subproblem to explore from each. In this article, the theoretical properties of CBFS are analyzed for the first time. CBFS is proved to be a generalization of all other search strategies by using a contour definition that explores the same sequence of subproblems as any other search strategy. Further, a bound is proved between the number of subproblems explored by BFS and the number of children generated by CBFS, given a fixed branching strategy and set of pruning rules. Finally, a discussion of heuristic contour‐labeling functions is provided, and proof‐of‐concept computational results for mixed‐integer programming problems from the MIPLIB 2010 database are shown. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 64–82, 2017  相似文献   
159.
在对潜搜索中,针对搜索兵力武器装备战技性能的优劣、指挥人员的军政素质的高低、水文气象条件的好坏等因素均会随着时间的推移而发生变化的特点,为了取得最佳的搜潜效果,需要根据时间变化给不同的作战单元分派不同的作战任务.将整数规划与灰色模型相结合,建立了对潜搜索的灰色整数规划模型,给出了检验方法和求解步骤,并举例分析说明.经验证,该模型精度等级较高,且能使各作战单元的搜索效率达到最佳,因此,可资对潜搜索兵力分配时借鉴.  相似文献   
160.
    
In the aftermath of the tragic events of 11 September 2001, numerous changes have been made to aviation security policy and operations throughout the nation's airports. The allocation and utilization of checked baggage screening devices is a critical component in aviation security systems. This paper formulates problems that model multiple sets of flights originating from multiple stations (e.g., airports, terminals), where the objective is to optimize a baggage screening performance measure subject to a finite amount of resources. These measures include uncovered flight segments (UFS) and uncovered passenger segments (UPS). Three types of multiple station security problems are identified and their computational complexity is established. The problems are illustrated on two examples that use data extracted from the Official Airline Guide. The examples indicate that the problems can provide widely varying solutions based on the type of performance measure used and the restrictions imposed by the security device allocations. Moreover, the examples suggest that the allocations based on the UFS measure also provide reasonable solutions with respect to the UPS measure; however, the reverse may not be the case. This suggests that the UFS measure may provide more robust screening device allocations. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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