• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.844-847
• /
• 1997

In this paper, scheduling problem is dealt for the minimization of due date penalty for the customer order. Multiproduct batch processes have been dealt with for their suitability for high value added low volume products. Their scheduling problems take minimization of process operation for objective function, which is not enough to meet the customer satisfaction and the process efficiency simultaneously because of increasing requirement of fast adaptation for rapid changing market condition. So new target function has been suggested by other researches to meet two goals. Penalty function minimization is one of them. To present more precisely production scheduling, we develop new scheduling model with penalty function of earliness and tardiness We can find many real cases that penalty parameters are divergent by the difference between the completion time of operation and due date. That is to say, the penalty parameter values for the product change by the customer demand condition. If the order charges different value for due date, we can solve it with the due date period. The period means the time scope where penalty parameter value is 0. If we make use of the due date period, the optimal sequence of our model is not always same with that of fixed due date point. And if every product have due date period, due date of them are overlapped which needs optimization for the maximum profit and minimum penalty. Due date period extension can be enlarged to makespan minimization if every product has the same abundant due date period and same penalty parameter. We solve this new scheduling model by simulated annealing method. We also develop the program, which can calculate the optimal sequence and display the Gantt chart showing the unit progress and time allocation only with processing data.

• Journal of Korea Water Resources Association
• /
• v.38 no.12 s.161
• /
• pp.1061-1072
• /
• 2005

A hydrological grey model is developed to forecast short-term river runoff from the Naju watershed located at upstream of the Youngsan estuary dam in Korea. The runoff of the Naju watershed is measured in real time at the Naju streamflow gauge station, which is a key station for forecasting the upstream inflow and operating the gates of the estuary dam in flood period. The model's governing equation is formulated on the basis of the grey system theory. The model parameters are reparameterized in combination with the grey system parameters and estimated with the annealing-simplex method In conjunction with an objective function, HMLE. To forecast accurately runoff, the fifth order differential equation was adopted as the governing equation of the model in consideration of the statistic values between the observed and forecast runoff. In calibration, RMSE values between the observed and simulated runoff of two and six Hours ahead using the model range from 3.1 to 290.5 $m^{3}/s,\;R^2$ values range from 0.909 to 0.999. In verification, RMSE values range from 26.4 to 147.4 $m^{3}/s,\;R^2$ values range from 0.940 to 0.998, compared to the observed data. In forecasting runoff in real time, the relative error values with lead-time and river stage range from -23.4 to $14.3\%$ and increase as the lead time increases. The results in this study demonstrate that the proposed model can reasonably and efficiently forecast runoff for one to six Hours ahead.

• Journal of the Society of Naval Architects of Korea
• /
• v.54 no.3
• /
• pp.187-195
• /
• 2017

The operation planning of transports used to move blocks is the one of key factors. Furthermore, reducing the running time through the effective plan contributes to pulling forward the whole logistic process of the shipyard and substantially saving the fuel consumption of itself as well. The past researches of the transporter focused on finding only the shortest distances, so called, Manhattan distance. However, these searching approaches cannot help having the significant difference in the real operational time and distance with the minimum cost approach which considers the speed retardation for turns or safety at the intersection. This study suggests the noble transporter's operational model which could take account of the consuming operational time around the crossroads on the shipyard. Concretely, the proposed method guarantees the minimization of transporters' turns and passage number which are huge burdensome to the operation time and the whole planning of transports with the given period. Resultantly, this paper is willing to explain the appropriateness of our approach, compared with the previous ones.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.13 no.10
• /
• pp.743-750
• /
• 2003

The equivalent source method(ESM) is used for the calculation of the internal pressure field for an enclosure which can have arbitrary boundary conditions and nay include internal objects which scatter the sound field. The advantage of using ESM is that it requires relatively low computing cost and is easy to model the internal diffracting objects. Typical ESM modeling uses two groups of equivalent source positions. One group includes the first order images of the source inside the enclosure. The Positions of the other group are usually on a spherical surface some distance outside the enclosure. The normal velocity on the surfaces of the enclosure walls is evaluated at a larger number of positions than there are equivalent sources. The sum of the squared difference between this velocity and the expected is minimized by adjusting the strength of the equivalent sources. This study is on the optimal far field sources positions when using the equivalent source method. In general, the far field sources are evenly distributed on a surface of a virtual sphere which is centered at the enclosure with a sufficiently large radius. In this study. optimal far field source locations are searched using simulated annealing method for various radii of spheres where far field sources are located. Simulation results showed that optimally located sources with adequate distance away from the enclosure center gave better result than sources with even distribution even with a smaller number of far field sources.

• Speech Sciences
• /
• v.10 no.4
• /
• pp.7-21
• /
• 2003

Sums-of-Products models were built for segment duration prediction of spoken Korean. An experiment for the modelling was carried out to apply the results to Korean text-to-speech synthesis systems. 670 read sentences were analyzed. trained and tested for the construction of the duration models. Traditional sequential rule systems were extended to simple additive, multiplicative and additive-multiplicative models based on Sums-of-Products modelling. The parameters used in the modelling include the properties of the target segment and its neighbors and the target segment's position in the prosodic structure. Two optimisation strategies were used: the downhill simplex method and the simulated annealing method. The performance of the models was measured by the correlation coefficient and the root mean squared prediction error (RMSE) between actual and predicted duration in the test data. The best performance was obtained when the data was trained and tested by ' additive-multiplicative models. ' The correlation for the vowel duration prediction was 0.69 and the RMSE. 31.80 ms. while the correlation for the consonant duration prediction was 0.54 and the RMSE. 29.02 ms. The results were not good enough to be applied to the real-time text-to-speech systems. Further investigation of feature interactions is required for the better performance of the Sums-of-Products models.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.27 no.5
• /
• pp.798-806
• /
• 2003

