• Smart Structures and Systems
• /
• 제33권1호
• /
• pp.17-26
• /
• 2024

The new metro crossing the existing metro will cause the settlement or floating of the existing structures, which will have safety problems for the operation of the existing metro and the construction of the new metro. Therefore, it is necessary to monitor and predict the settlement of the existing metro caused by the construction of the new metro in real time. Considering the complexity and uncertainty of metro settlement, a Gaussian Prior Bayesian Emulator (GPBE) probability prediction model based on Bayesian optimization (BO) is proposed, that is, BO-GPBE. Firstly, the settlement monitoring data are analyzed to get the influence of the new metro on the settlement of the existing metro. Then, five different acquisition functions, that is, expected improvement (EI), expected improvement per second (EIPS), expected improvement per second plus (EIPSP), lower confidence bound (LCB), probability of improvement (PI) are selected to construct BO model, and then BO-GPBE model is established. Finally, three years settlement monitoring data were collected by structural health monitoring (SHM) system installed on Nanjing Metro Line 10 are employed to demonstrate the effectiveness of BO-GPBE for forecasting the settlement.

• Industrial Engineering and Management Systems
• /
• 제16권1호
• /
• pp.118-128
• /
• 2017

Uncertain factors in finical markets make the prediction of future returns and risk of asset much difficult. In this paper, a model,assuming the admissible errors on expected returns and risks of assets, assisted in the multiperiod mean variance portfolio selection problem is built. The model considers transaction costs, upper bound on borrowing risk-free asset constraints, cardinality constraints and threshold constraints. Cardinality constraints limit the number of assets to be held in an efficient portfolio. At the same time, threshold constraints limit the amount of capital to be invested in each stock and prevent very small investments in any stock. Because of these limitations, the proposed model is a mix integer dynamic optimization problem with path dependence. The forward dynamic programming method is designed to obtain the optimal portfolio strategy. Finally, to evaluate the model, our result of a meaning example is compared to the terminal wealth under different constraints.

• 한국경영과학회지
• /
• 제36권2호
• /
• pp.1-14
• /
• 2011

In this paper, we deal with an access network design problem of fiber-to-the-home passive optical network (FTTH-PON). The FTTH-PON network design problem seeks to minimize the total cost of optical splitters and cables that provide optical connectivity between central office and subscribers. We develop a flow-based mixed integer programming (MIP) model with nonlinear link cost. By developing valid inequalities and preprocessing rules, we enhance the strength of the proposed MIP model in generating tight lower bounds for the problem. We develop an effective Tabu Search (TS) heuristic algorithm that provides good quality feasible solutions to the problem. Computational results demonstrate that the valid inequalities and preprocessing rules are effective for improving the LP-relaxation lower bound and TS algorithm finds good quality solutions within reasonable time bounds.

• 대한산업공학회지
• /
• 제27권4호
• /
• pp.424-431
• /
• 2001

This paper is concerned with the unconstrained two-dimensional cutting problem of cutting small rectangles (products), each of which has its own profit and size, from a large rectangle (material) to maximize the profit-sum of products. Since this problem is used as a sub-problem to generate a cutting pattern in the algorithms for the two-dimensional cutting stock problem, most of researches for the two-dimensional cutting stock problem have been concentrated on solving this sub-problem more efficiently. This paper improves Hifi and Zissimopoulos's recursive algorithm, which is known as the most efficient exact algorithm, by applying newly proposed upper bound and searching strategy. The experimental results show that the proposed algorithm has been improved significantly in the computational amount of time as compared with the Hifi and Zissimopulos's algorithm.

• Management Science and Financial Engineering
• /
• 제17권2호
• /
• pp.1-21
• /
• 2011

This paper considers an integrated inventory-distribution system with a fleet of heterogeneous vehicles employed where a single warehouse distributes a single type of products to many spatially distributed retailers to satisfy their dynamic demands. The problem is to determine order planning at the warehouse, and also vehicle schedules and delivery quantities for the retailers with the objective of minimizing the sum of ordering cost at the warehouse, inventory holding cost at both the warehouse and retailers, and transportation cost. For the problem, we give a Mixed Integer Programming formulation and develop a Lagrangean heuristic procedure for computing lower and upper bounds on the optimal solution value. The Lagrangean dual problem of finding the best Lagrangrean lower bound is solved by subgradient optimization. Computational experiments on randomly generated test problems showed that the suggested algorithm gives relatively good solutions in a reasonable amount of computation time.

