• 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.

• International Journal of Control, Automation, and Systems
• /
• v.3 no.3
• /
• pp.411-418
• /
• 2005

This paper discusses an output-tracking control design method for Takagi-Sugeno fuzzy systems with parametric uncertainties. We first represent the concerned system as a set of uncertain linear systems. The tracking problem is then converted into a stabilization problem thereby leading to a more feasible control design procedure. A sufficient condition for robust practical output tracking is derived in terms of a set of linear matrix inequalities. A numerical example for a flexible-joint robot-arm model has been demonstrated, to convincingly show effectiveness of the proposed system modeling and control design.

• International Journal of Precision Engineering and Manufacturing
• /
• v.7 no.4
• /
• pp.57-62
• /
• 2006

The quality of precision spindle units (S/Us) running on rolling bearings depends strongly on their structural parameters, such as the configuration and geometry of the S/U elements and bearing preloads. When S/Us are designed, their parameters should be optimized to improve the performance characteristics. However, it is practically impossible to state perfectly a general criterion function for S/U quality. Therefore, we propose to use a multicriteria optimization based on the parameter space investigation (PSI) method We demonstrate the efficiency of the proposed method using the optimization results of high-speed S/Us.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.10a
• /
• pp.143-146
• /
• 2004

In a situation that rank order information on attribute weights is captured, two solution approaches are presented. An exact solution approach via interaction with a decision-maker pursues progressive reduction of a set of non-dominated alternatives by narrowing down the feasible attribute weights set. In approximate solution approach, on the other hand, three categories of approximate methods such as surrogate weights method, the dominance value-based decision rules, and three classical decision rules are presented and their efficacies in terms of choice accuracy are evaluated via simulation analysis. The simulation results indicate that a method, which combines an exact solution approach through interactions with the decision-maker and the dominance value-based approach is recommendable in a case that a decision is not made at a single step under imprecisely assessed weights information.

• Water for future
• /
• v.28 no.2
• /
• pp.169-180
• /
• 1995

The cost of a looped pipe network is affected by a set of loop flows. The mathematical model for optimizing the looped pipe network is expressed in the optimal set of loop flows to apply to a stochastic optimization method. Because the feasible region of the looped pipe network problem is nonconvex with multiple local optima, the Modified Stochastic Probing Method is suggested to efficiently search the feasible region. The method consists of two phase: i) a global search phase(the stochastic probing method) and ii) a local search phase(the nearest neighbor method). While the global search sequentially improves a local minimum, the local search escapes out of a local minimum trapped in the global search phase and also refines a final solution. In order to test the method, a standard test problem from the literature is considered for the optimal design of the paralled expansion of an existing network. The optimal solutions thus found have significantly smaller costs than the ones reported previously by other researchers.

• Journal of Aerospace System Engineering
• /
• v.14 no.2
• /
• pp.1-11
• /
• 2020

Detecting obstacles and generating a suitable path to avoid obstacles in real time is a prime mission requirement for UAVs. In areas, close to buildings and people, detecting obstacles in the path and estimating its own position (egomotion) in GPS degraded/denied environments are usually addressed with vision-based Simultaneous Localization and Mapping (SLAM) techniques. This presents possibilities and challenges for the feasible path generation with constraints of vehicle dynamics in the configuration space. In this paper, a near real-time feasible path is shown to be generated in the ORB-SLAM framework using a chain-based path planning approach in a force field with dynamic constraints on path length and minimum turn radius. The chain-based path plan approach generates a set of nodes which moves in a force field that permits modifications of path rapidly in real time as the reward function changes. This is different from the usual approach of generating potentials in the entire search space around UAV, instead a set of connected waypoints in a simulated chain. The popular ORB-SLAM, suited for real time approach is used for building the map of the environment and UAV position and the UAV path is then generated continuously in the shortest time to navigate to the goal position. The principal contribution are (a) Chain-based path planning approach with built in obstacle avoidance in conjunction with ORB-SLAM for the first time, (b) Generation of path with minimum overheads and (c) Implementation in near real time.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 2003.10a
• /
• pp.53-58
• /
• 2003

In recent years, the need for multi-stage gear drives, which highly reduce output speed, has been increased. However, the design of multi-stage gear drives have been carried out by a limited number of experts. The consideration for the direction of input and output axes also makes their design very difficult. The purpose of this study is to develop an algorithm for automatically generating complex multi-stage gear drives and to implement a design supporting system for multi-stage gear drives. There are 4 stages in the proposed algorithm, and major design parameters,.such as the direction of input and output axes, reduction ratio, etc. are set up in the first stage. In the second stage, all mechanisms are generated, and various rules are applied to select feasible mechanisms. In the third stage, the gear ratio of each stage is divided from total gear ratio. Next, the specifications of gears for feasible mechanisms are calculated and their bending strength and surface durability are estimated. In the forth stage, appraised indexes are calculated and provided to support the estimation of the generated gear drives.

• Journal of Digital Contents Society
• /
• v.14 no.1
• /
• pp.1-5
• /
• 2013

In this paper a study of efficient CPLD low power algorithm is proposed. Proposed algorithm applicate graph partition method using DAG. Circuit representation DAG. Each nodes set up cost. The feasible cluster create according to components of CPLD. Created feasible cluster generate power consumption consider the number of OR-term, the number of input and the number of output. Implement a circuit as select FC having the minimum power consumption. Compared with experiment [9], and power consumption was decreased. The proposed algorithm is efficient. this paper, we proposed FPGA algorithm for consider the power consumption.

• Transactions of the Korean Society of Machine Tool Engineers
• /
• v.14 no.4
• /
• pp.41-48
• /
• 2005

In recent years, the need for multi-stage gear drives which highly reduce output speed has been increased. However, the design of multi-stage gear drives has been carried out by a limited number of experts. The consideration for the direction of input and output axes also makes their design very difficult. The purpose of this study is to develop an algorithm for automatically generating complex multi-stage gear drives and to implement a design supporting system for multi-stage gear drives. There are 4 stages in the proposed algorithm, and major design parameters, such as the direction of input and output axes, reduction ratio, etc. are set up in the first stage. In the second stage, all mechanisms are generated, and various rules are applied to select feasible mechanisms. In the third stage, the gear ratio of each stage is divided from total gear ratio. Next, the specifications of gears for feasible mechanisms are calculated and their bending strength and surface durability are estimated. In the forth stage, appraised indexes are calculated and provided to support the estimation of the generated gear drives.

• Journal of the Korean Society for Library and Information Science
• /
• v.8
• /
• pp.233-263
• /
• 1981

The purpose of this study is to bring out the most reasonable and feasible evaluation methods of research library collection in Korea. At the very outset, writer tried to define the purpose and the necessity of collection evaluation. Writer described a collection evaluation is to gain the data for decision making on selection policy, weeding and storage project, and explained it is one of the procedures of a collection development system operation of being explained as repeated three procedures through a collection development plan, an implimentation of the set plan(selection process) and a collection evaluation. Writer also pointed out the fact many libraries in Korea are apt to by pass or overlook this important process. Writer then defined the criteria of a collection evaluation as the measurement of the proportion of library holding's capability to meet users' demands and that of the degree of total collection's utilization. Writer introduced and analysed seven existing collection evaluation methods and concluded the method by a survey of users' needs and opinion and the method by a circulation survey are the most feasible and reasonable methods that can be applied. Writer also added that using above two evaluation methods together can enhance the effectiveness of collection evaluation.