• IE interfaces
• /
• v.22 no.4
• /
• pp.359-367
• /
• 2009

The vehicle travel time between the demand points in downtown area is greatly influenced by complex road condition and traffic situation that change real time to various external environments. Most of research in the vehicle routing problems compose vehicle routes only considering travel distance and average vehicle speed between the demand points, however did not consider dynamic external environments such as traffic situation by service time zones. A realistic vehicle routing problem which considers traffic situation of smooth, delaying, and stagnating by three service time zones such as going to work, afternoon, and going home was suggested in this study. A mathematical programming model was suggested and it gives an optimal solution when using ILOG CPLEX. A hybrid genetic algorithm was also suggested to chooses a vehicle route considering traffic situation to minimize the total travel time. By comparing the result considering the traffic situation, the suggested algorithm gives better solution than existing algorithms.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.22 no.53
• /
• pp.13-22
• /
• 1999

This paper presents a model and dynamic programming based algorithm for the Traveling Salesperson Problem with Time Windows (TSPTW). The main difference of our model compared with the previous ones lies in that the time windows we are concerned are far more flexible and realistic. In the typical TSPTW, the service at a node must begin within the time grid called the time window that is defined by the earliest and the latest time to start the service at the node. But, in real business practices, a lateness cost is usually penalized rather than the service is prohibited at all when a vehicle arrives after the latest time. Considering this situation, we propose a model with a new time window that allows an arrival after the latest time and penalizes the late arrival by charging a lateness cost. An algorithm introduced for the model is extensively tested to verify the accuracy and efficiency.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.22 no.6
• /
• pp.815-823
• /
• 2019

A naval surface-to-air missile is an effective countermeasure against increasing threats of anti-ship missiles. Optimal operation is imperative for high survivability due to limited defense resources of a warship. This paper addresses a problem of optimal engagement to maximize the overall probability of intercept under Shoot-Look-Shoot tactics. The problem is formulated and analyzed with consideration of a realistic single-shoot probability model. The analysis shows that a global solution is achieved for some engagement scenarios. A numerical algorithm to optimize the overall probability of intercept is suggested. An illustrative example is provided to verify our results.

• Structural Engineering and Mechanics
• /
• v.11 no.1
• /
• pp.1-16
• /
• 2001

This paper discusses the elastic stability of unbraced frames under non-proportional loading based on the concept of storey-based buckling. Unlike the case of proportional loading, in which the load pattern is predefined, load patterns for non-proportional loading are unknown, and there may be various load patterns that will correspond to different critical buckling loads of the frame. The problem of determining elastic critical loads of unbraced frames under non-proportional loading is expressed as the minimization and maximization problem with subject to stability constraints and is solved by a linear programming method. The minimum and maximum loads represent the lower and upper bounds of critical loads for unbraced frames and provide realistic estimation of stability capacities of the frame under extreme load cases. The proposed approach of evaluating the stability of unbraced frames under non-proportional loading has taken into account the variability of magnitudes and patterns of loads, therefore, it is recommended for the design practice.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.9
• /
• pp.59-67
• /
• 2019

The service composition based on Service-Oriented Architecture(SOA) can make us view various machines or its functionalities in the Web or Internet-of-Things environment as 'service', and efficiently create new value-added services that users want by compositing different services if there is no service to satisfy the client. The service composition problem with respect to behavioral descriptions deals with the automatic synthesis of a coordinator service that controls a set of services to reach a goal state. Despite its importance, however, solving the service composition problem with only partial observations remains to be doubly exponential in the number of variables in service descriptions, rendering any attempts to compute an exact solution for modest size impractical. Toward this challenge, in this paper, we propose novel approximation-based approaches using abstraction methods. We empirically validate that our proposals can solve realistic problems efficiently.

• Coupled systems mechanics
• /
• v.8 no.3
• /
• pp.259-271
• /
• 2019

This paper presents forced vibration analysis of sandwich deep beams made of functionally graded material (FGM) in face layers and a porous material in core layer. The FGM sandwich deep beam is subjected to a harmonic dynamic load. The FGM in the face layer is graded though the layer thickness. In order to get more realistic result for the deep beam problem, the plane solid continua is used in the modeling of The FGM sandwich deep beam. The equations of the problem are derived based the Hamilton procedure and solved by using the finite element method. The novelty in this paper is to investigate the dynamic responses of sandwich deep beams made of FGM and porous material by using the plane solid continua. In the numerical results, the effects of different material distributions, porosity coefficient, geometric and dynamic parameters on the dynamic responses of the FGM sandwich deep beam are investigated and discussed.