• International Journal of Control, Automation, and Systems
• /
• 제6권1호
• /
• pp.15-23
• /
• 2008

This paper considers the problem of delay-dependent guaranteed cost controller design for uncertain neutral systems with distributed delays. The system under consideration is subject to norm-bounded time-varying parametric uncertainty appearing in all the matrices of the state-space model. By constructing appropriate Lyapunov functionals and using matrix inequality techniques, a state feedback controller is designed such that the resulting closed-loop system is not only robustly stable but also guarantees an adequate level of performance for all admissible uncertainties. Furthermore, a convex optimization problem is introduced to minimize a specified cost bound. By matrix transformation techniques, the corresponding optimal guaranteed controller can be obtained by solving a linear matrix inequality. Finally, a simulation example is presented to demonstrate the effectiveness of the proposed approach.

• 대한산업공학회지
• /
• 제29권3호
• /
• pp.222-229
• /
• 2003

In this paper, we address a layout design problem, PTN[2], for determining an appropriate 2-class-based dedicated storage layout in a class of unit load storage systems. Our strong conjecture is that PTNI2] is NP-hard. Restricting PTN[2], we provide three solvable cases of PTN[2] in which an optimal solution to the solvable cases is one of the partitions based on the PAI(product activity index)-nonincreasing ordering. However, we show with a counterexample that a solution based on the PAI-non increasing ordering does not always give an optimal solution to PTN[2]. Utilizing the derived properties, we construct an effective heuristic algorithm for solving PTN[2] based on a PAI-non increasing ordering with performance ratio bound. Our algorithm with O($n^2$) is effective in the sense that it guarantees a better class-based storage layout than a randomized storage layout in terms of the expected single command travel time.

• 대한산업공학회지
• /
• 제18권1호
• /
• pp.91-104
• /
• 1992

Flowshop scheduling problem is known to be NP-complete. Since the optimization apporach like branch-and-bound is limited by exponentially growing computation time, many heuristic methods have been developed. Total tardiness is one of the criteria that the researchers have recently considered in flowshop scheduling. There, however, are few literatures which studied the general (m machine)-flowshop scheduling under the total tardiness criterion. In this paper, a heuristic scheduling method to minimize total tardiness at the (m machine, n job)-flowshop is presented. A heuristic value function is proposed to be used as a dispatching criterion in initial schedule generation. And the schedule improving procedure, by pairwise interchange of tardy job with the job right ahead of it, is introduced. Illustrative examles and simulated results are presented.

• Journal of applied mathematics & informatics
• /
• 제41권3호
• /
• pp.487-510
• /
• 2023

We propose a mathematical model which describes the frictional contact between a piezoelectric body and an electrically conductive foundation. The behavior of the material is described with a linearly electro-viscoelastic constitutive law with long term memory. The mechanical process is dynamic and the electrical conductivity coefficient depends on the total slip rate, the friction is modeled with Tresca's law which the friction bound depends on the total slip rate with taking into account the electrical conductivity of the foundation both. The main results of this paper concern the existence and uniqueness of the weak solution of the model; the proof is based on results for second order evolution variational inequalities with a time-dependent hemivariational inequality in Banach spaces.

• Korean Chemical Engineering Research
• /
• 제52권4호
• /
• pp.497-502
• /
• 2014

바이오매스 유래 타르 및 왁스 성분은 파클리탁셀의 분리정제에 많은 악영향을 미치기 때문에 반드시 제거되어야 한다. 흡착제 처리는 식물세포배양으로부터 유래된 타르 및 왁스 성분을 매우 간단하고 효과적으로 제거할 수 있는 방법이다. 본 연구에서는 전처리 단계에서 상용흡착제 실로퓨트를 이용한 흡착제 처리 공정에서 주요 공정 변수들(온도, 시간, 용매, 건조시료/실로퓨트 비율)을 최적화하였다. 최적의 흡착제 처리 온도, 시간, 용매, 건조시료/실로퓨트 비율은 각각 $30^{\circ}C$, 15분, 메틸렌 클로라이드, 1:1(w/w)이었다. 이러한 결과는 TGA와 HPLC 분석을 통한 유기물의 흡착 양상으로도 확인하였다. 흡착제 처리 단계에서 순도 증가는 미미하였으나 타르 및 왁스 성분의 제거로 인한 후속공정의 공정 가능성과 편리성에 상당히 영향을 미쳤다.