Structural optimization has been carried out in continuous or discrete design space. Methods for continuous design have been well developed though they are finding the local optima. On the contrary, the existing methods for discrete design are extremely expensive in computational cost or not robust. In this research, an algorithm using tabu search is developed fur the discrete structural designs. The tabu list and the neighbor function of the Tabu concepts are introduced to the algorithm. It defines the number of steps, the maximum number for random searches and the stop criteria. A tabu search is known as the heuristic approach while genetic algorithm and simulated annealing algorithm are attributed to the stochastic approach. It is shown that an algorithm using the tabu search with random moves has an advantage of discrete design. Furthermore, the suggested method finds the reliable optimum for the discrete design problems. The existing tabu search methods are reviewed. Subsequently, the suggested method is explained. The mathematical problems and structural design problems are investigated to show the validity of the proposed method. The results of the structural designs are compared with those from a genetic algorithm and an orthogonal array design.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.6
• /
• pp.2166-2176
• /
• 2017

Electricity price prediction plays a crucial part in making the schedule and managing the risk to the competitive electricity market participants. However, it is a difficult and challenging task owing to the characteristics of the nonlinearity, non-stationarity and uncertainty of the price series. This study proposes a hybrid improved strategy which incorporates data preprocessor components and a forecasting engine component to enhance the forecasting accuracy of the electricity price. In the developed forecasting procedure, the Seasonal Adjustment (SA) method and the Ensemble Empirical Mode Decomposition (EEMD) technique are synthesized as the data preprocessing component; the Coupled Simulated Annealing (CSA) optimization method and the Least Square Support Vector Regression (LSSVR) algorithm construct the prediction engine. The proposed hybrid approach is verified with electricity price data sampled from the power market of New South Wales in Australia. The simulation outcome manifests that the proposed hybrid approach obtains the observable improvement in the forecasting accuracy compared with other approaches, which suggests that the proposed combinational approach occupies preferable predication ability and enough precision.

• Journal of the Korean Society for Precision Engineering
• /
• v.19 no.10
• /
• pp.120-129
• /
• 2002

An integrated structure and controller design approach for rotating cantilever beam is presented. An optimization method is developed for improving positioning performance considering the elastic deformations during high speed rotation and adopting the beam shape and the control gains as design variables. For this end, a dynamic model is setup by the finite element method according to the shape of the beam. The mass and stiffness of the beam are distributed in such a way that the closed-loop poles of the control system should be located leftmost in the complex s-plane. For optimization method, the simulated annealing method is employed which has higher probability to find the global minimum than the gradient-based down-hill methods. Sequential design and simultaneous design methods are proposed to obtain the optimal shape and controller. Simulations are performed with new designs by the two methods to verify the effectiveness of the approach and the results show that the settling time is improved for point-to-point position controls.

• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.2
• /
• pp.241-249
• /
• 1998

In this paper, we seek to find an optimal allocation of link capacity in a data communication network. The architecture of the data communication network considered in the study is an online-service network based on public switched telephone network(PSTN) and packet switched data network(PSDN). In designing the architecture of the network, we need to deal with various measures of quality of service(QoS). Two important service measures are the call blocking probability in PSTN and the data transfer delay time in PSDN. Considering the tradeoff between the call blocking probability and the data transfer delay time in the network, we have developed the optimal link capacity allocation model that minimizes the total link cost, while guarantees the call blocking probability and the data transfer delay time within an acceptable level of QoS. This problem can be formulated as a non-linear integer programming model. We have solved the problem with tabu search and simulated annealing methods. In addition, we have analyzed the sensitivity of the model and provided the insight of the model along with computational results.

• Industrial Engineering and Management Systems
• /
• v.11 no.3
• /
• pp.288-298
• /
• 2012

Lot sizing and shipment scheduling are two interrelated decisions made by a manufacturing plant and a third-party logistics distribution center. This paper analyzes a dynamic inbound ordering problem and shipment problem with a freight container cost, in which the order size of multiple products and single container type are simultaneously considered. In the problem, each ordered product placed in a period is immediately shipped by some freight containers in the period, and the total freight cost is proportional to the number of containers employed. It is assumed that the load size of each product is equal and backlogging is not allowed. The objective of this study is to simultaneously determine the lot-sizes and the shipment schedule that minimize the total costs, which consist of production cost, inventory holding cost, and freight cost. Because the problem is NP-hard, we propose three meta-heuristic algorithms: a simulated annealing algorithm, a genetic algorithm, and a new population-based evolutionary meta-heuristic called self-evolution algorithm. The performance of the meta-heuristic algorithms is compared with a local search heuristic proposed by the previous paper in terms of the average deviation from the optimal solution in small size problems and the average deviation from the best one among the replications of the meta-heuristic algorithms in large size problems.