• THE INTERNATIONAL COMMERCE & LAW REVIEW
• /
• v.49
• /
• pp.111-137
• /
• 2011

UCP 600 Article 14(b), providing rules for the period of the examination of documents, is a radical reorganization of UCP Article 13(b). The provision changes the period of time to a maximum of five banking days instead of reasonable time. One of the critical problems giving rise to the difficulty in interpretation and application is the question of fact that there may be two possible conflicting options in determining the time of checking documents presented. The one doctrine is fixed time(safe harbor) standard, and the other is hidden reasonableness standard. This study analyzes which option should be adopted for the optimal application standard by welfare effect methodology using consumer surplus approach and suggests that safe harbor standard should be optimal solution to the determination of period of examination of documents presented in letter of credit regime.

• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.1
• /
• pp.157-165
• /
• 1998

This paper considers the single-product production and transportation problem with discrete time, dynamic demand and finite time horizon, an extension of classical dynamic lot-sizing model. In the model, multiple freight container types are allowed as the transportation mode and each order (product) placed in a period is shipped immediately by containers in the period. Moreover, each container has type-dependent carrying capacity restriction and at most one container type is allowed in each shipping period. The unit freight cost for each container type depends on the size of its carrying capacity. The total freight cost is proportional to the number of each container type employed. Such a freight cost is considered as another set-up cost. Also, it is assumed in the model that production and inventory cost functions are dynamically concave and backlogging is not allowed. The objective of this study is to determine the optimal production policy and the optimal transportation policy simultaneously that minimizes the total system cost (including production cost, inventory holding cost, and freight cost) to satisfy dynamic demands over a finite time horizon. In the analysis, the optimal solution properties are characterized, based on which a dynamic programming algorithm is derived. The solution algorithm is then illustrated with a numerical example.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.37 no.10
• /
• pp.998-1001
• /
• 2009

This paper shows that the conventional proportional navigation guidance(PNG) law with a constant navigation gain is an optimal solution strictly also when the velocity is varying during engagement. Especially, PNG with navigation constant, 3, is an optimal solution minimizing a closing velocity weighted induced-drag. While most of previous studies on optimality of PNG were relied on the linear formulation and the constant speed assumption, this study presents more general analysis results on optimality of PNG based on the nonlinear formulation and the time-varying velocity assumption.

• Journal of Intelligence and Information Systems
• /
• v.15 no.3
• /
• pp.137-150
• /
• 2009

This paper proposes the hybrid heuristic method to apply the opportunity time to solve the vehicle routing and scheduling problem with time constraints(VRSPTW). The opportunity time indicates the idle time which remains after the vehicle performs the unloading service required by each customer's node. In this proposed heuristic, we add the constraints to VRSPTW model for the opportunity time. We also obtain the initial solution by applying the cost evaluation function to the insertion strategy considering the opportunity time. In addition, we improve the former result by applying the opportunity time to the tabu search strategy by swapping the customer's node. Finally, we suggest the construction strategies of initial routing which can efficiently acquire the nearest optimal solution from various types of data in terms of geographical condition, scheduling horizon and vehicle capacity. Our experiment show that our heuristic can get the nearest optimal solution more efficiently than the Solomon's I1 heuristic.

• Journal of Distribution Science
• /
• v.14 no.2
• /
• pp.41-45
• /
• 2016

Purpose - Finding an optimal path is an essential component for the design and operation of smart transportation or logistics network. Many applications in navigation system assume that travel time of each link is fixed and same. However, in practice, the travel time of each link changes over time. In this paper, we introduce a new transportation problem to find a latest departing time and delivery path between the two nodes, while not violating the appointed time at the destination node. Research design, data, and methodology - To solve the problem, we suggest a mathematical model based on network optimization theory and a backward search method to find an optimal solution. Results - First, we introduce a dynamic transportation problem which is different with traditional shortest path or minimum cost path. Second, we propose an algorithm solution based on backward search to solve the problem in a large-sized network. Conclusions - We proposed a new transportation problem which is different with traditional shortest path or minimum cost path. We analyzed the problem under the conditions that travel time is changing, and proposed an algorithm to solve them. Extending our models for visiting two or more destinations is one of the further research topics.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.78-101
• /
• 2017

High-quality industrial control is critical to ensuring production quality, reducing production costs, improving management levels and stabilizing equipment and long-term operations. WiFi-based Long Distance (WiLD) networks have been used as remote industrial control networks. Real-time performance is essential to industrial control. However, the original mechanism of WiLD networks does not minimize end-to-end delay and restricts improvement of real-time performance. In this paper, we propose two algorithms to obtain the transmitting/receiving phase cycle length for each node such that real time constraints can be satisfied and phase switching overhead can be minimized. The first algorithm is based on the branch and bound method, which identifies an optimal solution. The second is a fast heuristic algorithm. The experimental results show that the execution time of the algorithm based on branch and bound is less than that of the heuristic algorithm when the network is complex and that the performance of the heuristic algorithm is close to the optimal solution.

