• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.4
• /
• pp.843-859
• /
• 2024

The university course scheduling problem (UCSP) aims at optimally arranging courses to corresponding rooms, faculties, students, and timeslots with constraints. Previously, the university staff solved this thorny problem by hand, which is very time-consuming and makes it easy to fall into chaos. Even some meta-heuristic algorithms are proposed to solve UCSP automatically, while most only utilize one single algorithm, so the scheduling results still need improvement. Besides, they lack an in-depth analysis of the inner algorithms. Therefore, this paper presents a novel and practical approach based on Tabu search and simulated annealing algorithms for solving USCP. Firstly, the initial solution of the UCSP instance is generated by one construction heuristic algorithm, the first fit algorithm. Secondly, we defined one union move selector to control the moves and provide diverse solutions from initial solutions, consisting of two changing move selectors. Thirdly, Tabu search and simulated annealing (SA) are combined to filter out unacceptable moves in a parallel mode. Then, the acceptable moves are selected by one adaptive decision algorithm, which is used as the next step to construct the final solving path. Benefits from the excellent design of the union move selector, parallel tabu search and SA, and adaptive decision algorithm, the proposed method could effectively solve UCSP since it fully uses Tabu and SA. We designed and tested the proposed algorithm in one real-world (PKNU-UCSP) and ten random UCSP instances. The experimental results confirmed its effectiveness. Besides, the in-depth analysis confirmed each component's effectiveness for solving UCSP.

• The Korean Journal of Pesticide Science
• /
• v.12 no.4
• /
• pp.421-428
• /
• 2008

This study was carried out to elucidate the effects of adjuvants on physicochemical properties and pest control efficacy of pesticide spray solution. Spray droplet sizes of pesticide solution decreased by addition of adjuvants even though its effect varied according to the pesticides. The adhesive effect of pesticides sprayed on target crops by addition of adjuvants varied according to the properties, the application methods, and the spray volume of pesticides. Wash-off of the deposited amount of active ingredients of the solution of tricyclazole WP and fenobucarb EC by simulated rainfall after spraying on rice plants dramatically reduced by adding adjuvants. The retained amount of active ingredients of the pesticides were $1.5{\sim}4.1$ times higher than those without adjuvants when subjected to simulated rainfall 6 hours after spraying. Addition of adjuvants to the propanil EC spray solution enhanced the control efficacy in barnyard grass, Echinocloa crus-galli Beauv. by $8{\sim}30%$, which showed a potential to reduce pesticide use.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 2007.05a
• /
• pp.170-175
• /
• 2007

The finite volume method for forging simulation is examined to reveal its possibility as well as its problem in this paper. For this study, the finite volume method based MSC/SuperForge and the finite element method based AFDEX are employed. The simulated results of the homogeneous compression obtained by the two softwares are compared to indicate the problems of the finite volume method while several application examples are given to show the possibility of the finite volume method for simulation of upsetter forging processes. It is shown that the finite volume method can not predict the exact solution of the homogeneous compression especially in terms of forming load and deformed shape but that it is helpful to simulate very complex forging processes which can hardly be simulated by the conventional finite element method.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2000.04b
• /
• pp.458-465
• /
• 2000

In the field of structural optimization simulated annealing (SA) algorithm has widely been adopted as an optimizer with the positive features of SA such as simplicity of the algorithm and possibility of finding global solution However, annealing process of SA algorithm based on random generator with the zeroth order structural information requires a large of number of iterations highly depending on cooling schedules and stopping criteria. In this paper, MSA algorithm is presented in the form of two phase annealing process with the effective cooling schedule and stopping criteria. With the application to optimal seismic design of steel structures, the performance of the proposed MSA algorithm has been demonstrated with respect to stability and global convergence of the algorithm

• IE interfaces
• /
• v.9 no.2
• /
• pp.203-218
• /
• 1996

