• Journal of Korean Institute of Industrial Engineers
• /
• v.30 no.2
• /
• pp.130-145
• /
• 2004

This paper addresses the integrated problem of process planning and scheduling in FMS (Flexible Manufacturing System). The integration of process planning and scheduling is important for an efficient utilization of manufacturing resources. In this paper, a new method using an artificial intelligent search technique, called asymmetric multileveled symbiotic evolutionary algorithm, is presented to handle the two functions at the same time. Efficient genetic representations and operator schemes are considered. While designing the schemes, we take into account the features specific to each of process planning and scheduling problems. The performance of the proposed algorithm is compared with those of a traditional hierarchical approach and existing evolutionary algorithms. The experimental results show that the proposed algorithm outperforms the compared algorithms.

• Proceedings of the KSME Conference
• /
• 2003.11a
• /
• pp.1286-1290
• /
• 2003

This paper presents a newly implemented parallel finite element procedure for contact-impact problems. Three sub-algorithms are includes in the proposed parallel contact-impact procedure, such as a parallel Belytschko-Lin-Tsay (BLT) shell element generation, a parallel explicit time integration scheme, and a parallel contact search algorithm based on the master slave slide-line algorithm. The underlying focus of the algorithms is on its effectiveness and efficiency for inclusion in future finite element systems on parallel computers. Throughout this research, a prototype code, named GT-PARADYN, is developed on the IBM SP2, a distributed-memory computer. Some numerical examples are provided to demonstrate the timing results of the procedure, discussing the accuracy and efficiency of the code.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.2
• /
• pp.27-35
• /
• 2009

Integer programming is a very effective technique for searching optimal solution of combinatorial optimization problems. However, its applicability is limited to linear models. In this paper, I propose an effective method for solving a nonlinear optimization problem by integrating the powerful search performance of integer programming and the flexibility of neighborhood search algorithms. In the first phase, integer programming is executed with subproblem which can be represented as a linear form from the given problem. In the second phase, a neighborhood search algorithm is executed with the whole problem by taking the result of the first phase as the initial solution. Through the experimental results using a nonlinear maximal covering problem, I confirmed that such a simple integration method can produce far better solutions than a neighborhood search algorithm alone. It is estimated that the success is primarily due to the powerful performance of integer programming.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.7
• /
• pp.3393-3412
• /
• 2017

As a main challenge in network virtualization, virtual network embedding problem is increasingly important and heuristic algorithms are of great interest. Aiming at the problems of poor correlation in node embedding and link embedding, long distance between adjacent virtual nodes and imbalance resource consumption of network components during embedding, we herein propose a two-stage virtual network embedding algorithm NA-PVNM. In node embedding stage, resource requirement and breadth first search algorithm are introduced to sort virtual nodes, and a node fitness function is developed to find the best substrate node. In link embedding stage, a path fitness function is developed to find the best path in which available bandwidth, CPU and path length are considered. Simulation results showed that the proposed algorithm could shorten link embedding distance, increase the acceptance ratio and revenue to cost ratio compared to previously reported algorithms. We also analyzed the impact of position constraint and substrate network attribute on algorithm performance, as well as the utilization of the substrate network resources during embedding via simulation. The results showed that, under the constraint of substrate resource distribution and virtual network requests, the critical factor of improving success ratio is to reduce resource consumption during embedding.

• Journal of Korean Society of Transportation
• /
• v.14 no.1
• /
• pp.51-67
• /
• 1996

The optimal path-finding problem becomes complicated when multiple variables are simultaneously considered such as physical route length, degree of congestion, traffic capacity of intersections, number of intersections and lanes, and existence of free ways. Therefore, many researchers in various fields (management science, computer science, applied mathematics, production planning, satellite launching) attempted to solve the problem by ignoring many variables for problem simplification, by developing intelligent algorithms, or by developing high-speed hardware. In this research, an integration of expert system technique and case-based reasoning in high level with a conventional algorithms in lower level was attempted to develop an optimal path-finding system. Early application of experienced driver's knowledge and case data accumulated in case base drastically reduces number of possible combinations of optimal paths by generating promising alternatives and by eliminating non-profitable alternatives. Then, employment of a conventional optimization algorithm provides faster search mechanisms than other methods such as bidirectional algorithm and $A^*$ algorithm. The conclusion obtained from repeated laboratory experiments with real traffic data in Seoul metropolitan area shows that the integrated approach to finding optimal paths with consideration of various real world constraints provides reasonable solution in a faster way than others.

• The KIPS Transactions:PartD
• /
• v.14D no.2
• /
• pp.265-272
• /
• 2007

