全文获取类型
收费全文 | 240篇 |
免费 | 102篇 |
国内免费 | 18篇 |
出版年
2024年 | 1篇 |
2023年 | 2篇 |
2022年 | 2篇 |
2021年 | 2篇 |
2020年 | 8篇 |
2019年 | 5篇 |
2018年 | 1篇 |
2017年 | 14篇 |
2016年 | 17篇 |
2015年 | 16篇 |
2014年 | 21篇 |
2013年 | 16篇 |
2012年 | 15篇 |
2011年 | 11篇 |
2010年 | 10篇 |
2009年 | 25篇 |
2008年 | 18篇 |
2007年 | 20篇 |
2006年 | 24篇 |
2005年 | 13篇 |
2004年 | 21篇 |
2003年 | 8篇 |
2002年 | 8篇 |
2001年 | 10篇 |
2000年 | 9篇 |
1999年 | 5篇 |
1998年 | 4篇 |
1997年 | 6篇 |
1996年 | 6篇 |
1995年 | 5篇 |
1994年 | 4篇 |
1993年 | 6篇 |
1992年 | 5篇 |
1991年 | 5篇 |
1990年 | 12篇 |
1989年 | 4篇 |
1988年 | 1篇 |
排序方式: 共有360条查询结果,搜索用时 15 毫秒
241.
Augmented nested sampling for stochastic programs with recourse and endogenous uncertainty 下载免费PDF全文
We propose a novel simulation‐based approach for solving two‐stage stochastic programs with recourse and endogenous (decision dependent) uncertainty. The proposed augmented nested sampling approach recasts the stochastic optimization problem as a simulation problem by treating the decision variables as random. The optimal decision is obtained via the mode of the augmented probability model. We illustrate our methodology on a newsvendor problem with stock‐dependent uncertain demand both in single and multi‐item (news‐stand) cases. We provide performance comparisons with Markov chain Monte Carlo and traditional Monte Carlo simulation‐based optimization schemes. Finally, we conclude with directions for future research. 相似文献
242.
We study a multi‐stage dynamic assignment interdiction (DAI) game in which two agents, a user and an attacker, compete in the underlying bipartite assignment graph. The user wishes to assign a set of tasks at the minimum cost, and the attacker seeks to interdict a subset of arcs to maximize the user's objective. The user assigns exactly one task per stage, and the assignment costs and interdiction impacts vary across stages. Before any stage commences in the game, the attacker can interdict arcs subject to a cardinality constraint. An interdicted arc can still be used by the user, but at an increased assignment cost. The goal is to find an optimal sequence of assignments, coupled with the attacker's optimal interdiction strategy. We prove that this problem is strongly NP‐hard, even when the attacker can interdict only one arc. We propose an exact exponential‐state dynamic‐programming algorithm for this problem as well as lower and upper bounds on the optimal objective function value. Our bounds are based on classical interdiction and robust optimization models, and on variations of the DAI game. We examine the efficiency of our algorithms and the quality of our bounds on a set of randomly generated instances. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 373–387, 2017 相似文献
243.
244.
This article treats the problem of subdividing an area for storing containers such that the workload is evenly shared among the cranes operating the resulting subareas. We consider two crane sets: while noncrossing constraints between cranes of the same set need to be observed, cranes of different sets do not interfere. Such a problem setting is, for instance, relevant for scheduling the (un‐)loading of vessels by parallel quay cranes operating on opposing berths or in container yards with cross‐over cranes. We formalize the resulting optimization problem, prove computational complexity, and present exact and heuristic solution procedures. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
245.
传统的装备配置优化问题一般采用确定性的数学规划方法解决,难以满足高技术条件下现代战争中需要对大量随机现象和模糊现象进行精确定量分析的实际要求。在分析了高技术条件下装备配置问题一般特性的基础上,根据机会约束规划和模糊机会约束规划的思想,提出了一种新的建立装备配置优化模型的思路和方法,并给出了基于随机模拟的遗传算法的实值算例,算例结果与实际情况基本相符,反映了模型的科学性与实用性。 相似文献
246.
多边形障碍环境中避障路径的遗传算法 总被引:2,自引:2,他引:0
研究了平面障碍环境中避障的遗传算法,重点介绍了障碍环境的模型构造和用遗传算法求解该模型的方法设计.采用了与已有遗传算法不同的染色体编码方式和不同的遗传算子设计,在初始群体产生时尽量避免了引入无效基因,提高了染色体进化的效率,使得该算法具有很好的寻优能力,实验结果也表明了该算法的有效性. 相似文献
247.
248.
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. 相似文献
249.
着重分析了减损与延寿控制律的综合过程,提出其基于多目标优化方法的理论基础。在建立某型液体火箭发动机系统动力学模型、关键部件之涡轮叶片的结构分析模型及其材料损伤模型的基础上,分析了应用非线性规划法求解减损与延寿控制律的过程。对发动机起动过程实施减损与延寿控制,结果表明在系统性能略微损失的情况下,可以较大幅度地减小涡轮叶片的损伤,从而达到延长发动机工作寿命的目的。 相似文献
250.
In this work, we examine port crane scheduling with spatial and separation constraints. Although common to most port operations, these constraints have not been previously studied. We assume that cranes cannot cross, there is a minimum distance between cranes and jobs cannot be done simultaneously. The objective is to find a crane‐to‐job matching which maximizes throughput under these constraints. We provide dynamic programming algorithms, a probabilistic tabu search, and a squeaky wheel optimization heuristic for solution. Experiments show the heuristics perform well compared with optimal solutions obtained by CPLEX for small scale instances where a squeaky wheel optimization with local search approach gives good results within short times. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献