• International Commerce and Information Review
• /
• v.1 no.2
• /
• pp.229-247
• /
• 1999

Where a paper document, a manual signature, or negotiability is required in statute, then solutions must be found through a change in the law. However, where the problem originates in commercial usage, then the solution can be easier, and speedy. Certainly, nearly all of the functions that paper document provides can be equally, or better, satisfied by electronic means. That is, Electronic Commerce(EC), which has been increasing rapidly and is a new type of transaction, may be hindered by legal obstacles to use of Electronic Message, or by uncertainty to its legal effect and validity. Therefore, it is important to sustain legal effect to Electronic Message for the prosperity of EC The one of solutions is to use reliable Electronic signature system by Certification Authority to verify the authenticity of Electronic Message.

• The Korean Journal of Food And Nutrition
• /
• v.23 no.4
• /
• pp.615-622
• /
• 2010

The present study attempted to investigate the military foodservice operation by conducting survey to foodservice managers. Surveys for managers of military foodservice operations were conducted in November, 2008 by visiting Consolidated Army Logistics School located in Daejeon during the time of training. Surveys for military foodservice officers and dietitian were sent by mail. The questionnaire was composed of the questions asking the general operation of military canteen, the self-concious specialty of military foodservice, and the needs assigning dietitian to each military unit. From the results of this study, it came up with the needs to draw up the plan to improve the foodservice specialty of canteen managers. One of the solution would assign dietitian to each military foodservice unit. Also, the facilities need to be equipped for various way of cooking to improve the satisfaction of soldiers. The results of this study would provide the data for making policy as well as arose academic interest to military foodservice.

• Journal of Korean Institute of Industrial Engineers
• /
• v.36 no.4
• /
• pp.219-229
• /
• 2010

The PERT/CPM are considered as the base procedures for the most successful project scheduling programs. Unfortunately, it is not easy to apply these procedures to real-life projects. This is due to the fact that PERT/CPM assume an infinite number of resources for each activity in project networks. Obviously, the completion time under no constraints is less than when constraints are imposed. One way of approaching this problem is to use heuristic solution techniques. In this paper, we present three heuristics; MRU (Maximum Resource Use) rule, STU (Shortest Time Use) rule, MRUP (Max Resource Use and Period) rule for allocating resources to activities of projects under multiple resource constraints. Comparisons of the project durations show that these heuristic rules are superior to AG3 rule that has been widely used in practice (Elsayed and Boucher, 1994).

• Journal of Korean Institute of Industrial Engineers
• /
• v.36 no.2
• /
• pp.78-86
• /
• 2010

The traveling purchaser problem(TPP) is a generalization of the well-known traveling salesman problem(TSP), which has many real-world applications such as purchasing the required raw materials for the manufacturing factories and the scheduling of a set of jobs over some machines, and many others. TPP also could be extended to the vehicle routing problem(VRP) by incorporating additional constraints such as multi-purchaser, capacity, distance and time restrictions. In the last decade, TPP has received some attention of the researchers in the operational research area. However it has not received the equivalent interest as much as TSP and VRP. Therefore, there does not exist a review of the TPP. The purpose of this paper is to review the TPP and to describe solution procedures proposed for this problem. We also introduce the ILP formulation for the multiple TPP(mTPP) which is generalized type of TPP. We compare the system performance according to change from TPP to mTPP.

• Management Science and Financial Engineering
• /
• v.12 no.2
• /
• pp.37-62
• /
• 2006

This paper considers the problem of designing logical tunnels in virtual private networks considering QoS guarantee which restricts the number of tunnel hops for each traffic routing. The previous researches focused on the design of logical tunnel itself and Steiner-tree based solution algorithms were proposed. However, we show that for some objective settings it is not sufficient and is necessary to consider both physical and logical connectivity at the same time. Thereupon, the concept of the layered network is applied to the logical tunnel design problem in virtual private networks. The layered network approach considers the design of logical tunnel as well as its physical routing and we propose a modified branch-and-price algorithm which is known to solve layered network design problems effectively. To show the performance of the proposed algorithm, computational experiments have been done and the results show that the proposed algorithm solves the given problem efficiently and effectively.

