• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.10a
• /
• pp.57-78
• /
• 2005

The vehicle routing problem (VRP) is to determine a set of feasible vehicle routes, one for each vehicle, such that each customer is visited exactly once and the total distance travelled by the vehicles is minimized. A feasible route is defined as a simple circuit including the depot such that the total demand of the customers in the route does not exceed the vehicle capacity. While there have been significant advances recently in exact solution methodology, the VRP is not a well solved problem. We find most approaches still relying on the branch and bound method. These approaches employ various methodologies to compute a lower bound on the optimal value. We introduce a new modelling approach, termed route-splitting, for the VRP that allows us to address problems whose size is beyond the current computational range of set-partitioning models. The route-splitting model splits each vehicle route into segments, and results in more tractable subproblems. Lifting much of the burden of solving combinatorially hard subproblems, the route-splitting approach puts more weight on the LP master problem, Recent breakthroughs in solving LP problems (Nemhauser, 1994) bode well for our approach. Lower bounds are computed on five symmetric VRPs with up to 199 customers, and eight asymmetric VRPs with up to 70 customers. while it is said that the exact methods developed for asymmetric instances have in general a poor performance when applied to symmetric ones (Toth and Vigo, 2002), the route splitting approach shows a competent performance of 93.5% on average in the symmetric VRPs. For the asymmetric ones, the approach comes up with lower bounds of 97.6% on average. The route-splitting model can deal with asymmetric cost matrices and non-identical vehicles. Given the ability of the route-splitting model to address a wider range of applications and its good performance on asymmetric instances, we find the model promising and valuable for further research.

• The Journal of the Acoustical Society of Korea
• /
• v.21 no.4
• /
• pp.339-438
• /
• 2002

This paper presents a method to simulate noise propagation by a computer for outdoor environment. Sound propagated in 3 dimensional space generates reflected waves whenever it hits boundary surfaces. If a receiver is away from a sound source, it receives multiple sound waves which are reflected from various boundary surfaces in space. The algorithm being developed in this paper is based on a ray sound theory. If we get 3 dimensional geometry input as well as sound sources, we can compute sound effects all over the boundary surfaces. In this paper, we present two approaches to compute sound: the first approach, called forward tracing, traces sounds forwards from sound sources. while the second approach, called geometry based computation, computes possible propagation routes between sources and receivers. We compare two approaches and suggest the geometry based sound computation for outdoor simulation. Also this approach is very efficient in the sense we can save computational time compared to the forward sound tracing. Sound due to impulse-response is governed by physical environments. When a sound source waveform and numerically computed impulse in time is convoluted, the result generates a synthetic sound. This technique can be easily generalized to synthesize realistic stereo sounds for virtual reality, while the simulation result is visualized using VRML.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.30 no.3A
• /
• pp.193-200
• /
• 2010

Structural design requires simultaneously to ensure safety by considering quantitatively uncertainties in the applied loadings, material properties and fabrication error and to maximize economical efficiency. As a solution, system reliability-based design optimization (SRBDO), which takes into consideration both uncertainties and economical efficiency, has been extensively researched and numerous attempts have been done to apply it to structural design. Contrary to conventional deterministic optimization, SRBDO involves the evaluation of component and system probabilistic constraints. However, because of the complicated algorithm for calculating component reliability indices and system reliability, excessive computational time is required when the large-scale finite element analysis is involved in evaluating the probabilistic constraints. Accordingly, an algorithm for SRBDO exhibiting improved stability and efficiency needs to be developed for the large-scale problems. In this study, a more stable and efficient SRBDO based on the performance measure approach (PMA) is developed. PMA shows good performance when it is applied to reliability-based design optimization (RBDO) which has only component probabilistic constraints. However, PMA could not be applied to SRBDO because PMA only calculates the probabilistic performance measure for limit state functions and does not evaluate the reliability indices. In order to overcome these difficulties, the decoupled algorithm is proposed where RBDO based on PMA is sequentially performed with updated target component reliability indices until the calculated system reliability index approaches the target system reliability index. Through a mathematical problem and ten-bar truss problem, the proposed method shows better convergence and efficiency than other approaches.

• Journal of Korean Society of Transportation
• /
• v.28 no.3
• /
• pp.61-74
• /
• 2010

ITS (Intelligent transportation systems) collects real-time traffic data, and accumulates vest historical data. But tremendous historical data has not been managed and employed efficiently. With the introduction of data management systems like ADMS (Archived Data Management System), the potentiality of huge historical data dramatically surfs up. However, traffic data in any data management system includes missing values in nature, and one of major obstacles in applying these data has been the missing data because it makes an entire dataset useless every so often. For these reasons, imputation techniques take a key role in data management systems. To address these limitations, this paper presents a promising imputation technique which could be mounted in data management systems and robustly generates the estimations for missing values included in historical data. The developed model, based on NPR (Non-Parametric Regression) approach, employs various traffic data patterns in historical data and is designated for practical requirements such as the minimization of parameters, computational speed, the imputation of various types of missing data, and multiple imputation. The model was tested under the conditions of various missing data types. The results showed that the model outperforms reported existing approaches in the side of prediction accuracy, and meets the computational speed required to be mounted in traffic data management systems.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.18 no.2
• /
• pp.201-211
• /
• 2005

