首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   414篇
  免费   124篇
  国内免费   51篇
  2024年   3篇
  2023年   6篇
  2022年   10篇
  2021年   11篇
  2020年   14篇
  2019年   10篇
  2018年   10篇
  2017年   27篇
  2016年   35篇
  2015年   30篇
  2014年   35篇
  2013年   35篇
  2012年   54篇
  2011年   33篇
  2010年   27篇
  2009年   37篇
  2008年   26篇
  2007年   33篇
  2006年   31篇
  2005年   30篇
  2004年   30篇
  2003年   12篇
  2002年   13篇
  2001年   10篇
  2000年   3篇
  1999年   6篇
  1998年   2篇
  1997年   5篇
  1995年   3篇
  1994年   1篇
  1992年   1篇
  1991年   2篇
  1990年   3篇
  1989年   1篇
排序方式: 共有589条查询结果,搜索用时 31 毫秒
141.
Stochastic network design is fundamental to transportation and logistic problems in practice, yet faces new modeling and computational challenges resulted from heterogeneous sources of uncertainties and their unknown distributions given limited data. In this article, we design arcs in a network to optimize the cost of single‐commodity flows under random demand and arc disruptions. We minimize the network design cost plus cost associated with network performance under uncertainty evaluated by two schemes. The first scheme restricts demand and arc capacities in budgeted uncertainty sets and minimizes the worst‐case cost of supply generation and network flows for any possible realizations. The second scheme generates a finite set of samples from statistical information (e.g., moments) of data and minimizes the expected cost of supplies and flows, for which we bound the worst‐case cost using budgeted uncertainty sets. We develop cutting‐plane algorithms for solving the mixed‐integer nonlinear programming reformulations of the problem under the two schemes. We compare the computational efficacy of different approaches and analyze the results by testing diverse instances of random and real‐world networks. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 154–173, 2017  相似文献   
142.
This article proposes an approximation for the blocking probability in a many‐server loss model with a non‐Poisson time‐varying arrival process and flexible staffing (number of servers) and shows that it can be used to set staffing levels to stabilize the time‐varying blocking probability at a target level. Because the blocking probabilities necessarily change dramatically after each staffing change, we randomize the time of each staffing change about the planned time. We apply simulation to show that (i) the blocking probabilities cannot be stabilized without some form of randomization, (ii) the new staffing algorithm with randomiation can stabilize blocking probabilities at target levels and (iii) the required staffing can be quite different when the Poisson assumption is dropped. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 177–202, 2017  相似文献   
143.
In the literature two common macroscopic evacuation planning approaches exist: The dynamic network flow approach and the Cell–Transmission–Based approach. Both approaches have advantages and disadvantages. Many efficient solution approaches for the dynamic network flow approach exist so that realistic problem instances can be considered. However, the consideration of (more) realistic aspects (eg, density dependent travel times) results in non‐linear model formulations. The Cell‐Transmission‐Based approach on the other hand considers realistic traffic phenomena like shock waves and traffic congestion, but this approach leads to long computational times for realistic problem instances. In this article, we combine the advantages of both approaches: We consider a Cell‐Transmission‐Based Evacuation Planning Model (CTEPM) and present a network flow formulation that is equivalent to the cell‐based model. Thus, the computational costs of the CTEPM are enormously reduced due to the reformulation and the detailed representation of the traffic flow dynamics is maintained. We investigate the impacts of various evacuation scenario parameters on the evacuation performance and on the computational times in a computational study including 90 realistic instances.  相似文献   
144.
目的:探究领悟社会支持对学习投入的影响,以及自尊和未来教育规划的链式中介效应。方法:采用领悟社会支持量表、自尊量表、未来教育规划问卷和学习投入量表,对446名高中生进行施测。结果:①各变量两两之间均存在显著地正相关(r=0.32~0.50,p<0.001);②领悟社会支持能正向预测高中生学习投入;③在领悟社会支持对高中生学习投入的预测中存在三条路径:一是自尊的中介作用;二是未来教育规划的中介作用;三是自尊和未来教育规划的链式中介作用,效果值分别为:14.81%,27.78%和16.67%。结论:领悟社会支持不仅直接影响高中生学习投入,还通过自尊和未来教育规划影响高中生学习投入。  相似文献   
145.
针对常规海上航线决策没有考虑决策选择过程的问题,引入多选择决策场理论( MDFT),构建了海上能源通道航线动态决策模型。基于信息完备、信息不确定和特殊情况等三种情景想定,进行了海上能源通道航线规划决策及其实验仿真。结果表明,决策过程受时间压力和信息质量的制约,时间压力会制约决策质量,同时还可能引起“偏好逆转”现象,信息不确定也会导致确定性决策。该模型不仅综合考虑了海上能源通道航线选择时需关注的各类要素,且模型参数可动态调整,进而能合理模拟真实的海上状况和决策过程。  相似文献   
146.
针对弹道系数未知的弹道导弹再入段跟踪雷达测量数据滤波这类非线性强的滤波问题,提出可变多模型无迹卡尔曼滤波算法。利用无迹卡尔曼滤波逼近精度高,计算量小,适应于任意非线性模型的特点,将其作为多模型的基本滤波器;滤波算法根据各模型正确描述目标状态的概率,动态地改变多模型数量和模型参数。上述方法的综合运用,提高对目标状态估计精度,降低了计算的复杂度,仿真实验验证了方法的有效性。  相似文献   
147.
The problem of finding a strict total order for a finite set of multiple criteria alternatives is considered. Our research extends previous work by us, which considered finding a partial order for a finite set of alternatives. We merge the preference information extracted from the preference cones and corresponding polyhedral sets, with the information derived from pairwise comparisons of two alternatives, yielding a preference matrix. This preference matrix is used as input to an integer programming model to obtain a strict total order that provides a transitive ranking for the set of alternatives. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 155–163, 2014  相似文献   
148.
针对代价函数权重需要根据环境变化而变化的问题,结合飞行约束条件提出归一化的代价函数,当环境发生变化时,不用再修改代价函数,增强了算法的鲁棒性。为了弥补传统定步长寻径算法耗时长的缺陷,设计了一种基于B样条曲线与遗传算法的高时效寻径算法。利用遗传算法在地图中所寻合适的控制点,再结合B样条曲线生成航路。为了增强遗传算法的全局搜索能力,遗传算法中加入振动法则,使得种群在进化中后期依旧保持一定的多样性。仿真结果表明该算法与精英蚁群算法相比,规划时间大幅缩短;与振动遗传算法相比,航路代价明显降低。  相似文献   
149.
One of the most important issues facing the post‐Cold War U.S. defense establishment concerns the future allocation of combat tasks and responsibilities among different branches of the armed forces. The challenge is to reduce unnecessary redundancy across roles and missions when resources are highly constrained, without compromising military effectiveness. Defining the policy problem as one of resource allocation rather than operational effectiveness, we develop a methodology for allocating roles and missions. Our methodology focuses at the highest level of force aggregation and uses a mathematical programming model to produce cross‐service cross‐mission trade‐offs that will yield the best total force combat and non‐combat potential within resource consumption constraints.  相似文献   
150.
“Lack of money is the root of all evil”

George Bernard Shaw

In a environment where party financing, private funding in particular, is generally a laissez-faire business, as in most Southern African countries, there is the real risk that interest groups and wealthy individuals will buy influence in political parties and in so doing erode public confidence in the political system. Because they are neither open to public scrutiny nor subject to any legislative restraints, huge private donations can, and often do, come with strings attached. This lack of transparency and openness, as well as mechanisms to prevent it, provides ample ground for influence peddling, where those who pay the piper call the tune. Left unchecked, this party funding scenario will continue to be a serious indictment of the region's democratisation projects, crippling democracy and stunting economic development. This article consid  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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