The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Due to the “premature” phenomenon and poor local search ability of genetic algorithm, an improved genetic algorithm, adaptive and parallel simulated annealing genetic algorithm based on cloud model (PCASAGA), is proposed in this paper. This algorithm integrates cloud model, multi-populations optimization mechanism, parallel techniques, simulated annealing algorithm and adaptive mechanism. It applies...
Crossover probability Pc and mutation probability Pm are important parameters of genetic algorithm. Self-adaptive genetic algorithm can reach good balance between convergence speed and global optimum by adjusting Pc and Pm adaptively according to the fitness values difference among individuals. But it is not suitable to the early period of the evolutionary process. The improved self-adaptive GA proposed...
A solving method with ant colony system for irregular parts nesting was put forward. A method for an irregular part's graph coding and pretreatment was proposed. The proposed method converted the nesting problem into an orthogonal rectangular nesting problem by combining and filling algorithm. By use of remaining rectangle matching and orthogonal accessing algorithm, an automatic nesting system was...
In this paper, the method combining genetic algorithm and finite element was used in identification of magnitude and location of load for composite structure. Further study on encoding methods of chromosome was conducted. The binary coding method which encodes the node number of load location and magnitude of load is simple and efficient. There is a mapping error in continuous function discretization,...
Sudden service disruption due to natural or man-made disaster is one of the major threats to commercial supply chains and military logistics at present. In this paper, we present an integer-linear programming model for critical facilities protection based on time satisfaction, which could overcome the weakness of simply using time and distance in previous researches. The objective function is maximizing...
Knowledge transfer as an important branch of knowledge management has got more and more concern. This paper takes the absorption, the transformation and the release of the knowledgement as a starting point, to describe the dynamic evolution of the Capacities in the course of knowledge transfer. Using genetic algorithms to describe the iterative process of the capacity formation.
Conventional image matching method is a correlation matching method of ergodic region, and much time should be wasted on non-optimal matching points. It is not only waste matching and calculation time but also lead to get non- matching points. Based on Multiresolution Pagoda Structure Algorithm (MPSA) and the genetic algorithm and projection algorithm, a new image matching method (GMPT) is presented...
The paper focuses on developing a new multiple criteria decision-making (MCDM) methodology for global web services selection based on QoS criteria, which integrates the multi-objective optimization with a fuzzy multi-attributive group decision-making (FMAGDM) technique. The study concentrates on the task of finding and then evaluating (or ranking) the finite number of pareto-optimal design alternatives...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.