This paper deals with a Direct-Input-Output Manufacturing System (DIOMS) which has a number of machine centers placed along a built-in automated storage/retrieval system (AS/RS). During its operations, the storage/retrieval(S/R) machine picks up a pallet from the pickup/deposit port of a machine center and then moves it either to an empty rack opening of the AS/RS for temporary storage or to place it on the port of another machine center for subsequent operation. The machine layout problem in DIOMS is formulated as an integer mathematical programming whose objective is to minimize the total expected distance of the loaded S/R machine during a production period. Recognizing the limit of the exact solution procedure(the Branch and Bound method), two improvement-type heuristics are proposed. One is based on the simulated annealing method and the other the pairwise interchange method. The validity of the heuristics is examined with example problems.

• Proceedings of the KSME Conference
• /
• 2007.05a
• /
• pp.1487-1492
• /
• 2007

In this paper, we apply a forging simulator to automatic simulation of a connecting-rod forging process and compare its results with others found in the literature. The process information comes from the distributed examples of DEFORM3D. The process is fully automatically simulated using the tetrahedral element capability of AFDEX3D, developed by the authors. Our results are compared with the results found from the related literature, already simulated using DEFORM3D by other researchers. The comparison shows that our results are relatively excellent especially in terms of mesh quality on which the solution accuracy depends mainly.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.26 no.4
• /
• pp.125-132
• /
• 2001

Traffic unbalance between uplink and downlink is one of the most notable characteristics in the next generation cellular mobile systems which provide multimedia services such as voice and video telephony, high-speed internet access, and mobile computing, etc. The CDMA/TDD system with unbalanced slot allocation between two links is a good solution for the traffic unbalance in this paper, we formulate the time slot and channel allocation problem for the CDMA/TDD systems in general multicell environments, which is to maximize the system capacity under the given traffic unbalance, and solve that problem by simulated annealing technique. Computational experiments show that the proposed scheme yields a good performance.

• 한국연소학회:학술대회논문집
• /
• 2005.10a
• /
• pp.93-96
• /
• 2005

High temperature furnace such as Steam power plant and incinerator contribute considerable part of NOx generation and face urgent demand of De-NOx system. Reducing agents are necessary to use De-NOx system. In this study mixing caused by direct injection of reducing agent solution spray into flue gas duct was measured. Carbonated water was used as tracer and simulated agent because ammonia as a reducing agent is not proper to experiment. Mixing and evaporation must occur simultaneously and quickly enough to achieve desirable efficiency. To achieve that, the angle of attack of static mixer and the location is simulated and $CO_2$ concentration is measured.

• The KIPS Transactions:PartB
• /
• v.14B no.7
• /
• pp.523-530
• /
• 2007

This paper proposes a new stochastic optimization algorithm for hidden Markov models (HMMs) used as a recognizer of automatic lipreading. The proposed method combines a global stochastic optimization method, the simulated annealing technique, and the local optimization method, which produces fast convergence and good solution quality. We mathematically show that the proposed algorithm converges to the global optimum. Experimental results show that training HMMs by the method yields better lipreading performance compared to the conventional training methods based on local optimization.

• Journal of the Korea Society for Simulation
• /
• v.5 no.1
• /
• pp.91-106
• /
• 1996

Control Variate (CV) is very useful technique for variance reduction in a wide class of queueing network simulations. However, the loss in variance reduction caused by the estimation of the optimum control coefficients is an increasing function of the number of control variables. Therefore, in some situations, it is required to select an optimal set of control variables to maximize the variance reduction . In this paper, we develop the Adaptive Control Variates (ACV) method which selects an optimal set of control variates during the simulation adatively. ACV is useful to maximize the simulation efficiency when we need iterated simulations to find an optimal solution. One such an example is the Simulated Annealing (SA) because, in SA algorithm, we have to repeat in calculating the objective function values at each temperature, The ACV can also be applied to the queueing network optimization problems to find an optimal input parameters (such as service rates) to maximize the throughput rate with a certain cost constraint.