Due to the complex mechanism and various parameters that affect shear behavior of reinforced concrete (RC) members, models on shear tend to be complex and difficult to utilize for design of structural members, and empirical relationships formulated with limited test data often work lot members having a specific range of influencing parameters on shear. As an alternative approach tot solving this problem, artificial neural networks have been suggested by some researchers. In this paper, artificial neural networks were used to predict shear strengths of RC beams without shear reinforcement. Especially, a large database that consists of shear test results of 398 RC members without shear reinforcement was used for artificial neural network analysis. Three well known approaches for shear strength of RC members, ACI 318-02 shear provision, Zsutiy's equation, and Okamura's relationship, are also evaluated with test results in the shear database and compared with neural network approach. While ACI 318-02 provided inaccurate predictions for RC members without shear reinforcement, the empirical equations by Zsutty and Okamura provided more improved prediction of Shear strength than ACI 318-02. The artificial neural networks, however provided the best prediction of shear strengths of RC beams without shear reinforcement that was closest to test results.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.1
• /
• pp.90-100
• /
• 2011

We present a parallel bi-conjugate gradient (Bi-CG) matrix solver for large scale Bio-FET simulations based on recent graphics processing units (GPUs) which can realize a large-scale parallel processing with very low cost. The proposed method is focused on solving the Poisson equation in a parallel way, which requires massive computational resources in not only semiconductor simulation, but also other various fields including computational fluid dynamics and heat transfer simulations. As a result, our solver is around 30 times faster than those with traditional methods based on single core CPU systems in solving the Possion equation in a 3D FDM (Finite Difference Method) scheme. The proposed method is implemented and tested based on NVIDIA's CUDA (Compute Unified Device Architecture) environment which enables general purpose parallel processing in GPUs. Unlike other similar GPU-based approaches which apply usually 32-bit single-precision floating point arithmetics, we use 64-bit double-precision operations for better convergence. Applications on the CUDA platform are rather easy to implement but very hard to get optimized performances. In this regard, we also discuss the optimization strategy of the proposed method.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.27 no.6
• /
• pp.605-613
• /
• 2014

Epistemic uncertainty, the lack of knowledge, is often more important than aleatory uncertainty, variability, in estimating reliability of a system. While the probability theory is widely used for modeling aleatory uncertainty, there is no dominant approach to model epistemic uncertainty. Different approaches have been developed to handle epistemic uncertainties using various theories, such as probability theory, fuzzy sets, evidence theory and possibility theory. However, since these methods are developed from different statistics theories, it is difficult to interpret the result from one method to the other. The goal of this paper is to compare different methods in handling epistemic uncertainty in the view point of calculating the probability of failure. In particular, four different methods are compared; the probability method, the combined distribution method, interval analysis method, and the evidence theory. Characteristics of individual methods are compared in the view point of reliability analysis.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.29 no.6
• /
• pp.499-512
• /
• 2016

The boundary reaction method(BRM) is a substructure time domain method, it removes global iterations between frequency and time domain analyses commonly required in the hybrid approaches, so that it operates as a two-step uncoupled method. The BRM offers a two-step method as follows: (1) the calculation of boundary reaction forces in the frequency domain on an interface of linear and nonlinear regions, (2) solving the wave radiation problem subjected to the boundary reaction forces in the time domain. In the time domain analysis, the near-field soil is modeled to simulate the wave radiation problem. This paper evaluates the performance of the BRM according to modeling extent of near-field soil for the nonlinear SSI analysis of base-isolated NPP structure. For this purpose, parametric studies are performed using equivalent linear SSI problems. The accuracy of the BRM solution is evaluated by comparing the BRM solution with that of conventional SSI seismic technique. The numerical results show that the soil condition affects the modeling range of near-field soil for the BRM analysis as well as the size of the basemat. Finally, the BRM is applied for the nonlinear SSI analysis of a base-isolated NPP structure to demonstrate the accuracy and effectiveness of the method.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.27 no.1
• /
• pp.9-16
• /
• 2014

Using a level set method and topological derivatives, a topological shape optimization method that is independent of an initial design is developed for linearly elastic structures. In the level set method, the initial domain is kept fixed and its boundary is represented by an implicit moving boundary embedded in the level set function, which facilitates to handle complicated topological shape changes. The "Hamilton-Jacobi(H-J)" equation and computationally robust numerical technique of "up-wind scheme" lead the initial implicit boundary to an optimal one according to the normal velocity field while minimizing the objective function of compliance and satisfying the constraint of allowable volume. Based on the asymptotic regularization concept, the topological derivative is considered as the limit of shape derivative as the radius of hole approaches to zero. The required velocity field to update the H-J equation is determined from the descent direction of Lagrangian derived from optimality conditions. It turns out that the initial holes are not required to get the optimal result since the developed method can create holes whenever and wherever necessary using indicators obtained from the topological derivatives. It is demonstrated that the proper choice of control parameters for nucleation is crucial for efficient optimization process.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.4
• /
• pp.503-508
• /
• 2010

Recently, the advance of mobile devices has made various services possible beyond simple communication. One of services is the predicting the future path of users and providing the most suitable location based service based on the prediction results. Almost of these prediction methods are based on previous path data. Thus, calculating similarities between current location information and the previous trajectories for path prediction is an important operation. The collected trajectory data have a huge amount of location information generally. These information needs the high computational cost for calculating similarities. For reducing computational cost, the meaningful location based trajectory model approaches are proposed. However, most of the previous researches are considering only the physical information such as stay time and the distance for extracting the meaningful locations. Thus, they will probably ignore the characteristics of users for meaningful location extraction. In this paper, we suggest a meaningful location extracting and trajectory simplification approach considering the stay time, distance, and additionally interaction information of user. The method collects the location information using GPS device and interaction information between the user and the others. Using these data, the proposed method defines the proximity of the people who are related with the user. The system extracts the meaningful locations based on the calculated proximities, stay time and distance. Using the selected meaningful locations the trajectories are simplified. For verifying the usability of the proposed method, we collect the behavioral data of smart phone users. Using these data, we measure the suitability of meaningful location extraction method, and the accuracy of prediction approach based on simplified trajectories. Following these result, we confirmed the usability of proposed method.