• Title/Summary/Keyword: Constraint Programming Model

Search Result 98, Processing Time 0.022 seconds

An Efficient Mixed-Integer Programming Model for Berth Allocation in Bulk Port (벌크항만의 하역 최적화를 위한 정수계획모형)

  • Tae-Sun, Yu;Yushin, Lee;Hyeongon, Park;Do-Hee, Kim;Hye-Rim, Bae
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.27 no.6
    • /
    • pp.105-114
    • /
    • 2022
  • We examine berth allocation problems in tidal bulk ports with an objective of minimizing the demurrage and dispatch associated berthing cost. In the proposed optimization model inventory (or stock) level constraints are considered so as to satisfy the service level requirements in bulk terminals. It is shown that the mathematical programming formulation of this research provides improved schedule resolution and solution accuracy. We also show that the conventional big-M method of standard resource allocation models can be exempted in tidal bulk ports, and thus the computational efficiency can be significantly improved.

Optimization Methodology for Sales and Operations Planning by Stochastic Programming under Uncertainty : A Case Study in Service Industry (불확실성하에서의 확률적 기법에 의한 판매 및 실행 계획 최적화 방법론 : 서비스 산업)

  • Hwang, Seon Min;Song, Sang Hwa
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.39 no.4
    • /
    • pp.137-146
    • /
    • 2016
  • In recent years, business environment is faced with multi uncertainty that have not been suffered in the past. As supply chain is getting expanded and longer, the flow of information, material and production is also being complicated. It is well known that development service industry using application software has various uncertainty in random events such as supply and demand fluctuation of developer's capcity, project effective date after winning a contract, manpower cost (or revenue), subcontract cost (or purchase), and overrun due to developer's skill-level. This study intends to social contribution through attempts to optimize enterprise's goal by supply chain management platform to balance demand and supply and stochastic programming which is basically applied in order to solve uncertainty considering economical and operational risk at solution supplier. In Particular, this study emphasizes to determine allocation of internal and external manpower of developers using S&OP (Sales & Operations Planning) as monthly resource input has constraint on resource's capability that shared in industry or task. This study is to verify how Stochastic Programming such as Markowitz's MV (Mean Variance) model or 2-Stage Recourse Model is flexible and efficient than Deterministic Programming in software enterprise field by experiment with process and data from service industry which is manufacturing software and performing projects. In addition, this study is also to analysis how profit and labor input plan according to scope of uncertainty is changed based on Pareto Optimal, then lastly it is to enumerate limitation of the study extracted drawback which can be happened in real business environment and to contribute direction in future research considering another applicable methodology.

Windows Program Package Development for Optimal Pourer Flour Analysis (최적전력조류 해석을 위한 원도우프로그램 팩키지 개발)

  • Kim, Gyu-Ho;Lee, Sang-Bong;Lee, Jae-Gyu;Yu, Seok-Gu
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.50 no.12
    • /
    • pp.584-590
    • /
    • 2001
  • This paper presents a windows program package for solving security constrained OPF in interconnected Power systems, which is based on the combined application of evolutionary programming(EP) and sequential quadratic programming(SQP). The objective functions are the minimization of generation fuel costs and system power losses. The control variables are the active power of the generating units, the voltage magnitude of the generator, transformer tap settings and SYC setting. The state variables are the bus voltage magnitude, the reactive power of the generating unit, line flows and the tie line flow In OPF considering security, the outages are selected by contingency ranking method. The resulting optimal operating point has to be feasible after outages such as any single line outage(respect of voltage magnitude, reactive power generation and power flow limits). The OPF package proposed is applied to IEEE 14 buses and 10 machines 39 buses model system.

  • PDF

Computational finite element model updating tool for modal testing of structures

  • Sahin, Abdurrahman;Bayraktar, Alemdar
    • Structural Engineering and Mechanics
    • /
    • v.51 no.2
    • /
    • pp.229-248
    • /
    • 2014
  • In this paper, the development of a new optimization software for finite element model updating of engineering structures titled as FemUP is described. The program is used for computational FEM model updating of structures depending on modal testing results. This paper deals with the FE model updating procedure carried out in FemUP. The theoretical exposition on FE model updating and optimization techniques is presented. The related issues including the objective function, constraint function, different residuals and possible parameters for FE model updating are investigated. The issues of updating process adopted in FemUP are discussed. The ideas of optimization to be used in FE model updating application are explained. The algorithm of Sequential Quadratic Programming (SQP) is explored which will be used to solve the optimization problem. The possibilities of the program are demonstrated with a three dimensional steel frame model. As a result of this study, it can be said that SQP algorithm is very effective in model updating procedure.

