全文获取类型
收费全文 | 196篇 |
免费 | 0篇 |
专业分类
电工技术 | 3篇 |
机械仪表 | 5篇 |
建筑科学 | 2篇 |
无线电 | 1篇 |
一般工业技术 | 17篇 |
原子能技术 | 1篇 |
自动化技术 | 167篇 |
出版年
2023年 | 3篇 |
2022年 | 1篇 |
2021年 | 1篇 |
2020年 | 1篇 |
2019年 | 8篇 |
2018年 | 1篇 |
2017年 | 17篇 |
2016年 | 12篇 |
2015年 | 20篇 |
2014年 | 16篇 |
2013年 | 24篇 |
2012年 | 17篇 |
2011年 | 12篇 |
2010年 | 7篇 |
2009年 | 16篇 |
2008年 | 13篇 |
2007年 | 3篇 |
2006年 | 15篇 |
2005年 | 3篇 |
2004年 | 2篇 |
2000年 | 2篇 |
1999年 | 1篇 |
1998年 | 1篇 |
排序方式: 共有196条查询结果,搜索用时 15 毫秒
121.
Renu Tyagi Millie Pant Yuvraj Singh Negi Musrrat Ali 《Materials and Manufacturing Processes》2015,30(4):464-473
In the present study, an attempt is made to optimize the electrical performance of the thin polymeric films through optimization techniques. The study is conducted in two phases: (1) laboratory experiments and (2) through numerical optimization. For laboratory analysis, thin and transparent films are prepared using polyethersulfone (PES) as host material and meta-nitroaniline (MNA) as guest materials. A set of nine film samples are prepared by the solution casting method in the laboratory using different concentrations of MNA. The electrical properties capacitance, conductance, and dissipation factor of films are measured by Aligent Impedance Analyzer. These characteristics are then optimized mathematically. For this purpose, initially single-objectives are considered for optimizing the electrical properties individually, and later a multiobjective model is considered for analyzing the properties simultaneously. The algorithms employed are metaheuristics: genetic algorithms, particle swarm optimization, differential evolution, and its variant modified differential evolution along with fmincon (a MATLAB toolbox) for single-objective optimization and multiobjective differential evolution algorithm and nondominated sorting genetic algorithm-II for multiobjective optimization. 相似文献
122.
Wireless body area networks are wireless sensor networks whose adoption has recently emerged and spread in important healthcare applications, such as the remote monitoring of health conditions of patients. A major issue associated with the deployment of such networks is represented by energy consumption: in general, the batteries of the sensors cannot be easily replaced and recharged, so containing the usage of energy by a rational design of the network and of the routing is crucial. Another issue is represented by traffic uncertainty: body sensors may produce data at a variable rate that is not exactly known in advance, for example because the generation of data is event-driven. Neglecting traffic uncertainty may lead to wrong design and routing decisions, which may compromise the functionality of the network and have very bad effects on the health of the patients. In order to address these issues, in this work we propose the first robust optimization model for jointly optimizing the topology and the routing in body area networks under traffic uncertainty. Since the problem may result challenging even for a state-of-the-art optimization solver, we propose an original optimization algorithm that exploits suitable linear relaxations to guide a randomized fixing of the variables, supported by an exact large variable neighborhood search. Experiments on realistic instances indicate that our algorithm performs better than a state-of-the-art solver, fast producing solutions associated with improved optimality gaps. 相似文献
123.
Global optimization for mining complexes aims to generate a production schedule for the various mines and processing streams that maximizes the economic value of the enterprise as a whole. Aside from the large scale of the optimization models, one of the major challenges associated with optimizing mining complexes is related to the blending and non-linear geo-metallurgical interactions in the processing streams as materials are transformed from bulk material to refined products. This work proposes a new two-stage stochastic global optimization model for the production scheduling of open pit mining complexes with uncertainty. Three combinations of metaheuristics, including simulated annealing, particle swarm optimization and differential evolution, are tested to assess the performance of the solver. Experimental results for a copper-gold mining complex demonstrate that the optimizer is capable of generating designs that reduce the risk of not meeting production targets, have 6.6% higher expected net present value than the deterministic-equivalent design and 22.6% higher net present value than an industry-standard deterministic mine planning software. 相似文献
124.
The use of metaheuristics for solving the Single-Item Dynamic Lot Sizing problem with returns and remanufacturing has increasingly gained research interest. Recently, preliminary experiments with Particle Swarm Optimization revealed that population-based algorithms can be competitive with existing state-of-the-art approaches. In the current work, we thoroughly investigate the performance of a very popular population-based algorithm, namely Differential Evolution (DE), on the specific problem. The most promising variant of the algorithm is experimentally identified and properly modified to further enhance its performance. Also, necessary modifications in the formulation of the corresponding optimization problem are introduced. The algorithm is applied on an abundant test suite employed in previous studies. Its performance is analyzed and compared with a state-of-the-art approach as well as with a previously investigated metaheuristic algorithm. The results suggest that specific DE variants can be placed among the most efficient approaches, thereby enriching the available algorithmic artillery for tackling the specific type of problems. 相似文献
125.
This paper presents a public transit network route generation algorithm. The main contribution of this work is the introduction of new route generation algorithms. The proposed route generation algorithm is tested on Mandl׳s Swiss Road network and the four large networks presented in recent previous work. Three parameters are used to evaluate the route sets generated by the proposed algorithm. These are the zero transfer percentage, the average travel time, and the total route cost. The route sets generated for the large networks have better parameter values compared to recent previous work. 相似文献
126.
In this paper, we present a mathematical model and a solution approach for the discrete berth scheduling problem, where vessel arrival and handling times are not known with certainty. The proposed model provides a robust berth schedule by minimizing the average and the range of the total service times required for serving all vessels at a marine container terminal. Particularly, a bi-objective optimization problem is formulated such that each of the two objective functions contains another optimization problem in its definition. A heuristic algorithm is proposed to solve the resulting robust berth scheduling problem. Simulation is utilized to evaluate the proposed berth scheduling policy as well as to compare it to three vessel service policies usually adopted in practice for scheduling under uncertainty. 相似文献
127.
128.
This paper deals with how to efficiently deploy energy-harvesting Relay Nodes in previously established low-cost static Wireless Sensor Networks (WSNs), assuming a single-tiered network model. The purpose is to optimise three conflicting objectives: Average Energy Cost, Average Sensitivity Area, and Network Reliability. This is the so-called Relay Node Placement Problem (RNPP), which is an NP-hard optimisation problem. We find many works assuming heuristics in the current literature. However, it is not the case for metaheuristics, which usually provide good results solving such complex problems. This situation led us to consider a wide range of MultiObjective (MO) metaheuristics: the two standard Genetic Algorithms NSGA-II and SPEA2, the trajectory algorithm MO-VNS, the algorithm based on decomposition MOEA/D, and two novel swarm intelligence algorithms MO-ABC and MO-FA, which are based on the behaviour of honey bees and fireflies, respectively. These metaheuristics are applied to optimise a freely available data set. The results obtained are analysed considering two MO metrics: hypervolume and set coverage. Through a widely accepted statistical methodology, we conclude that MO-FA provides the best performance on average. We also study the efficiency of this approach, verifying that it is a good strategy to optimise such networks, including some limitations. Finally, we compare this proposal to another author approach, which assumes a heuristic. 相似文献
129.
P.M. França N. M. Sosa V. Pureza 《International Transactions in Operational Research》1999,6(6):665-678
In the Capacitated Clustering Problem, a given set of customers with distinct demands must be partitioned into p clusters with limited capacities. The objective is to find p customers, called medians, from which the sum of the distances to all other customers in the cluster is minimized. In this article, a new adaptive tabu search approach is applied to solve the problem. Initial solutions are obtained by four constructive heuristics that use weights and distances as optimization criteria. Two neighborhood generation mechanisms are used by the local search heuristic: pairwise interchange and insertion . Computational results from 20 instances found in the literature indicate that the proposed method outperforms alternative metaheuristics developed for solving this problem. 相似文献
130.
《Optimization methods & software》2012,27(3):485-509
In this article, we perform a comparative study of different heuristics used to design combinational logic circuits. This study mainly emphasizes the use of local search hybridized with a genetic algorithm (GA) and the impact of introducing parallelism. Our results indicate that a hybridization of a GA with a local search algorithm (simulated annealing) is beneficial and that the use of parallelism not only introduces a speedup in the algorithms compared (as expected) but also allows us to improve the quality of the solutions found. 相似文献