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 Taguchi-based particle swarm optimization (TBPSO) algorithm is proposed for solving multi-objective flowshop scheduling problems (FSPs). The proposed TBPSO integrates particle swarm optimization and Taguchi-based crossover. The proposed TBPSO is the use of a PSO to explore the optimal feasible region and the use of the Taguchi-based crossover to exploit the better solution. As a result, the TBPSO...
The purpose of this study is to improve the Linde-Buzo-Gray (LBG) algorithm by using improved particle swarm optimization (IPSO) to generate vector quantization (VQ) codebooks. The proposed IPSO-LBG algorithm improves PSO-LBG in terms of initial particles and evolution function. The IPSO generates better initial particles by grouping the original blocks and expands search area by dynamically adjusting...
This article is concerned with quadratic fractional optimal control problems with linear state constraints. Such problems are called the {\em continuous-time quadratic fractional programming problems} (CQFP). Some basic properties of parametric continuous-time quadratic programming problems pertaining to (CQFP) are derived. By these properties, (CQFP) can be reduced to continuous-time quadratic programming...
Teacher volunteer transferring program (TVTP) in Taiwan provides transferring chances for the teachers serving in public elementary schools. The kernel flow of TVTP involves a special NP-hard rostering operation. That is, an exhausted search for exploring the whole transferring cases is impossible while the practical problem size is not small. Therefore, current Taiwan TVTP adopts deterministically...
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.