The Operational Optimization of Semiconductor Research and Development Fabs by FAB-wide Scheduling (FAB-Wide 스케줄링을 통한 반도체 연구라인의 운용 최적화)

  • Kim, Young-Ho;Lee, Jee-Hyong;Sun, Dong-Seok
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.57 no.4
    • /
    • pp.692-699
    • /
    • 2008
  • Semiconductor research and development(R&D) fabs are very different than production fabs in many ways such as the scales of production, job priority, production methods, and performance measures. Efficient operations of R&D fabs are very important to the development of new product, process stability, high yield, and ultimately company competitiveness. This paper proposes the fab-wide scheduling method for operational optimization of the R&D fabs. Most scheduling systems of semiconductor fabs have only focused on maximizing throughput of each separated areas without considering WIP(works in process) flows of entire fab. In this paper, we proposes the a fab-wide scheduling system which schedules all lots to entire fab equipment at once. We develop the MIP(mixed integer programing) model which allocates the lots to production equipment considering many constraints of all processes and the CP(constraint programming) model which determines the sequences of the lots in the production equipment. The proposed FAB-wide scheduling model is applied to the newly constructed R&D fab. As a result, we have accomplished the system based automated job reservation, decrease of the hot lot delay, increase of the queue time satisfaction, the high throughput by maximizing the batch sizes, decrease of the WIP TAT(Turn Around Time).

Maximizing Concurrency and Analyzable Timing Behavior in Component-Oriented Real-Time Distributed Computing Application Systems

  • Kim, Kwang-Hee Kane;Colmenares, Juan A.
    • Journal of Computing Science and Engineering
    • /
    • v.1 no.1
    • /
    • pp.56-73
    • /
    • 2007
  • Demands have been growing in safety-critical application fields for producing networked real-time embedded computing (NREC) systems together with acceptable assurances of tight service time bounds (STBs). Here a service time can be defined as the amount of time that the NREC system could take in accepting a request, executing an appropriate service method, and returning a valid result. Enabling systematic composition of large-scale NREC systems with STB certifications has been recognized as a highly desirable goal by the research community for many years. An appealing approach for pursuing such a goal is to establish a hard-real-time (HRT) component model that contains its own STB as an integral part. The TMO (Time-Triggered Message-Triggered Object) programming scheme is one HRT distributed computing (DC) component model established by the first co-author and his collaborators over the past 15 years. The TMO programming scheme has been intended to be an advanced high-level RT DC programming scheme that enables development of NREC systems and validation of tight STBs of such systems with efforts far smaller than those required when any existing lower-level RT DC programming scheme is used. An additional goal is to enable maximum exploitation of concurrency without damaging any major structuring and execution approaches adopted for meeting the first two goals. A number of previously untried program structuring approaches and execution rules were adopted from the early development stage of the TMO scheme. This paper presents new concrete justifications for those approaches and rules, and also discusses new extensions of the TMO scheme intended to enable further exploitation of concurrency in NREC system design and programming.

Designing optimized food intake patterns for Korean adults using linear programming (II): adjustment of the optimized food intake pattern by establishing stepwise intake goals of sodium (선형계획법을 이용한 한국 성인의 최적 식품섭취패턴 설계 (II) : 단계적 나트륨 목표섭취량 설정에 따른 최적 식품섭취패턴 조정)

  • Asano, Kana;Yang, Hongsuk;Lee, Youngmi;Kim, Meeyoung;Yoon, Jihyun
    • Journal of Nutrition and Health
    • /
    • v.52 no.4
    • /
    • pp.342-353
    • /
    • 2019
  • Purpose: The Dietary Reference Intakes for Koreans (KDRIs) suggest that the goal for the intake of sodium should be less than 2,000 mg, which is thought to be infeasible to achieve when eating the typical Korean diet. This study aimed to obtain the new intake goals for sodium with improved feasibility to achieve, and also to design optimized food intake patterns for Korean adults by performing linear programming. Methods: The data from a one day 24-hour dietary recall of the 2010 ~ 2014 Korea National Health and Nutrition Survey were used to quantify food items that Korean adults usually consumed. These food items were categorized into seven groups and 24 subgroups. The mean intakes and intake distributions of the food groups and the food subgroups were calculated for eight age (19 ~ 29, 30 ~ 49, 50 ~ 64, and over 65 years old) and gender (male and female) groups. A linear programming model was constructed to minimize the difference between the optimized intakes and the mean intakes of the food subgroups while meeting KDRIs for energy and 13 nutrients, and not exceeding the typical quantities of each of the food subgroups consumed by the respective age and gender groups. As an initial solution of the linear programming, the optimized intake of seasonings, including salt, was calculated as 0 g for all the age and gender groups when the sodium constraint was inserted not to exceed 2,000 mg. Therefore, the sodium constraint was progressively increased by 100 mg until the optimized intake of seasoning was obtained as the values closest to the $25^{th}$ percentile of the intake distribution of seasonings for the respective age and gender groups. Results: The optimized food intake patterns were mathematically obtained by performing linear programming when the sodium constraint values were 3,600 mg, 4,500 mg, 4,200 mg, 3,400 mg, 2,800 mg, 3,100 mg, 3,100 mg, and 2,500 mg for the eight age and gender groups. Conclusion: The optimized food intake patterns for Korean adults were designed by performing linear programming after increasing the sodium constraint values from 2,000 mg to 2500 ~ 4,500 mg according to the age and gender groups. The resulting patterns suggest that current diets should be modified to increase the intake of vegetables for all the groups, milk/dairy products for the female groups, and fruits for the female groups except for the females aged 50 ~ 64 years.

