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.
A linear bilevel programming problem can be reformulated as a single level mathematical program with complementarity constraints, which in turn is equivalent to a mixed integer (0-1) linear programming problem. A binary differential evolution algorithm with a linear programming solver is developed to solve the mixed integer (0-1) linear programming problem. The computational results show the efficiency...
With the rapid development of the intelligent mobile terminal equipment, all kinds of English word mobile learning software have been appeared on the market. These learning software make way to memorize English words more diversified and efficient. However, many words in the thesaurus software are simply presented to the learner, but do not reflect the memory management function modules. In addition,...
For automating the monitoring works of a Remotely Operated Underwater Vehicle (ROV), we developed a path planning algorithm, which generates a efficient monitoring path for a semi-autonomous ROV. Firstly we categorized five typed sensor information in 2D Euclidean space, and defined the certainty for the sensor information and its space. Moreover, we defined the reliability function for comparing...
In so many combinatorial optimization problems, Job shop scheduling problems have earned a reputation for being difficult to solve. Genetic algorithm has demonstrated considerable success in providing efficient solutions to many non-polynomial-hard optimization problems. In the field of job shop scheduling, genetic algorithm has been intensively researched, but it's converge speed is not favorable...
Supply chain optimization models typically assume that facilities never fail. However, in the real world cases facilities are always subject to disruptions of various sorts due to natural disasters, strikes, machine breakdowns, power outages, and other factors. This paper investigates an integrated supply chain optimization problem that optimizes facility locations, customer allocations, and inventory...
Flexible job shop scheduling problem(s) (FJSP) were study and discussed in large amount. However, it is still far from a real-world manufacturing environment, in which disruptions such as machine failure must be taken into account. The goal of this paper is to create a genetic algorithm (GA) with very special chromosome encoding to handle FJSP that can adapt to disruption to reflect more closely the...
In so many combinatorial optimization problems, Job shop scheduling problems have earned a reputation for being difficult to solve. Genetic algorithm has demonstrated considerable success in providing efficient solutions to many non-polynomial-hard optimization problems. In the field of job shop scheduling, genetic algorithm has been intensively researched, and there are nine kinds of methods were...
This paper discussed the time-delay filtration technique, and analyzed the importance of precise design of the parameters of time-delay filter, also a proposal was bring forward about an adaptive time-delay filtration control structure based on genetic algorithm toolbox (GAOT). Furthermore, the control block diagram was given, then optimized the three parameters of the time-delay filter based on GAOT...
A new approach for the synthesis of thinned linear array with minimum sidelobe level is introduced. The method is a genetic algorithm based on orthogonal design. The orthogonal design with the factor analysis, an experimental design method, is applied to the genetic algorithm, to make the algorithm be more robust, statistically sound and quickly convergent. In order to evaluate the performance of...
MTSP included two categories: the first, distributed visit cities (points) number to every salesman, the distribution required balanced cities number. Second distributed MTSP walking distance to every salesman, it required balanced path length. For the MTSP which balance route, designed the hybrid algorithm, it based on genetic algorithms and 2-opt algorithm. The coding method, algorithm steps and...
Jobshop scheduling is a typical NP hard problem. In the distributed manufacturing environment, it becomes a more intractable one with the characters of distributed object, multiple target and strong dynamic. A novel distribution jobshop scheduling method based on multi-agent mechanism and genetic algorithm is presented. A distributed scheduling system framework, which composed of several jobshop agents,...
Supervision issues exist among almost every industry of this world. Based on a multi-agent modeling and simulation approach, this paper, which is different from the existing researches, designs the interaction rules of supervision and violation, builds the evolving mechanism using genetic algorithm, and simulates the evolving process on the swarm platform. On the basis of the results of the simulation,...
The genetic algorithm with wavelet approximation is applied to nonholonomic motion planning. The problem of nonholonomic motion planning is formulated as an optimal control problem for a drift-free control system. The genetic algorithm is proposed to search for the optimal solution, instead of traditional optimal method of Newton iteration. The control input is approximated by the discrete orthogonal...
In this paper, a fast computational method for a class of nonlinear bilevel programming problems is proposed. In these problems, the lower-level problem can be decomposed into some paratactic and independent sub-problems. First, by Karush-Kuhn-Tucker optimality, the stationary-points of these sub-problems corresponding to the upper-level variables can be determined. As a result, this kind of nonlinear...
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.