全文获取类型
收费全文 | 122篇 |
免费 | 0篇 |
专业分类
电工技术 | 2篇 |
化学工业 | 7篇 |
金属工艺 | 7篇 |
机械仪表 | 4篇 |
建筑科学 | 1篇 |
能源动力 | 4篇 |
轻工业 | 4篇 |
无线电 | 42篇 |
一般工业技术 | 3篇 |
冶金工业 | 32篇 |
原子能技术 | 1篇 |
自动化技术 | 15篇 |
出版年
2024年 | 1篇 |
2021年 | 2篇 |
2020年 | 1篇 |
2017年 | 3篇 |
2016年 | 2篇 |
2015年 | 1篇 |
2014年 | 2篇 |
2013年 | 4篇 |
2012年 | 4篇 |
2011年 | 3篇 |
2010年 | 2篇 |
2009年 | 5篇 |
2008年 | 8篇 |
2007年 | 7篇 |
2006年 | 4篇 |
2005年 | 3篇 |
2004年 | 2篇 |
2003年 | 1篇 |
2002年 | 5篇 |
2001年 | 1篇 |
2000年 | 2篇 |
1999年 | 4篇 |
1998年 | 9篇 |
1997年 | 8篇 |
1996年 | 5篇 |
1995年 | 6篇 |
1994年 | 3篇 |
1993年 | 3篇 |
1992年 | 3篇 |
1991年 | 3篇 |
1989年 | 1篇 |
1988年 | 3篇 |
1986年 | 2篇 |
1985年 | 1篇 |
1984年 | 4篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1980年 | 1篇 |
1977年 | 1篇 |
排序方式: 共有122条查询结果,搜索用时 0 毫秒
121.
Christophe Duhamel Philippe Lacomme Caroline Prodhon 《Engineering Applications of Artificial Intelligence》2012,25(2):345-358
Routing Problems have been deeply studied over the last decades. Split procedures have proved their efficiency for those problems, especially within global optimization frameworks. The purpose is to build a feasible routing solution by splitting a giant tour into trips. This is done by computing a shortest path on an auxiliary graph built from the giant tour. One of the latest advances consists in handling extra resource constraints through the generation of labels on the nodes of the auxiliary graph. Lately, the development of a new generic split family based on a Depth First Search (DFS) approach during label generation has highlighted the efficiency of this new method for the routing problems, through extensive numerical evaluations on the location-routing problem.In this paper, we present a hybrid Evolutionary Local Search (hybrid ELS) for non-homogeneous fleet Vehicle Routing Problems (VRP) based on the application of split strategies. Experiments show our method is able to handle all known benchmarks, from Vehicle Fleet Mix Problems to Heterogeneous Fleet VRP (HVRP). We also propose a set of new realistic HVRP instances from 50 to more than 250 nodes coming from French counties. It relies on real distances in kilometers between towns. Since many classical HVRP instance sets are solved to optimality, this new set of instances could allow a fair comparative study of methods. The DFS split strategy shows its efficiency and attests the fact that it can be a promising line of research for routing problems including numerous additional constraints. 相似文献
122.
Christophe Duhamel Andréa Cynthia Santos 《International Transactions in Operational Research》2024,31(1):192-220
This study presents models and heuristics for solving the strong network orientation problem (SNOP), which can model several tactical optimization problems of setting directions in urban networks. The objective is to set an orientation for each edge in an undirected graph such that the resulting digraph is strongly connected and the total travel distance between any pair of nodes is minimized (or maximized). Investigating tactical optimization problems such as SNOP is motivated by several challenges in urban networks due to the growth of population in urban areas, large number of daily trips, increasing price of maintaining urban networks, and the need to reduce air pollution and passive noise. Thus, a new trend is to utilize the urban networks better. In this context, we first use a multicommodity flow formulation to model the minimization problem. The maximization version is modeled by using the dual formulation of the shortest path problem. Then, scalable heuristic strategies for solving SNOP are investigated. For such purpose, we first propose basic components such as constructive heuristics, perturbations and local searches. They are combined into several metaheuristics based on local searches, multi-start and evolutionary schemes, i.e. Multistart Local Search, Iterated Local Search (ILS), Relaxed ILS, Evolutionary Local Search (ELS), Relaxed ELS, and Variable Neighborhood Search. Computational experiments have been performed to analyze the proposed methods in terms of efficiency and quality of solutions, using grid instances and a graph from downtown Clermont-Ferrand in France. 相似文献