全文获取类型
收费全文 | 489篇 |
免费 | 230篇 |
国内免费 | 62篇 |
专业分类
781篇 |
出版年
2024年 | 6篇 |
2023年 | 9篇 |
2022年 | 12篇 |
2021年 | 12篇 |
2020年 | 18篇 |
2019年 | 18篇 |
2018年 | 14篇 |
2017年 | 44篇 |
2016年 | 51篇 |
2015年 | 30篇 |
2014年 | 55篇 |
2013年 | 31篇 |
2012年 | 55篇 |
2011年 | 47篇 |
2010年 | 33篇 |
2009年 | 52篇 |
2008年 | 30篇 |
2007年 | 33篇 |
2006年 | 57篇 |
2005年 | 36篇 |
2004年 | 26篇 |
2003年 | 19篇 |
2002年 | 16篇 |
2001年 | 10篇 |
2000年 | 6篇 |
1999年 | 10篇 |
1998年 | 7篇 |
1997年 | 1篇 |
1996年 | 5篇 |
1995年 | 8篇 |
1994年 | 5篇 |
1993年 | 6篇 |
1992年 | 5篇 |
1991年 | 4篇 |
1990年 | 4篇 |
1989年 | 6篇 |
排序方式: 共有781条查询结果,搜索用时 0 毫秒
91.
Subspace dynamic‐simplex linear interpolation search for mixed‐integer black‐box optimization problems 下载免费PDF全文
Honggang Wang 《海军后勤学研究》2017,64(4):305-322
Design and management of complex systems with both integer and continuous decision variables can be guided using mixed‐integer optimization models and analysis. We propose a new mixed‐integer black‐box optimization (MIBO) method, subspace dynamic‐simplex linear interpolation search (SD‐SLIS), for decision making problems in which system performance can only be evaluated with a computer black‐box model. Through a sequence of gradient‐type local searches in subspaces of solution space, SD‐SLIS is particularly efficient for such MIBO problems with scaling issues. We discuss the convergence conditions and properties of SD‐SLIS algorithms for a class of MIBO problems. Under mild conditions, SD‐SLIS is proved to converge to a stationary solution asymptotically. We apply SD‐SLIS to six example problems including two MIBO problems associated with petroleum field development projects. The algorithm performance of SD‐SLIS is compared with that of a state‐of‐the‐art direct‐search method, NOMAD, and that of a full space simplex interpolation search, Full‐SLIS. The numerical results suggest that SD‐SLIS solves the example problems efficiently and outperforms the compared methods for most of the example cases. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 305–322, 2017 相似文献
92.
We consider the integrated problem of optimally maintaining an imperfect, deteriorating sensor and the safety‐critical system it monitors. The sensor's costless observations of the binary state of the system become less informative over time. A costly full inspection may be conducted to perfectly discern the state of the system, after which the system is replaced if it is in the out‐of‐control state. In addition, a full inspection provides the opportunity to replace the sensor. We formulate the problem of adaptively scheduling full inspections and sensor replacements using a partially observable Markov decision process (POMDP) model. The objective is to minimize the total expected discounted costs associated with system operation, full inspection, system replacement, and sensor replacement. We show that the optimal policy has a threshold structure and demonstrate the value of coordinating system and sensor maintenance via numerical examples. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 399–417, 2017 相似文献
93.
针对花朵授粉算法易陷入局部极值、收敛速度慢等不足,提出一种具有族群机制的花朵授粉算法。该算法把种群分成多个族群,各族群的最优个体再组成新的种群,进而促进种群间的信息交流,有效地协调种群进化过程中的全局搜索和局部搜索能力,避免个体的早熟收敛,提高算法的全局寻优能力及收敛速度。通过8个CEC2005benchmark测试函数进行测试比较,仿真结果表明,改进算法的寻优性能明显优于基本的花朵授粉算法、粒子群算法和蝙蝠算法,其收敛精度、收敛速度、鲁棒性均较对比算法有较大提高。 相似文献
94.
95.
96.
97.
minimax 问题是工程优化设计中普遍存在的问题。本文首次采用分组坐标轮换法求解该问题,通过分析获得了该算法收敛的充分条件(如果收敛,还可计算最大轮换次数)。一些数值计算验证了文中的结论,本文还把该算法用于四连杆实现函数机构的优化设计. 相似文献
98.
We study a stochastic outpatient appointment scheduling problem (SOASP) in which we need to design a schedule and an adaptive rescheduling (i.e., resequencing or declining) policy for a set of patients. Each patient has a known type and associated probability distributions of random service duration and random arrival time. Finding a provably optimal solution to this problem requires solving a multistage stochastic mixed‐integer program (MSMIP) with a schedule optimization problem solved at each stage, determining the optimal rescheduling policy over the various random service durations and arrival times. In recognition that this MSMIP is intractable, we first consider a two‐stage model (TSM) that relaxes the nonanticipativity constraints of MSMIP and so yields a lower bound. Second, we derive a set of valid inequalities to strengthen and improve the solvability of the TSM formulation. Third, we obtain an upper bound for the MSMIP by solving the TSM under the feasible (and easily implementable) appointment order (AO) policy, which requires that patients are served in the order of their scheduled appointments, independent of their actual arrival times. Fourth, we propose a Monte Carlo approach to evaluate the relative gap between the MSMIP upper and lower bounds. Finally, in a series of numerical experiments, we show that these two bounds are very close in a wide range of SOASP instances, demonstrating the near‐optimality of the AO policy. We also identify parameter settings that result in a large gap in between these two bounds. Accordingly, we propose an alternative policy based on neighbor‐swapping. We demonstrate that this alternative policy leads to a much tighter upper bound and significantly shrinks the gap. 相似文献
99.
100.
为提高军队自动化立体仓库的出库能力,提出应根据需求变化对在库物资货位进行动态调整,从而最大限度地保障军队物资需求。综合考虑堆垛机总行程、货物离散度和出库频率等评价指标,采用遗传算法对该多目标优化问题进行求解,并运用Matalab仿真。结果表明,该方法能较好地提高军队自动化立体仓库在需求动态变化时的出库能力。同时,该研究对一般仓库的货位优化也有一定的借鉴意义。 相似文献