• Structural Engineering and Mechanics
• /
• 제85권5호
• /
• pp.607-620
• /
• 2023

The classical optimal control (COC) method has been widely used for linear quadratic regulator (LQR) problems of structural control. However, the equation of motion of the structure is incorporated into the optimization model as the constraint condition for the LQR problem, which needs to be solved through the Riccati equation under certain assumptions. In this study, an explicit optimal control (EOC) method is proposed based on the explicit time-domain method (ETDM). By use of the explicit formulation of structural responses, the LQR problem with the constraint of equation of motion can be transformed into an unconstrained optimization problem, and therefore the control law can be derived directly without solving the Riccati equation. To further optimize the weighting parameters adopted in the control law using the gradient-based optimization algorithm, the sensitivities of structural responses and control forces with respect to the weighting parameters are derived analytically based on the explicit expressions of dynamic responses of the controlled structure. Two numerical examples are investigated to demonstrate the feasibility of the EOC method and the optimization scheme for weighting parameters involved in the control law.

• 제어로봇시스템학회논문지
• /
• 제18권9호
• /
• pp.854-862
• /
• 2012

The optimal design of batch-storage network by using periodic square wave model provides analytical lot sizing equations for a complex supply chain network characterized as multi-supplier, multi-product, multi-stage, non-serial, multi-customer, cyclic system including recycling and/or remanufacturing. The network structure includes multiple currency flows as well as material flows. The processes are represented by multiple feedstock/product materials with fixed composition which are very suitable for production processes. In this study, transportation processes that carry multiple materials with unknown composition are added and the time frame is changed from single period into multiple periods in order to represent nonperiodic parameter variations. The objective function of the optimization involves minimizing the opportunity costs of annualized capital investments and currency/material inventories minus the benefit to stockholders in the numeraire currency. The expressions for the Kuhn-Tucker conditions of the optimization problem are reduced to a multiperiod subproblem for average flow rates and analytical lot-sizing equations. The multiperiod lot sizing equations are different from single period ones. The effects of corporate income taxes, interest rates and exchange rates are incorporated.

• 대한교통학회지
• /
• 제24권1호
• /
• pp.97-108
• /
• 2006

현재 우리나라에서는 버스 노선의 정류장 수 및 간격 산정을 위해 전문가의 주관적인 판단에 의존하는 경우가 많다. 좀 더 객관적인 절차를 통해 신뢰성 있는 결과를 얻기 위해 최적 정류장 수 및 간격을 구하는 기존 모형들을 살펴보았지만 하차수요와 임의적인 수요분포를 고려하지 못한다는 한계점을 안고 있었다. 본 연구는 기존 모형들의 이러한 한계를 인식하고 수요를 승차와 하차로 구분하고 그 분포에 라라 일정한 구간별로 서로 다른 최적 정류장 수와 간격을 탄력적으로 산출해 낼 수 있는 모형을 정립하였다. 정립된 모형을 다양한 수요분포를 가지는 간단한 예제노선에 적용해본 결과 승차 혹은 하차수요에 비례하여 구간별 정류장 수가 탄력적으로 산출됨을 알 수 있었다.

• 대한교통학회지
• /
• 제26권1호
• /
• pp.145-153
• /
• 2008

기존의 최단경로 탐색모형들은 주로 경로의 단일 속성만을 고려한다. 그러나 실제로 통행자가 단일 속성만을 고려하여 경로를 선택하는 경우는 드물며, 대부분의 경로는 통행시간이나 경로길이 또는 통행자의 개인적인 선호 등과 같은 다양한 속성들이 종합적으로 고려되어 선택되어진다. 따라서 최적경로를 탐색하기 위해서는 이와 같은 다양한 속성들을 종합적으로 고려하여야 한다. 본 논문에서는 다양한 경로속성들을 고려하기 위하여 이산선택모형을 사용하여 네트워크의 노드별 효용을 산출하고, 이를 이용하여 최대의 효용을 가지는 경로를 탐색한다. 경로선택모형을 구축하기 위하여 경로선택에 영향을 미치는 요소들을 통행시간, 지체시간, 경로길이, 신호교차로수, 회전수, 전용도로의 포함비율 6가지로 선정하고, 모형의 모수를 추정하기 위한 현시선호자료를 구하기 위하여 서울시와 인접 신도시 간의 기종점 5개에 대한 경로를 선정하여 설문조사를 실시하였다. 경로선택모형의 함수형태로는 다항로짓모형을 사용하였으며, 모수추정 결과 통행시간과 신호 교차로수, 전용도로의 포함비율을 제외한 경로길이, 지체시간, 회전수를 가지고 모수를 추정한 결과가 통계적 유의성이 가장 높은 모형으로 도출되었다. 경로탐색 알고리즘으로는 도심부에서 U-turn과 회전제한의 반영이 가능한 기존의 수정형 덩굴망 알고리즘을 사용하였으며, 이를 구현하여 실제 네트워크에 적용하였다.

• 대한교통학회지
• /
• 제22권6호
• /
• pp.57-66
• /
• 2004

