• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1996.10a
• /
• pp.253-256
• /
• 1996

Rainfall is one of the major and complicated elements of hydrologic system. Accurate prediction of rainfall is very important to mitigate storm damage. The neural network is a good model to be applied for the classification problem, large combinatorial optimization and nonlinear mapping. In this dissertation, rainfall predictions by the neural network theory were presented. A multi-layer neural network was constructed. The network learned continuous-valued input and output data. The network was used to predict rainfall. The online, multivariate, short term rainfall prediction is possible by means of the developed model. A multidimensional rainfall generation model is applied to Seoul metropolitan area in order to generate the 10-minute rainfall. Application of neural network to the generated rainfall shows good prediction. Also application of neural network to 1-hour real data in Seoul metropolitan area shows slightly good predictions.

• IE interfaces
• /
• v.15 no.2
• /
• pp.189-198
• /
• 2002

Simulated Annealing(SA) approach has been successfully applied to the combinatorial optimization problems with NP-hard complexity. To apply an SA algorithm to specific problems, generic parameters as well as problem-specific parameters must be determined. To overcome the embedded nature of SA, long computational time, some studies suggested the parameter design methods of determining SA related parameters. In this study, we propose a new parameter design approach based on robust design method. To show the effectiveness of the proposed method, the extensive computation experiments are conducted on the mixed-model sequencing problems.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.9
• /
• pp.84-101
• /
• 1997

Inferring and recognizing 3D objects form a 2D occuluded image has been an important research area of computer vision. The octree model, a hierarchical volume description of 3D objects, may be utilized to generate projected images from arbitrary viewing directions, thereby providing an efficient means of the data base for 3D object recognition. We present a fast algorithm of finding the 4 pairs of feature points to estimate the viewing direction. The method is based on matching the object contour to the reference occuluded shapes of 49 viewing directions. The initially best matched viewing direction is calibrated by searching for the 4 pairs of feature points between the input image and the image projected along the estimated viewing direction. Then the input shape is recognized by matching to the projectd shape. The computational complexity of the proposed method is shown to be O(n$^{2}$) in the worst case, and that of the simple combinatorial method is O(m$^{4}$.n$^{4}$) where m and n denote the number of feature points of the 3D model object and the 2D object respectively.

• Journal of Information Processing Systems
• /
• v.16 no.5
• /
• pp.1169-1182
• /
• 2020

The ant colony optimization (ACO) algorithm is a classical metaheuristic optimization algorithm. However, the conventional ACO was liable to trap in the local minimum and has an inherent slow rate of convergence. In this work, we propose a novel combinatorial ACO algorithm (CG-ACO) to alleviate these limitations. The genetic algorithm and the cloud model were embedded into the ACO to find better initial solutions and the optimal parameters. In the experiment section, we compared CG-ACO with the state-of-the-art methods and discussed the parameter stability of CG-ACO. The experiment results showed that the CG-ACO achieved better performance than ACO_R, simple genetic algorithm (SGA), CQPSO and CAFSA and was more likely to reach the global optimal solution.

• Industrial Engineering and Management Systems
• /
• v.11 no.1
• /
• pp.18-25
• /
• 2012

IChinese postman problem is one of the classical combinatorial optimization problems with many applications. However, in application, some uncertain factors are frequently encountered. This paper employs uncertain programming to deal with Chinese postman problem with uncertain weight Within the framework of uncertainty theory, the concepts of expected shortest route, ${\alpha}$-shortest route, and distribution shortest route are proposed. After that, expected shortest model, and ${\alpha}$-shortest model are constructed. Taking advantage of properties of uncertainty theory, these models can be transf-ormed into their corresponding deterministic forms, which can be solved by classical algorithm..

• Macromolecular Research
• /
• v.17 no.11
• /
• pp.829-841
• /
• 2009

This study introduces a specified group-contribution method for predicting the phase equilibria in polymer solutions. The method is based on a modified double lattice model developed previously. The proposed model includes a combinatorial energy contribution that is responsible for the revised Flory-Huggins entropy of mixing, the van der Waals energy contribution from dispersion, a polar force and specific energy contribution. Using the group-interaction parameters obtained from data reduction, the solvent activities for a large variety of mixtures of polymers and solvents over a wide range of temperatures can be predicted with good accuracy. This method is simple but provides improved predictions compared to those of the other group contribution methods.

