全文获取类型
收费全文 | 519篇 |
免费 | 65篇 |
国内免费 | 2篇 |
专业分类
化学 | 1篇 |
晶体学 | 1篇 |
力学 | 2篇 |
综合类 | 21篇 |
数学 | 464篇 |
物理学 | 97篇 |
出版年
2024年 | 1篇 |
2023年 | 2篇 |
2022年 | 17篇 |
2021年 | 17篇 |
2020年 | 4篇 |
2019年 | 12篇 |
2018年 | 14篇 |
2017年 | 9篇 |
2016年 | 14篇 |
2015年 | 13篇 |
2014年 | 35篇 |
2013年 | 53篇 |
2012年 | 32篇 |
2011年 | 33篇 |
2010年 | 33篇 |
2009年 | 40篇 |
2008年 | 30篇 |
2007年 | 50篇 |
2006年 | 33篇 |
2005年 | 14篇 |
2004年 | 24篇 |
2003年 | 12篇 |
2002年 | 14篇 |
2001年 | 9篇 |
2000年 | 13篇 |
1999年 | 7篇 |
1998年 | 5篇 |
1997年 | 5篇 |
1996年 | 7篇 |
1995年 | 8篇 |
1994年 | 5篇 |
1993年 | 5篇 |
1992年 | 4篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1985年 | 5篇 |
1982年 | 1篇 |
1981年 | 1篇 |
排序方式: 共有586条查询结果,搜索用时 15 毫秒
81.
In this study we introduce a routing problem with multiple use of a single vehicle and service time in demand points (clients) with the aim of minimizing the sum of clients waiting time to receive service. This problem is relevant in the distribution of aid, in disaster stricken communities, in the recollection and/or delivery of perishable goods and personnel transportation, among other situations, where reaching clients to perform service, fast and fair, is a priority. We consider vehicle capacity and travel distance constraints which force multiple use of the vehicle in the planning horizon. This paper presents and compares two mixed integer formulations for this problem, based on a multi–level network. 相似文献
82.
In the vehicle routing literature, there is an increasing focus on time-dependent routing problems, where the time (or cost) to travel between any pair of nodes (customers, depots) depends on the departure time. The aim of such algorithms is to be able to take recurring congestion into account when planning logistics operations. To test algorithms for time-dependent routing problems, time-dependent problem data is necessary. This data usually comes in the form of three-dimensional travel time matrices that add the departure time as an extra dimension. However, most currently available time-dependent travel time matrices are not network-consistent, i.e., the travel times are not correlated both in time and in space. This stands in contrast to the behavior of real life congestion, which generally follows a specific pattern, appearing in specific areas and then affecting all travel times to and from those areas. As a result of the lack of available network-consistent travel time matrices, it is difficult to develop algorithms that are able to take this special structure of the travel time data into account. 相似文献
83.
Zizhen Zhang Oscar Che Brenda Cheang Andrew Lim Hu Qin 《European Journal of Operational Research》2013
In this paper, we extend upon current research in the vehicle routing problem whereby labour regulations affect planning horizons, and therefore, profitability. We call this extension the multiperiod vehicle routing problem with profit (mVRPP). The goal is to determine routes for a set of vehicles that maximizes profitability from visited locations, based on the conditions that vehicles can only travel during stipulated working hours within each period in a given planning horizon and that the vehicles are only required to return to the depot at the end of the last period. We propose an effective memetic algorithm with a giant-tour representation to solve the mVRPP. To efficiently evaluate a chromosome, we develop a greedy procedure to partition a given giant-tour into individual routes, and prove that the resultant partition is optimal. We evaluate the effectiveness of our memetic algorithm with extensive experiments based on a set of modified benchmark instances. The results indicate that our approach generates high-quality solutions that are reasonably close to the best known solutions or proven optima, and significantly better than the solutions obtained using heuristics employed by professional schedulers. 相似文献
84.
85.
The bi-objective Pollution-Routing Problem is an extension of the Pollution-Routing Problem (PRP) which consists of routing a number of vehicles to serve a set of customers, and determining their speed on each route segment. The two objective functions pertaining to minimization of fuel consumption and driving time are conflicting and are thus considered separately. This paper presents an adaptive large neighborhood search algorithm (ALNS), combined with a speed optimization procedure, to solve the bi-objective PRP. Using the ALNS as the search engine, four a posteriori methods, namely the weighting method, the weighting method with normalization, the epsilon-constraint method and a new hybrid method (HM), are tested using a scalarization of the two objective functions. The HM combines adaptive weighting with the epsilon-constraint method. To evaluate the effectiveness of the algorithm, new sets of instances based on real geographic data are generated, and a library of bi-criteria PRP instances is compiled. Results of extensive computational experiments with the four methods are presented and compared with one another by means of the hypervolume and epsilon indicators. The results show that HM is highly effective in finding good-quality non-dominated solutions on PRP instances with 100 nodes. 相似文献
86.
在电商海量订单背景下,在线订单拣选作业难度加大,因此设计了基于订单完全拆分的拣选分批与拣选路径综合优化模型解决此问题.模型共分两阶段.第一阶段,基于种子算法,设计考虑订单完成度、等待时间与拣选路径的拣选分批模型;第二阶段以拣选单流为单队列,设计多拣选员并行服务的拣选系统.行走策略为基于返回型和遍历型的综合策略,拣选路径优化模型采用模拟退火算法求解.算例分析表明,与传统的不拆分拣选分批模型相比,构建的综合优化模型能够显著提高拣选系统效率.拣选员为4人时,模型能够使总服务时间减少58.79%,订单完成率提高10.09%. 相似文献
87.
基于传统模拟退火算法,通过引入记忆函数、结合GIS手段,运用SPSS聚类分析来确定初始化状态种群、多种群并行机制和新状态的产生.依据种群规模采用不同产生算法来改进算法,并将改进算法应用于城市物流中确定的多目标车辆路径优化问题,验证了算法的可行性与实用价值.此外,改进算法分别与传统模拟退火算法和GIS图解法相比较,优化效率和准确率都得到了很大的提高. 相似文献
88.
在家电的集配一体化过程中,回收价格不仅影响企业的回收成本,而且同样影响车辆路径,然而在家电集配过程中回收价格因素一直未能引起足够的重视.为此,以回收价格为出发点,通过定价系统根据产品可再生利用价值与制造商所给的回收价格的差别研究车辆路径优化问题,建立该问题的数学规划模型,同时结合家电集配一体化的实际性和复杂性的要求设计了改进遗传算法.最后,结合算例进行仿真计算,验证了模型与算法的有效性. 相似文献
89.
90.
单光子量子路由对于在芯片中实现量子信息交换具有重大意义。研究单光子量子路由中的耗散影响能够更加真实的模拟实际实验的结果。研究发现耗散能级的存在使得同等条件下的量子路由概率减小,并且需要相对较强的耦合才能取得最大量子路由概率。同时,也建立了共振条件下量子路由概率同耦合强度以及耗散强度间的关系。 相似文献