• International Journal of Aeronautical and Space Sciences
• /
• v.18 no.4
• /
• pp.709-718
• /
• 2017

This paper proposes the guidance laws for an agile turn of air-to-air missiles during the initial boost phase. Optimal solution for the agile turn is obtained based on the optimal control theory with a simplified missile dynamic model. Angle-of-attack command generating methods for completion of agile turn are then proposed from the optimal solution. Collision triangle condition for non-maneuvering target is reviewed and implemented for update of terminal condition for the agile turn. The performance of the proposed method is compared with an existing homing guidance law and the minimum-time optimal solution through simulations under various initial engagement scenarios. Simulation results verify that transition to homing phase after boost phase with the proposed method is more effective than direct usage of the homing guidance law.

• Structural Engineering and Mechanics
• /
• v.86 no.2
• /
• pp.249-260
• /
• 2023

The uncertainties involved in structural performances are of importance when the optimum number and property of seismic retrofit devices are determined. This paper proposes a seismic retrofit design framework for asymmetric soft-first-story buildings, considering uncertainties in the soil condition and seismic retrofit device. The effect of the uncertain parameters on the structural performance is used to find a robust and optimal seismic retrofit solution. The framework finds a robust and optimal seismic retrofit solution by finding the optimal locations and mechanical properties of the seismic retrofit device for different realizations of the uncertain parameters. The structural performance for each realization is computed to evaluate the effect of the uncertainty parameters on the seismic performance. The framework utilizes parallel processing to decrease the computationally intensive nonlinear dynamic analysis time. The framework returns a robust design solution that satisfies the given limit state for every realization of the uncertain parameters. The proposed framework is applied to the seismic retrofit design of a five-story asymmetric soft-first-story case study structure retrofitted with a viscoelastic damper. Robust optimal parameters for retrofitting a structure to satisfy the limit state for the different realizations of the uncertain parameter are found using the proposed framework. According to the performance evaluation results of the retrofitted structure, the developed framework is proved effective in the seismic retrofit of the asymmetric structure with inherent uncertainties.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.11a
• /
• pp.89-92
• /
• 2003

It is often that a large-scale linear programming(LP) problem may contain many constraints which are redundant or cause infeasibility on account of inefficient formulation or some errors in data input. Presolving or preprocessing is a series of operations which removes the underlying redundancy or detects infeasibility in the given LP problem. It is essential for the speedup of an LP system solving large-scale problems to implement presolving techniques. For the recovery of an optimal solution for the original problem from an optimal solution for the presolved problem, a special procedure, so called postsolving, must be applied. In this paper, we present how a postsolving procedure is constructed and implemented in LPABO, a interior-point based LP system. Briefly, all presolving processes are logged in a data structure in LPABO, and after the end of the solution method an optimal solution for the original problem is obtained by tracing the logs. In each stage of the postsolving procedure, the optimality of intermediate solutions is maintained. We tested our postsolving procedure on Netlib, Gondzio and Kennington LP data sets, and concluded that the computational burden of the procedure is relatively negligible compared with the total solving time.

• Journal of Institute of Control, Robotics and Systems
• /
• v.4 no.6
• /
• pp.802-810
• /
• 1998

The purpose of this study is to find the analytic solution of determining the optimal capacity of processes and storages to meet the product demand. Recent trend to reduce product delivery time and to provide high quality product to customer requires the increasing capacity of storage facilities. However, the cost of constructing and operating storage facilities is becoming substantial because of increasing land value, environmental and safety concern. Therefore, reasonable decision making about the capacity of processes and storages is important subject for industries. The industrial solution for this subject is to use the classical economic lot sizing method, EOQ(Economic Order Quantity) model, trimmed with practical experience but the unrealistic assumption of EOQ model is not suitable for the chemical plant design with highly interlinked processes and storages. This study, a first systematic attempt for this subject, clearly overcomes the limitation of classical lot sizing method. The superstructure of the plant consists of the network of serially and/or parallelly interlinked processes and storages. A novel production and inventory analysis method, PSW(Periodic Square Wave) model, is applied. The objective function of optimization is minimizing the total cost composed of setup and inventory holding cost. The advantage of PSW model comes from the fact that the model provide a set of simple analytic solution in spite of realistic description of material flow between process and storage. The resulting simple analytic solution can greatly enhance the proper and quick investment decision for the preliminary plant design confronting diverse economic situation.