관측교통량으로부터 기종점 OD 행렬을 추정할 때 적정한 관측구간을 선정한 후 선정된 구간의 교통량을 이용하여 기종점 OD행렬을 추정하는 것이 기종점 ODGODFUF의 추정력을 향상시키고 경제적인 효율성(관측비용 감소)을 제고하기 위한 방법이라고 판단하였다. 본 연구에서는 관측구간을 선정하기 위해 정수계획법을 이용하여 관측구간을 선정하는 모형식을 제시하였으며 이 기법을 이용하여 교통량 관측구간을 선정한 후, 성정된 관측구간의 교통량으로부터 기종점 OD행렬을 추정하였다. 또한 적정한 관측구간으로 선정된 교통량으로부터 추정된 기종점 OD행렬의 추정력을 비교분석하기 위하여 임의적으로 관측구간을 선정하여 기종점 OD행렬을 추정한 기존의 연구결과와 비교하였다. 비교분석한 결과, 적정한 관측구간을 선정하여 추정한 구간교통량 및 추정 기종점 OD행렬의 추정력이 임의적으로 관측구간의 교통량을 이용한 결과의 오차보다 더 개선되는 것으로 분석되었다. 따라서 관측교통량으로 기종점 OD행렬을 추정하기 위해서는 적정한 관측구간을 선정하여 선정된 구간의 교통량으로부터 기종점 OD행렬을 추정하는 것이 오차를 줄일수 있으며 추정력을 향상시킬수 있는 방법이라고 하겠다.

• 제어로봇시스템학회논문지
• /
• 제10권6호
• /
• pp.537-544
• /
• 2004

An effective methodology is reported for determining the optimal lot size of batch processing and storage networks which include uncertain demand forecasting. We assume that any given storage unit can store one material type which can be purchased from suppliers, internally produced, infernally consumed, transported to or from other sites and/or sold to customers. We further assume that a storage unit is connected to all processing and transportation stages that consume/produce or move the material to which that storage unit is dedicated. Each processing stage transforms a set of feedstock materials or intermediates into a set of products with constant conversion factors. A batch transportation process can transfer one material or multiple materials at once between sites. The objective for optimization is to minimize the probability averaged total cost composed of raw material procurement, processing setup, transportation setup and inventory holding costs as well as the capital costs of processing stages and storage units. A novel production and inventory analysis formulation, the PSW(Periodic Square Wave) model, provides useful expressions for the upper/lower bounds and average level of the storage inventory. The expressions for the Kuhn-Tucker conditions of the optimization problem can be reduced to two sub-problems. The first yields analytical solutions for determining lot sires while the second is a separable concave minimization network flow subproblem whose solution yields the average material flow rates through the networks for the given demand forecast scenario. The result of this study will contribute to the optimal design and operation of the global supply chain.

• 한국국방경영분석학회지
• /
• 제30권2호
• /
• pp.133-140
• /
• 2004

In this paper, with the limited range of ammunition supply point(ASP) at ammunition battalion in specific corps and light automobile battalion(LAB) directly supports its vehicle for ammunition supply, we propose optimal model to minimize transportation time and logistics cost using integer programming(IP) for efficient ammunition resupply allocation during a given operation period of front combat unit. And then, we consider ammunition treatment and supply capacity of ammunition supply point(ASP), constraint elements of transportation ability considering time and cost, ammunition storage capacity of combat unit, combat situation and unit mission to propose this model. Finally, through numerical example, we examine the applicable feasibility of proposed model.

• 한국항해항만학회지
• /
• 제30권7호
• /
• pp.561-566
• /
• 2006

In this paper, we propose a new ship scheduling set packing model considering limited risk or variance. The set packing model is used in many applications, such as vehicle routing, crew scheduling, ship scheduling, cutting stock and so on. As long as the ship scheduling is concerned, there exits many unknown external factors such as machine breakdown, climate change and transportation cost fluctuation. However, existing ship scheduling models have not considered those factors apparently. We use a quadratic set packing model to limit the variance of expected cost of ship scheduling problems under stochastic spot rates. Set problems are NP-complete, and additional quadratic constraint makes the problems much harder. We implement Kelley's cutting plane method to replace the hard quadratic constraint by many linear constrains and use branch-and-bound algorithm to get the optimal integral solution. Some meaningful computational results and comments are provided.

• 한국항해항만학회지
• /
• 제33권4호
• /
• pp.271-275
• /
• 2009

A strategic decision making on location selection for product transportation includes many tangible and untangible factors. To choose the best locations is a difficult job in the sense that objectives usually conflict with each other. In this paper, we consider a multi stage multi criteria transshipment problem with different types of items to be transported from the sources to the destination points. For the optimization of the problem, a goal programming formulation will be presented in which the location selection for each product type will be determined under the multi objective criteria. In the study, we generalize the transshipment model with a variety of product types and finite number of different intermediate nodes between origins and destinations. For the selection of the criteria we selected the costs(fixed cost and transportation cost), location numbers, and unsatisfied demand for each type of products in multi stage transportation, which are the main goals in transshipment modelling problems. The related conditions are also modelled through linear formats.

• 한국경영과학회지
• /
• 제40권1호
• /
• pp.21-33
• /
• 2015

This paper develops an analytic model for minimizing the cost of distributing items by truck from one supplier to many customers under Milk run logistics strategy. The model derives formulas for not only inventory and transportation costs but also costs associated with carbon emission trading scheme. In addition, monetary investment for reducing carbon emissions is considered. We analyze how to determine optimal shipment size and carbon emission reduction investment. The purpose of this work is to evaluate the effects of carbon emission trading scheme on the Milk run logistics strategy in terms of how much to reduce carbon emissions and/or inventory and transportation costs. We analytically show that it is possible to reduce carbon emissions while reducing inventory and transportation costs by introducing cap-and-trade carbon emission trading scheme under certain conditions.