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.
According to the premature convergence and low searching efficiency of the standard simulated annealing algorithm in workshop planning applications, this paper proposes a factory planning model of aircraft engine transmission parts based on improved genetic algorithm optimized simulated annealing. First, the mechanism floating-point coding is referenced to arithmetic crossover operation for crossover...
An optimized algorithm according to a variety of population genetic-variable neighborhood search was proposed to solve the problem of flexible job shop scheduling. The new algorithm aims at minimizing the makespan, obtaining the smallest machine maximum load and the smallest total machine minimum loads. At the same time, the new algorithm improves the inherent defects of poor local search ability,...
Job shop scheduling problem, due to its discrete, dynamic, multi-machine, multi-variables, constraining and other typical NP-hard resistance natures, is bound to play an important role in NP studies. This paper proposes a new improved genetic algorithm, the isolation niche algorithm and adaptive genetic algorithm, for the sake of improving quality of solutions. Based on numerous examples and data...
In this paper, genetic algorithm was used to solve the job shop scheduling problem with assembly constraints. The model of job shop scheduling problem with assembly constraints was built up by analyzing the characteristics of production process with the sequence constraints. Aiming at the special characteristics of the job in the processing and combining genetic algorithm theory, a feasible chromosome...
Taking constraints of optical network into account, this paper studies the survivability of virtual optical network embedding in different domain based on Software Defined Network. Optical network virtualization in different areas can promote the efficiency of physical infrastructure among different users and applications. An integrated control model is established in this paper based on the Network...
The performance of Particle Swarm Optimizer (PSO) is not only related with the inertia weight, but also with the swarm size. In a typical second-order discrete transfer function case, an analysis about swarm size and inertia weight selection on PSO optimizing performance in system identification is given. Through simulations of different sets of the two parameters, this paper gives a selection of...
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.