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.
The problem of semiconductor supply chain coordinated planning with multiple wafer fabrication plants, multiple probe plants, multiple assembly plants and multiple final test plants is studied. A model of this problem was constructed, and a method based on knowledge evolution algorithm was proposed to solve this problem. An example was presented and by contrast with the method of particle swarm optimization...
Knowledge evolution algorithm (KEA) is a new optimization algorithm relies on the mechanism of knowledge evolution, and a series of parameters used in the algorithm play an important role in the optimization performance. Based on the knapsack problems, basic principles of parameter setting are proposed by using simulation experiments, which are beneficial to further application and promotion of the...
The lot sizing problem is to find production quantities that will minimize the total setup cost, production cost and holding cost. Knowledge evolution algorithm for capacitated lot sizing problem was presented in this paper. A framework of knowledge evolution algorithm and the detailed realization of the algorithm were illustrated. The example of other literatures was computed. By comparison of the...
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.