In this paper, we implement an automated composition system of web services using hybrid techniques that merge the benefit of BPEL techniques, with the advantage of OWL-S, BPEL techniques have practical capabilities that fulfil the needs of the business environment such as fault handling and transaction management. However, the main shortcoming of these techniques is the static composition approach, where the service selection and flow management are done a priori and manually. In contrast, OWL-S techniques use ontologies to provide a mechanism to describe the web services functionality in machine-understandable form, making it possible to discover, and integrate web services automatically. This allows for the dynamic integration of compatible web services, possibly discovered at run time, into the composition schema. However, the development of these approaches is still in its infancy and has been largely detached from the BPEL composition effort. In this work, we describe the design of the SemanticBPEL architecture that is a hybrid system of BPEL4WS and OWL-S, and propose algorithms for web service search and integration. In particular, the SemanticBPEL has been implemented based on the open source tools. The proposed system is compared with existing BPEL systems by functional analysis. These comparisions show that our system outperforms existing systems.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2004.02a
• /
• pp.82-94
• /
• 2004

This paper addresses solutions to the challenges of carrier phase integer ambiguity resolution and cycle slip detection/identification, for maintaining high accuracy of an integrated GPS/Pseudolite/INS system. Such a hybrid positioning and navigation system is an augmentation of standard GPS/INS systems in localized areas. To achieve the goal of high accuracy, the carrier phase measurements with correctly estimated integer ambiguities must be utilized to update the system integration filter's states. The occurrence of a cycle slip that is undetected is, however, can significantly degrade the filter's performance. This contribution presents an effective approach to increase the reliability and speed of integer ambiguity resolution through using pseudolite and INS measurements, with special emphasis on reducing the ambiguity search space. In addition, an algorithm which can effectively detect and correct the cycle slips is described as well. The algorithm utilizes additional position information provided by the INS, and applies a statistical technique known as the cumulative-sum (CUSUM) test that is very sensitive to abrupt changes of mean values. Results of simulation studies and field tests indicate that the algorithms are performed pretty well, so that the accuracy and performance of the integrated system can be maintained, even if cycle slips exist in the raw GPS measurements.

• Korean Journal of Geomatics
• /
• v.3 no.2
• /
• pp.129-140
• /
• 2004

This paper addresses solutions th the challenges of carrier phase integer ambiguity resolution and cycle slip detection/identification, for maintaining high accuracy of an integrated GPS/Pseudolite/INS system. Such a hybrid positioning and navigation system is an augmentation of standard GPS/INS systems in localized areas. To achieve the goal of high accuracy, the carrier phase measurements with correctly estimated integer ambiguities must be utilized to update the system integration filter's states. The contribution presents an effective approach to increase the reliability and speed of integer ambiguity resolution through using pseudolite and INS measurements, with special emphasis on reducing the ambiguity search space. In addition, an algorithm which can effectively detect and correct the cycle slips is described as well. The algorithm utilizes additional position information provided by the INS, and applies a statistical technique known as th cumulative-sun (CUSUM) test that is very sensitive to abrupt changes of mean values. Results of simulation studies and field tests indicate that the algorithms are performed pretty well, so that the accuracy and performance of the integrated system can be maintained, even if cycle slips exist in the raw GPS measurements.

• Korean Journal of Remote Sensing
• /
• v.35 no.1
• /
• pp.93-115
• /
• 2019

The availability of high-resolution laser scanning data and advanced machine learning algorithms has enabled an accurate potential rockfall source identification. However, the presence of other mass movements, such as landslides within the same region of interest, poses additional challenges to this task. Thus, this research presents a method based on an integration of Gaussian mixture model (GMM) and ensemble artificial neural network (bagging ANN [BANN]) for automatic detection of potential rockfall sources at Kinta Valley area, Malaysia. The GMM was utilised to determine slope angle thresholds of various geomorphological units. Different algorithms(ANN, support vector machine [SVM] and k nearest neighbour [kNN]) were individually tested with various ensemble models (bagging, voting and boosting). Grid search method was adopted to optimise the hyperparameters of the investigated base models. The proposed model achieves excellent results with success and prediction accuracies at 95% and 94%, respectively. In addition, this technique has achieved excellent accuracies (ROC = 95%) over other methods used. Moreover, the proposed model has achieved the optimal prediction accuracies (92%) on the basis of testing data, thereby indicating that the model can be generalised and replicated in different regions, and the proposed method can be applied to various landslide studies.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2015.05a
• /
• pp.218-218
• /
• 2015

Urbanization and waterworks construction in natural watershed have been causing higher flood risks in lowland areas. Detention basins have become one of the most efficient fundamental instruments for storm water and environmental management at watershed scale. Nowadays, there are many studies coupled numerical methods of flood routing with optimization algorithms to investigate factors that impact on the efficiency of detention basins in flood reduction in a watershed, such as detention basin location, size, and cost and watershed characteristics. Although these couplings have been become more widespread but cumbersome computation and hydraulic data requirement still are their limitations. To tackle the procedure efforts due to numerical integration and data collection, simple approach is proposed to primarily estimate effects of detention basins. The approach basis is the linear system theory applied to the solution of hydrologic flood routing. The paper introduces an analytical method for estimating detention effects deriving by recent studies and innovatively analyses this equation on fractal perspective. Then, an optimization technique is performed by applying harmony search algorithms (HSA) to optimize efficiency of detention basins at watershed scale. The location and size of upstream detention basin are simultaneously obtained. Finally, the proposed methodology, practically applied for a real watershed in Kan river, Iran.