全文获取类型
收费全文 | 123篇 |
免费 | 34篇 |
国内免费 | 12篇 |
出版年
2024年 | 1篇 |
2023年 | 1篇 |
2021年 | 2篇 |
2020年 | 1篇 |
2019年 | 2篇 |
2018年 | 4篇 |
2017年 | 8篇 |
2016年 | 11篇 |
2015年 | 9篇 |
2014年 | 11篇 |
2013年 | 7篇 |
2012年 | 16篇 |
2011年 | 12篇 |
2010年 | 5篇 |
2009年 | 6篇 |
2008年 | 8篇 |
2007年 | 10篇 |
2006年 | 5篇 |
2005年 | 10篇 |
2004年 | 7篇 |
2003年 | 4篇 |
2002年 | 3篇 |
2001年 | 5篇 |
2000年 | 5篇 |
1999年 | 1篇 |
1998年 | 5篇 |
1997年 | 1篇 |
1996年 | 1篇 |
1995年 | 1篇 |
1993年 | 3篇 |
1992年 | 2篇 |
1990年 | 1篇 |
1989年 | 1篇 |
排序方式: 共有169条查询结果,搜索用时 15 毫秒
151.
152.
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 相似文献
153.
针对分布式存储环境下显式差分方法的并行计算问题 ,依据分布式存储多处理机的体系结构特点 ,提出了一个重叠边界优化模型 ;该模型目前已成功应用于中国科学院第三代海洋环流模式的分布式并行计算优化。 相似文献
154.
铁路区间信号系统测试评估平台是对铁路区间列车运行安全控制和防护系统进行可靠性、安全性测试及评估的平台.区间信号设备与列车运行仿真子系统是平台的一个子系统,它为平台提供了一个虚拟的现场环境.采用面向对象技术和离散事件仿真技术对仿真子系统进行了研究.详细地阐述了信号设备及列车的仿真模型、设计和仿真算法,并给出仿真实例,满足平台对仿真子系统地要求. 相似文献
155.
An effective hybrid optimization method is proposed by integrating an adaptive Kriging (A-Kriging) into an improved partial swarm optimization algorithm (IPSO) to give a so-called A-Kriging-IPSO for maxi-mizing the buckling load of laminated composite plates (LCPs) under uniaxial and biaxial compressions. In this method, a novel iterative adaptive Kriging model, which is structured using two training sample sets as active and adaptive points, is utilized to directly predict the buckling load of the LCPs and to improve the efficiency of the optimization process. The active points are selected from the initial data set while the adaptive points are generated using the radial random-based convex samples. The cell-based smoothed discrete shear gap method (CS-DSG3) is employed to analyze the buckling behavior of the LCPs to provide the response of adaptive and input data sets. The buckling load of the LCPs is maximized by utilizing the IPSO algorithm. To demonstrate the efficiency and accuracy of the proposed methodology, the LCPs with different layers (2, 3, 4, and 10 layers), boundary conditions, aspect ratios and load patterns (biaxial and uniaxial loads) are investigated. The results obtained by proposed method are in good agreement with the literature results, but with less computational burden. By applying adaptive radial Kriging model, the accurate optimal results-based predictions of the buckling load are obtained for the studied LCPs. 相似文献
156.
We present two random search methods for solving discrete stochastic optimization problems. Both of these methods are variants of the stochastic ruler algorithm. They differ from our earlier modification of the stochastic ruler algorithm in that they use different approaches for estimating the optimal solution. Our new methods are guaranteed to converge almost surely to the set of global optimal solutions under mild conditions. We discuss under what conditions these new methods are expected to converge faster than the modified stochastic ruler algorithm. We also discuss how these methods can be used for solving discrete optimization problems when the values of the objective function are estimated using either transient or steady‐state simulation. Finally, we present numerical results that compare the performance of our new methods with that of the modified stochastic ruler algorithm when applied to solve buffer allocation problems. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
157.
系统研究了模糊离散变结构控制的设计方法,提出了几种具体设计方案.对于变结构控制而言,模糊逻辑的引入可以使滑模(变结构)控制具备推理和学习能力,控制信号得以柔化,能够减轻或避免一般滑模控制的抖振现象;对于模糊控制而言,滑模控制思想的引入可以大大简化控制结构,保证控制系统的鲁棒稳定性,对模糊控制系统的设计和性能分析提供了一种工具. 相似文献
158.
We present two frameworks for designing random search methods for discrete simulation optimization. One of our frameworks is very broad (in that it includes many random search methods), whereas the other one considers a special class of random search methods called point‐based methods, that move iteratively between points within the feasible region. Our frameworks involve averaging, in that all decisions that require estimates of the objective function values at various feasible solutions are based on the averages of all observations collected at these solutions so far. Also, the methods are adaptive in that they can use information gathered in previous iterations to decide how simulation effort is expended in the current iteration. We show that the methods within our frameworks are almost surely globally convergent under mild conditions. Thus, the generality of our frameworks and associated convergence guarantees makes the frameworks useful to algorithm developers wishing to design efficient and rigorous procedures for simulation optimization. We also present two variants of the simulated annealing (SA) algorithm and provide their convergence analysis as example application of our point‐based framework. Finally, we provide numerical results that demonstrate the empirical effectiveness of averaging and adaptivity in the context of SA. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
159.
160.