• Journal of the military operations research society of Korea
• /
• v.35 no.3
• /
• pp.47-59
• /
• 2009

A hybrid Genetic Algorithm is applied to military resource allocation problem. Since military uses many resources in order to maximize its ability, optimization technique has been widely used for analysing resource allocation problem. However, most of the military resource allocation problems are too complicate to solve through the traditional operations research solution tools. Recent innovation in computer technology from the academy makes it possible to apply heuristic approach such as Genetic Algorithm(GA), Simulated Annealing(SA) and Tabu Search(TS) to combinatorial problems which were not addressed by previous operations research tools. In this study, a hybrid Genetic Algorithm which reinforces GA by applying local search algorithm is introduced in order to address military optimization problem. The computational result of hybrid Genetic Algorithm on Missile Interceptor Allocation problem demonstrates its efficiency by comparing its result with that of a simple Genetic Algorithm.

• Journal of the Korean Society of Tobacco Science
• /
• v.25 no.1
• /
• pp.53-58
• /
• 2003

This study deals with the leaf tobacco assignment problem of a leaf tobacco warehouse with multiple input points and single output point. Also, the number of storage frequences is not necessary the same as that of retrieval for each leaf tobacco. A mathematical model is developed with the objective of minimizing the total travel distance associated with storage and retrieval operations. We also develop several heuristics based on the retrieval order frequency, retrieval/storage frequency ratio of leaf tobacco, and ABC curve. It is observed that the ABC curve based heuristic gives the best solution which is near optimal. Based on the test results from real world data, the ABC curve based heuristic is found to give a best performance. Comparing to current assignment method, the ABC curve based heuristic reduced total travel distance about 17.2%.

• Journal of Korean Institute of Industrial Engineers
• /
• v.31 no.2
• /
• pp.173-179
• /
• 2005

This paper presents an extended EMQ model which determines an optimal production quantity for a single stage production system when defective items are stochastically produced in the production process and they are re-processed in the rework process to convert them into non-defectives. Through the mathematical modeling, an optimal solution minimizing the average cost per unit time and minimum average cost as well as some properties are derived. It can be shown that each of the existing models is a special case of the proposed model under some conditions. Numerical experiment is carried out to examine the behavior of the proposed model and support properties derived.

• Journal of the Korea Safety Management & Science
• /
• v.12 no.3
• /
• pp.163-168
• /
• 2010

Recently, there are many problems of service qualities such as regular-rapid-safe -comfortable transport, that was traditionally advantages in urban railway transportations. These problems cause train delays that affects consecutive schedule, capacity, operation plans, and it is hard to prevent the propagation of delay and find the recovery solution. Because the urban transport demands is continuously increased and the railway service is also expanded, the railway operation company makes efforts to improve operation performance and efficiency for passengers. In this paper, we analyse the issues and problems existing in the major operation line of high-density urban railways, and suggest the development direction of intelligent operation technology to improve the urban railway service by minimizing the occurrence and propagation of delay. And the result of numerical case study is also presented.

• Nonlinear Functional Analysis and Applications
• /
• v.28 no.4
• /
• pp.1051-1067
• /
• 2023

In this paper, an algorithm for approximating zeros of sum of three monotone operators is introduced and its convergence properties are studied in the setting of 2-uniformly convex and uniformly smooth Banach spaces. Unlike the existing algorithms whose step-sizes usually depend on the knowledge of the operator norm or Lipschitz constant, a nice feature of the proposed algorithm is the fact that it requires only a diminishing and non-summable step-size to obtain strong convergence of the iterates to a solution of the problem. Finally, the proposed algorithm is implemented in the setting of a classical Banach space to support the theory established.