全文获取类型
收费全文 | 106篇 |
免费 | 49篇 |
国内免费 | 4篇 |
出版年
2024年 | 1篇 |
2023年 | 3篇 |
2021年 | 1篇 |
2020年 | 4篇 |
2019年 | 4篇 |
2018年 | 4篇 |
2017年 | 4篇 |
2016年 | 10篇 |
2015年 | 7篇 |
2014年 | 5篇 |
2013年 | 4篇 |
2012年 | 13篇 |
2011年 | 6篇 |
2010年 | 6篇 |
2009年 | 11篇 |
2008年 | 8篇 |
2007年 | 11篇 |
2006年 | 12篇 |
2005年 | 13篇 |
2004年 | 6篇 |
2003年 | 2篇 |
2002年 | 4篇 |
2001年 | 2篇 |
2000年 | 2篇 |
1999年 | 8篇 |
1998年 | 2篇 |
1996年 | 2篇 |
1992年 | 2篇 |
1991年 | 1篇 |
1989年 | 1篇 |
排序方式: 共有159条查询结果,搜索用时 15 毫秒
151.
Integrated scheduling of loading and transportation with tractors and semitrailers separated
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Motivated by some practical applications, we study a new integrated loading and transportation scheduling problem. Given a set of jobs, a single crane is available to load jobs, one by one, onto semitrailers with a given capacity. Loaded semitrailers are assigned to tractors for transportation tasks. Subject to limited resources (crane, semitrailers, and tractors), the problem is to determine (1) an assignment of jobs to semitrailers for loading tasks, (2) a sequence for the crane to load jobs onto semitrailers, (3) an assignment of loaded semitrailers to tractors for transportation tasks, and (4) a transportation schedule of assigned tractors such that the completion time of the last transportation task is minimized. We first formulate the problem as a mixed integer linear programming model (MILPM) and prove that the problem is strongly NP‐hard. Then, optimality properties are provided which are useful in establishing an improved MILPM and designing solution algorithms. We develop a constructive heuristic, two LP‐based heuristics, and a recovering beam search heuristic to solve this problem. An improved procedure for solutions by heuristics is also presented. Furthermore, two branch‐and‐bound (B&B) algorithms with two different lower bounds are developed to solve the problem to optimality. Finally, computational experiments using both real data and randomly generated data demonstrate that our heuristics are highly efficient and effective. In terms of computational time and the number of instances solved to optimality in a time limit, the B&B algorithms are better than solving the MILPM. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 416–433, 2015 相似文献
152.
153.
航迹关联是多传感器信息融合的前提和基础,来自不同传感器的航迹数据只有在确定相互关联之后,才能进行目标运动状态信息和属性信息的融合处理。航迹关联仿真分析时往往人为地设定一些假定条件,导致算法的仿真结果出现比较大的偏差。对航迹关联算法仿真分析中的一些常见假定进行分析,结合实际应用情景,探讨航迹关联率的定义,明确了关联正确率、关联错误率和漏关联率的计算方法。 相似文献
154.
155.
基于静止标量磁强计的运动舰船定位问题的研究 总被引:2,自引:0,他引:2
建立了静止标量磁强计对运动舰船定位的模型,并给出了用遗传算法求全局较优解、然后用单纯形法进行精确局部搜索的求解参数的方法.仿真实验表明这种方法有效、可行. 相似文献
156.
157.
158.
159.