• Korean Journal of Computational Design and Engineering
• /
• v.11 no.5
• /
• pp.335-343
• /
• 2006

Design changes for an original surface model are frequently required in a manufacturing area: for example, when the physical parts are modified or when the parts are partially manufactured from analogous shapes. In this case, an efficient 3D model updating method by locally adding scan data for the modified area is highly desirable. For this purpose, this paper presents a new procedure to update an initial model that is composed of combinatorial triangular facets based on a set of locally added point data. The initial surface model is first created from the initial point set by Tight Cocone, which is a water-tight surface reconstructor; and then the point cloud data for the updates is locally added onto the initial model maintaining the same coordinate system. In order to update the initial model, the special region on the initial surface that needs to be updated is recognized through the detection of the overlapping area between the initial model and the boundary of the newly added point cloud. After that, the initial surface model is eventually updated to the final output by replacing the recognized region with the newly added point cloud. The proposed method has been implemented and tested with several examples. This algorithm will be practically useful to modify the surface model with physical part changes and free-form surface design.

• International conference on construction engineering and project management
• /
• 2013.01a
• /
• pp.243-251
• /
• 2013

Cash management is a major concern for all contractors in the construction industry. It is arguable that cash is the most critical resource of all. A contractor needs to secure sufficient funds to navigate the project to the end, while keeping an eye on maximizing profits along the way. Past research attempted to address such topic via developing models to tackle the time-cost tradeoff problem, cash flow forecasting, and cash flow management. Yet, little was done to integrate the three aspects of cash management together. This paper, as such, presents a comprehensive model that integrates the time-cost tradeoff problem, cash flow management, and cash flow forecasting. First, the model determines the project optimal completion time by considering the different alternative construction methods available for executing project activities. Second, it investigates different funding alternatives and proposes a project-level cash management plan. Two funding alternatives are considered; they are borrowing and company own financing. The model was built as a combinatorial optimization model that utilizes ant colony search capabilities. The model also utilizes Microsoft Project software and spreadsheets to maintain an environment that incorporates activities, their durations, and other project data, in order to estimate project completion time and cost. Ant Colony Optimization algorithm was coded as a Macro program using VBA. Finally, an example project was used to test the developed model, where it acted reliably in maximizing the contractor's profit in the test project.

• Journal of Korean Association for Spatial Structures
• /
• v.1 no.2 s.2
• /
• pp.59-66
• /
• 2001

This paper describes three modules for development of the Space Frame Integrated Design System(SFIDS). The Control Module is implemented to control the developed system. The Model Generation Module based on PATRAN user interface enables users to generate a complicated finite element model for space frame structures. The Optimum Design Module base on a branch of combinatorial optimization techniques which can realize the optimization of a structure having a large number of members designs optimum members of a space frame after evaluating analysis results. The Control Module and the Model Generation Module Is implemented by PATRAN Command Language(PCL) while C++ language is used in the Optimum Design Module. The core of the system is PATRAN database, in which the Model Generation Module creates information of a finite element model. Then, PATRAN creates Input files needed for the analysis program from the information of the finite element model in the database, and in turn, imports output results of analysis program to the database. Finally, the Optimum Design Module processes member grouping of a space frame based on the output results, and performs optimal member selection of a space frame. This process is repeated until the desired optimum structural members are obtained.

• Proceedings of the Korean Institute of Building Construction Conference
• /
• 2015.11a
• /
• pp.196-197
• /
• 2015

In tall building construction, time for transporting form affects formwork duration as plan size has become larger and quantity of inputted form has been increased. Thus, necessity of systematic dismantlement sequence of form has been increased to reduce the duration of formwork. Tabu search has been efficiently applied to solve problem of combinatorial optimization by using tabu list which can improve combination values. Therefore, this study proposes optimization model of dismantlement sequence of table form which has been preferred in tall building construction, to reduce the formwork duration by minimizing time for transporting form.