全文获取类型
收费全文 | 192篇 |
免费 | 0篇 |
专业分类
电工技术 | 3篇 |
机械仪表 | 5篇 |
建筑科学 | 2篇 |
无线电 | 1篇 |
一般工业技术 | 15篇 |
原子能技术 | 1篇 |
自动化技术 | 165篇 |
出版年
2023年 | 3篇 |
2022年 | 1篇 |
2021年 | 1篇 |
2020年 | 1篇 |
2019年 | 8篇 |
2018年 | 1篇 |
2017年 | 17篇 |
2016年 | 12篇 |
2015年 | 20篇 |
2014年 | 16篇 |
2013年 | 24篇 |
2012年 | 13篇 |
2011年 | 12篇 |
2010年 | 7篇 |
2009年 | 16篇 |
2008年 | 13篇 |
2007年 | 3篇 |
2006年 | 15篇 |
2005年 | 3篇 |
2004年 | 2篇 |
2000年 | 2篇 |
1999年 | 1篇 |
1998年 | 1篇 |
排序方式: 共有192条查询结果,搜索用时 0 毫秒
101.
Variable neighborhood search for the linear ordering problem 总被引:2,自引:0,他引:2
Carlos G. Garcia Dionisio Prez-Brito Vicente Campos Rafael Martí 《Computers & Operations Research》2006,33(12):3549
Given a matrix of weights, the linear ordering problem (LOP) consists of finding a permutation of the columns and rows in order to maximize the sum of the weights in the upper triangle. This NP-complete problem can also be formulated in terms of graphs, as finding an acyclic tournament with a maximal sum of arc weights in a complete weighted graph. In this paper, we first review the previous methods for the LOP and then propose a heuristic algorithm based on the variable neighborhood search (VNS) methodology. The method combines different neighborhoods for an efficient exploration of the search space. We explore different search strategies and propose a hybrid method in which the VNS is coupled with a short-term tabu search for improved outcomes. Our extensive experimentation with both real and random instances shows that the proposed procedure competes with the best-known algorithms in terms of solution quality, and has reasonable computing-time requirements.Variable neighborhood search (VNS) is a metaheuristic method that has recently been shown to yield promising outcomes for solving combinatorial optimization problems. Based on a systematic change of neighborhood in a local search procedure, VNS uses both deterministic and random strategies in search for the global optimum.In this paper, we present a VNS implementation designed to find high quality solutions for the NP-hard LOP, which has a significant number of applications in practice. The LOP, for example, is equivalent to the so-called triangulation problem for input–output tables in economics. Our implementation incorporates innovative mechanisms to include memory structures within the VNS methodology. Moreover we study the hybridization with other methodologies such as tabu search. 相似文献
102.
The design of effective neighborhood search procedures is a primary issue for the performance of local search and advanced metaheuristic algorithms. Several recent studies have focused on the development of variable depth neighborhoods that generate sequences of interrelated elementary moves to create more complex compound moves. These methods are chiefly conceived to produce an adaptive search as the number of elementary moves in a compound move may vary from one iteration to another depending on the state of the search. The objective is to achieve this goal with modest computational effort. Although ejection chain methods are currently the most advanced methods in this domain, they usually require more complex implementations. The filter-and-fan (F&F) method appears as an alternative to ejection chain methods allowing for the creation of compound moves based on an effective tree search design. 相似文献
103.
Satellite images normally possess relatively narrow brightness value ranges necessitating the requirement for contrast stretching, preserving the relevant details before further image analysis. Image enhancement algorithms focus on improving the human image perception. More specifically, contrast and brightness enhancement is considered as a key processing step prior to any further image analysis like segmentation, feature extraction, etc. Metaheuristic optimization algorithms are used effectively for the past few decades, for solving such complex image processing problems. In this paper, a modified differential Modified Differential Evolution (MDE) algorithm for contrast and brightness enhancement of satellite images is proposed. The proposed algorithm is developed with exploration phase by differential evolution algorithm and exploitation phase by cuckoo search algorithm. The proposed algorithm is used to maximize a defined fitness function so as to enhance the entropy, standard deviation and edge details of an image by adjusting a set of parameters to remodel a global transformation function subjective to each of the image being processed. The performance of the proposed algorithm is compared with ten recent state-of-the-art enhancement algorithms. Experimental results demonstrate the efficiency and robustness of the proposed algorithm in enhancing satellite images and natural scenes effectively. Objective evaluation of the compared methods was done using several full-reference and no-reference performance metrics. Qualitative and quantitative evaluation results proves that the proposed MDE algorithm outperforms others to a greater extend. 相似文献
104.
Athanassios Nikolakopoulos Haralambos Sarimveis 《Engineering Applications of Artificial Intelligence》2008,21(2):247-258
This work introduces a metaheuristic method for the reconstruction of the DNA string from its l-mer content in the presence of large amounts of positive and negative errors. The procedure consists of three parts: the formulation of the problem as an asymmetric traveling salesman problem (ATSP), a technique for handling the positive errors and an optimization algorithm that solves the formulated problem. The optimization algorithm is a variation of the threshold accepting method with intense local search and its function is controlled by a size diminishing shell. The optimization algorithm is used consecutively on ATSPs of continuously decreasing sizes till it reaches a final solution. The proposed method provides solutions of better quality compared to algorithms in the recent bibliography. 相似文献
105.
Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness
This paper studies the flowshop scheduling problem with a complex bicriteria objective function. A weighted sum of makespan and maximum tardiness subject to a maximum tardiness threshold value is to be optimized. This problem, with interesting potential applications in practice, has been sparsely studied in the literature. We propose global and local dominance relationships for the three-machine problem and a fast and effective genetic algorithm (GA) for the more general m-machine case. The proposed GA incorporates a novel three-phase fitness assignment mechanism specially targeted at dealing with populations in which both feasible as well as infeasible solutions might coexist. Comprehensive computational and statistical experiments show that the proposed GA outperforms the two most effective existing heuristics by a considerable margin in all scenarios. Furthermore, the proposed GA is also faster and able to find more feasible solutions. It should be noted that when the weight assigned to maximum tardiness is zero, then the problem is reduced to minimizing makespan subject to a maximum tardiness threshold value. Heuristics for both problems have been provided in the literature recently but they have not been compared. Another contribution of this paper is to compare these recent heuristics with each other. 相似文献
106.
In this article we analyze the combination of ACOhg, a new metaheuristic algorithm, plus partial order reduction applied to the problem of finding safety property violations in concurrent models using a model checking approach. ACOhg is a new kind of ant colony optimization algorithm inspired by the foraging behavior of real ants equipped with internal resorts to search in very large search landscapes. We here apply ACOhg to concurrent models in scenarios located near the edge of the existing knowledge in detecting property violations. The results state that the combination is computationally beneficial for the search and represents a considerable step forward in this field with respect to exact and other heuristic techniques. 相似文献
107.
The set-partitioning problem (SPP) is widely known for both its application potential and its computational challenge. This NP-hard problem is known to pose considerable difficulty for classical solution methods such as those based on LP technologies. In recent years, the unconstrained binary quadratic program has proven to perform well as a unified modeling and solution framework for a variety of IP problems. In this paper we illustrate how this unified framework can be applied to SPP. Computational experience is presented, illustrating the attractiveness of the approach. 相似文献
108.
In smart cities, when the real-time control of traffic lights is not possible, the global optimization of traffic-light programs (TLPs) requires the simulation of a traffic scenario (traffic flows across the whole city) that is estimated after collecting data from sensors at the street level. However, the highly dynamic traffic of a city means that no single traffic scenario is a precise representation of the real system, and the fitness of any candidate solution (traffic-light program) will vary when deployed on the city. Thus, ideal TLPs should not only have an optimized fitness, but also a high reliability, i.e., low fitness variance, against the uncertainties of the real-world. Earlier traffic-light optimization methods, e.g., based on genetic algorithms, often simulate a single traffic scenario, which neglects variance in the real-world, leading to TLPs not optimized for reliability.Our main contributions in this work are the following: (a) the analysis of the importance of reliable solutions for TLP optimization, even when all traffic scenarios are consistent with the real-world data and highly correlated; (b) the adaptation of irace, an iterated racing algorithm that is able to dynamically adjust the number of traffic scenarios required to evaluate the fitness of TLPs and their reliability; (c) the use of a large real-world case study for which real-time control is not possible and where data was obtained from sensors at the street level; and (d) a thorough analysis of solutions generated by means of irace, a Genetic Algorithm, a Differential Evolution, a Particle Swarm Optimization and a Random Search. This analysis shows that simple strategies that simulate multiple traffic scenarios are able to obtain optimized solutions with improved reliability; however, the best results are obtained by irace, among the algorithms evaluated. 相似文献
109.
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. 相似文献
110.