• Magazine of the Korea Concrete Institute
• /
• v.11 no.2
• /
• pp.241-249
• /
• 1999

To estimate the compressive strength of concrete more realistically, relative large number of data are necessary. However, it is very common in practice that only limited data are available. The purpose of the present paper is therefore to propose a realistic method to estimate the compressive strength of concrete with limited data in actual site. The Bayesian method of statistical analysis has been applied to the problem of the estimation of compressive strength of concrete. The mean compressive strength is considered as the random parameter and a prior distribution is selected to enable updating of the Bayesian distribution of compressive strength of concrete reflecting both existing data and sampling observations. The updating of the Bayesian distribution with increasing data is illustrated in numerical application. It is shown that by combining prior estimation with information from site observation, more precise estimation is possible with relatively small sampling. It is also seen that the contribution of the prior in determining the posterior distribution depends on its sharpness or flatness in relation to the sharpness or flatness of the likelihood function. The present paper allows more realistic determination of concrete strength in site with limited data.

• Korean Management Science Review
• /
• v.32 no.4
• /
• pp.109-133
• /
• 2015

This paper considers the allocation and engagement scheduling of air defense missiles by using MIP (mixed integer programming). Specifically, it focuses on developing a realistic MIP model for a real battle situation where multiple enemy missiles are headed toward valuable defended assets and there exist multiple air defense missiles to counteract the threats. In addition to the conventional objective such as the minimization of surviving target value, the maximization of total intercept altitude is introduced as a new objective. The intercept altitude of incoming missiles is important in order to minimize damages from debris of the intercepted missiles and moreover it can be critical if the enemy warhead contains an atomic or chemical bomb. The concept of so called the time window is used to model the engagement situation and a continuous time is assumed for flying times of the both missiles. Lastly, the model is extended to simulate the situation where the guidance radar, which guides a defense missile to its target, has the maximum guidance capacity. The initial mathematical model developed contains several non-linear constraints and a non-linear objective function. Hence, the linearization of those terms is performed before it is solved by a commercially available software. Then to thoroughly examine the MIP model, the model is empirically evaluated with several test problems. Specifically, the models with different objective functions are compared and several battle scenarios are generated to evaluate performance of the models including the extended one. The results indicate that the new model consistently presents better and more realistic results than the compared models.

• Journal of KIISE:Information Networking
• /
• v.33 no.2
• /
• pp.183-192
• /
• 2006

This paper analyzes the price-selection problem under priority-based scheduling for QoS (Quality of Service) network services, i.e., how to determine the price associated with each service level. In particular, we focus on the problems with the pricing mechanism based on equilibrium analysis. We claim that the assumptions needed to produce equilibrium nay not hold in some important environments. Specifically, (a) the individual user's impact on the system is not infinitesimal and (b) users do not always have up-to-date global system-status knowledge crucial for optimal user decisions required for equilibrium. These may make the equilibrium models inaccurate in realistic environments. We examine the accuracy of some existing equilibrium methods by using a dynamic model that we have developed for system behavior analysis. The analysis indicates that equilibrium methods fail to model accurately the system behavior in some realistic environments.

• Journal of the Korea Computer Graphics Society
• /
• v.3 no.2
• /
• pp.1-13
• /
• 1997

Two factors are required for a virtual reality system; realism and immersion. Since realism is determined primarily by the realistic image, objects in a virtual environment should be represented with details by their own characteristics. Also, reflection on light must be considered. On the other hand, immersion is defined as realistic movements and fast interactions. Thus, virtual environment should be rendered as fast as possibl. Regular frame rate should also be kept to make moves as intended by the user. In a complex virtual environment composed of objects with various levels, the appropriate level for individual object should be assigned according to the view point, in other words, the selection of level-of-detail is needed. In this paper, the problem of determining the levels of detail is formalized in terms of error, cost and L -distance. Error is defined as the difference between the current level image and the highest level image, cost as rendering time, and L-distance as the level difference between the previous and the current level. To solve this problem, a new method called the well-distributed adaptive algorithmis proposed.