• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.392-392
• /
• 2000

This study performs optimization of paper mill scheduling using MINLP(Mixed-Integer Non-Linear Programming) method and 2-step decomposing strategy. Paper mill process is normally composed of five units: paper machine, coater, rewinder, sheet cutter and roll wrapper/ream wrapper. Various kinds of papers are produced through these units. The bottleneck of this process is how to cut product papers efficiently from raw paper reel and this is called trim loss problem or cutting stock problem. As the trim must be burned or recycled through energy consumption, minimizing quantity of the trim is important. To minimize it, the trim loss problem is mathematically formulated in MINLP form of minimizing cutting patterns and trim as well as satisfying customer's elder. The MINLP form of the problem includes bilinearity causing non-linearity and non-convexity. Bilinearity is eliminated by parameterization of one variable and the MINLP form is decomposed to MILP(Mixed-Integer Linear programming) form. And the MILP problem is optimized by means of the optimization package. Thus trim loss problem is efficiently minimized by this 2-step optimization method.

• Steel and Composite Structures
• /
• v.22 no.5
• /
• pp.1163-1192
• /
• 2016

This paper presents the cost optimization of a composite I beam floor system, designed to be made from a reinforced concrete slab and steel I sections. The optimization was performed by the mixed-integer non-linear programming (MINLP) approach. For this purpose, a number of different optimization models were developed that enable different design possibilities such as welded or standard steel I sections, plastic or elastic cross-section resistances, and different positions of the neutral axes. An accurate economic objective function of the self-manufacturing costs was developed and subjected to design, resistance and deflection (in)equality constraints. Dimensioning constraints were defined in accordance with Eurocode 4. The Modified Outer-Approximation/Equality-Relaxation (OA/ER) algorithm was applied together with a two-phase MINLP strategy. A numerical example of the optimization of a composite I beam floor system, as presented at the end of this paper, demonstrates the applicability of the proposed approach. The optimal result includes the minimal produced costs of the structure, the optimal concrete and steel strengths, and dimensions.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.163.3-163
• /
• 2001

This paper presents the two-step strategy method of performing optimal scheduling of paper mill processes using MINLP (Mixed-Integer Non-Linear Programming) considering the trim loss problem in sheet cutting processes. The mathematical model for a sheet cutting process in the form of MINLP is developed in this study, and minimizing total cost is performed considering the cost of raw paper roll, :hanging cutting patterns, storage of over-product and recycling/burning trim. The paper has been used to deliver and conserve information for a long time, and it is needed to have various sizes and weights ...

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10b
• /
• pp.30-35
• /
• 1993

Simple recurrence relations for calculating completion times of various storage polices (unlimited, intermediate storages(FIS), finite intermediate storages(FIS), no intermediate storage(NIS), zero wait(ZW) for serial multi-product multi-unit processes are suggested. Not only processing times but also transfer times, set-up (clean-up) times of units and set-up times of storages are considered. Optimal scheduling strategies with zero transfer times and zero set-up times had been developed as a mixed integer linear programniing(MILP) formulation for several intermediate storage policies. In this paper those with non-zero transfer times, non-zero set-up times of units and set-up times of storages are newly proposed as a mixed integer nonlinear programming(MINLP) formulation for various storage polices (UIS, NIS, FIS, and ZW). Several examples are tested to evaluate the robustness of this strategy and reasonable computation times.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.10
• /
• pp.1721-1730
• /
• 2007

SThis paper proposes a new dispatch scheduling algorithm in interconnected regional system operations. The dispatch scheduling formulated as mixed integer non-linear programming (MINLP) problem can efficiently be computed by generalized Benders decomposition (GBD) algorithm. GBD guarantees adequate computation speed and solution convergency since it decomposes a primal problem into a master problem and subproblems for simplicity. In addition, the inter-temporal optimal power flow (OPF) subproblem of the dispatch scheduling problem is comprised of various variables and constraints considering time-continuity and it makes the inter-temporal OPF complex due to increased dimensions of the optimization problem. In this paper, regional decomposition technique based on auxiliary problem principle (APP) algorithm is introduced to obtain efficient inter-temporal OPF solution through the parallel implementation. In addition, it can find the most economic dispatch schedule incorporating power transaction without private information open. Therefore, it can be expanded as an efficient dispatch scheduling model for interconnected system operation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.6
• /
• pp.2282-2303
• /
• 2021

To solve the problems of heavy computing load and system transmission pressure in energy internet (EI), we establish a three-tier cloud-edge integrated EI network based on a cloud-edge collaborative computing to achieve the tradeoff between energy consumption and the system delay. A joint optimization problem for resource allocation and task offloading in the threetier cloud-edge integrated EI network is formulated to minimize the total system cost under the constraints of the task scheduling binary variables of each sensor node, the maximum uplink transmit power of each sensor node, the limited computation capability of the sensor node and the maximum computation resource of each edge server, which is a Mixed Integer Non-linear Programming (MINLP) problem. To solve the problem, we propose a joint task offloading and resource allocation algorithm (JTOARA), which is decomposed into three subproblems including the uplink transmission power allocation sub-problem, the computation resource allocation sub-problem, and the offloading scheme selection subproblem. Then, the power allocation of each sensor node is achieved by bisection search algorithm, which has a fast convergence. While the computation resource allocation is derived by line optimization method and convex optimization theory. Finally, to achieve the optimal task offloading, we propose a cloud-edge collaborative computation offloading schemes based on game theory and prove the existence of Nash Equilibrium. The simulation results demonstrate that our proposed algorithm can improve output performance as comparing with the conventional algorithms, and its performance is close to the that of the enumerative algorithm.