Deriving Robust Reservoir Operation Policy under Changing Climate: Use of Robust Optimiziation with Stochastic Dynamic Programming

  • Kim, Gi Joo;Kim, Young-Oh
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2020.06a
    • /
    • pp.171-171
    • /
    • 2020
  • Decision making strategies should consider both adaptiveness and robustness in order to deal with two main characteristics of climate change: non-stationarity and deep uncertainty. Especially, robust strategies are different from traditional optimal strategies in the sense that they are satisfactory over a wider range of uncertainty and may act as a key when confronting climate change. In this study, a new framework named Robust Stochastic Dynamic Programming (R-SDP) is proposed, which couples previously developed robust optimization (RO) into the objective function and constraint of SDP. Two main approaches of RO, feasibility robustness and solution robustness, are considered in the optimization algorithm and consequently, three models to be tested are developed: conventional-SDP (CSDP), R-SDP-Feasibility (RSDP-F), and R-SDP-Solution (RSDP-S). The developed models were used to derive optimal monthly release rules in a single reservoir, and multiple simulations of the derived monthly policy under inflow scenarios with varying mean and standard deviations are undergone. Simulation results were then evaluated with a wide range of evaluation metrics from reliability, resiliency, vulnerability to additional robustness measures. Evaluation results were finally visualized with advanced visualization tools that are used in multi-objective robust decision making (MORDM) framework. As a result, RSDP-F and RSDP-S models yielded more risk averse, or conservative, results than the CSDP model, and a trade-off relationship between traditional and robustness metrics was discovered.

  • PDF

A Study on Higher Level Representations of Network Models for Optical Fiber Telecommunication Networks Design (광통신망 설계를 위한 네트워크 모형의 상위수준 표현에 관한 연구)

  • Kim, Cheol-Su
    • Asia pacific journal of information systems
    • /
    • v.6 no.2
    • /
    • pp.125-148
    • /
    • 1996
  • This paper is primarily focused on the function of model management systems such as higher level representations and buildings of optimization models using them, especially in the area of the telecommunication network models. This research attempts to provide the model builders an intuitive language-namely higher level representation-using five distinctivenesses : Objective, Node, Link, Topological Constraint including five components, and Decision. The paper elaborates all components included in each of distinctivenesses extracted from structural characteristics of typical telecommunication network models. Higher level representations represented with five distinctivenesses should be converted into base level representations which are employed for semantic representations of linear and integer programming problems in knowledge: assisted optimization modeling system(UNIK-OPT). Furthermore, for formulating the network model using higher level representations, the reasoning process is proposed. A system called UNIK-NET is developed to implement the approach proposed in this research, and the system is illustrated with an example of the network model.

  • PDF

Reliability Evaluation of a Microgrid Considering Its Operating Condition

  • Xu, Xufeng;Mitra, Joydeep;Wang, Tingting;Mu, Longhua
    • Journal of Electrical Engineering and Technology
    • /
    • v.11 no.1
    • /
    • pp.47-54
    • /
    • 2016
  • Microgrids offer several reliability benefits, such as the improvement of load-point reliability and the opportunity for reliability-differentiated services. The primary goal of this work is to investigate the impacts of operating condition on the reliability index for microgrid system. It relies on a component failure rate model which quantifies the relationship between component failure rate and state variables. Some parameters involved are characterized by subjective uncertainty. Thus, fuzzy numbers are introduced to represent such parameters, and an optimization model based on Fuzzy Chance Constrained Programming (FCCP) is established for reliability index calculation. In addition, we present a hybrid algorithm which combines scenario enumeration and fuzzy simulation as a solution tool. The simulations in a microgrid test system show that reliability indices without considering operating condition can often prove to be optimistic. We also investigate two groups of situations, which include the different penetration levels of microsource and different confidence levels. The results support the necessity of considering operating condition for achieving accurate reliability evaluation.