• 제목/요약/키워드: Linear programming problem

검색결과 577건 처리시간 0.028초

Development of PC-based PVC scheduling system connected with ERP system

  • Kang, Min-Gu;Kang, Soo-Kil;Lee, Ho-Kyung;Park, Sun-Won
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2004년도 ICCAS
    • /
    • pp.945-949
    • /
    • 2004
  • These days there are so many scheduling systems or softwares. But only few scheduling systems have succeeded in the market. In spite of powerful engine and functions, those systems have difficulties to be applied in real processes. In real processes, there are various constraints caused by physical or systematical environments of plants. Those constraints are too many to be handled in the system. This problem makes it difficult for the system to represent the details of processes. In order to resolve this problem, we have developed a specialized scheduling system for a target process. The system could be developed by the experts for target process and researchers for scheduling. In this study, a scheduling system for PVC process has been developed as an MILP (Mixed integer linear programming) model and coded in $Fortran^{TM}$. The scheduling system has been applied to two processes, which have different characteristics. Simulation results indicate that the profit of the target process can be increased by about 5% by implementing the scheduling system.

  • PDF

AN LMI APPROACH TO AUTOMATIC LOOP-SHAPING OF QFT CONTROLLERS

  • Bokharaie, Vaheed S.;Khaki-Sedigh, Ali
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2003년도 ICCAS
    • /
    • pp.433-437
    • /
    • 2003
  • Quantitative Feedback Theory (QFT) is one of effective methods of robust controller design. In QFT design we can considers the phase information of the perturbed plant so it is less conservative than $H_{\infty}$ and ${\mu}$-synthesis methods and as be shown, it is more transparent than the sensitivity reduction methods mentioned . In this paper we want to overcome the major drawback of QFT method which is lack of an automatic method for loop-shaping step of the method so we focus on the following problem: Given a nominal plant and QFT bounds, synthesize a controller that achieves closed-loop stability and satisfies the QFT boundaries. The usual approach to this problem involves loop-shaping in the frequency domain by manipulating the poles and zeros of the nominal loop transfer function. This process now aided by recently developed computer aided design tools proceeds by trial and error and its success often depends heavily on the experience of the loop-shaper. Thus for the novice and First time QFT user, there is a genuine need for an automatic loop-shaping tool to generate a first-cut solution. Clearly such an automatic process must involve some sort of optimization, and while recent results on convex optimization have found fruitful applications in other areas of control theory we have tried to use LMI theory for automating the loop-shaping step of QFT design.

  • PDF

EBA 모형을 활용한 유사 컨조인트 분석 (Conjoint-like Analysis Using Elimination-by-Aspects Model)

  • 박상준
    • 경영과학
    • /
    • 제25권1호
    • /
    • pp.139-147
    • /
    • 2008
  • Conjoint Analysis is marketers' favorite methodology for finding out how buyers make trade-offs among competing products and suppliers. Thousands of applications of conjoint analysis have been carried out over the past three decades. The conjoint analysis has been so popular as a management decision tool due to the availability of a choice simulator. A conjoint simulator enables managers to perform 'what if' question accompanying the output of a conjoint study. Traditionally the First Choice Model (FCM) has been widely used as a choice simulator. The FCM is simple to do, easy to understand. In the FCM, the probability of an alternative is zero until its value is greater than others in the set. Once its value exceeds that threshold, however, it receives 100%. The LOGIT simulation model, which is also called as "Share of Preference", has been used commonly as an alternative of the FCM. In the model part worth utilities aren't required to be positive. Besides, it doesn't require part worth utilities computed under LOGIT model. The simulator can be used based on regression, monotone regression, linear programming, and so on. However, it is not free from the Independent from Irrelevant Alternatives (IIA) problem. This paper proposes the EBA (Elimination-By-Aspects) model as a useful conjoint-like method. One advantage of the EBA model is that it models choice in terms of the actual psychological processes that might be taking place. According to EBA, when choosing from choice objects, a person chooses one of the aspects that are effective for the objects and eliminates all objects which do not have this aspect. This process continues until only one alternative remains.

Optimal management of multi-airport opening non-real time network system

  • ;허희영
    • 한국항공운항학회:학술대회논문집
    • /
    • 한국항공운항학회 2016년도 춘계학술대회
    • /
    • pp.269-275
    • /
    • 2016
  • This paper considers the arrival, airport and departure capacity as a whole, through which, the network effect between airports is fully emphasized, the flight action is coordinated, and the flight demand pattern is reasonably assigned. The optimization problem of flight queues in multi-airport is studied in detail; the mathematical model of multi-airport opening non-real time flow management in terminal area is established, and related problems such as the parameters, the simplification and the solving of the model are discussed in detail to some extent. Appropriate decision making variables are taken to make the multi-airport network system linear 0-1 integer programming model, thus, the solving of the model is available and the central flow management is realized. The heuristic implicit enumeration presented in this paper can effectively solve this kind of problems. Through the simulation of some airports network system, we not only validate the algorithm presented in this paper, but also give a deep analysis of the results, which would produce reference for later practicable use. The simulation proves that this algorithm offers a good way to settle the problem of multi-airport flight queue optimization in air traffic management automation system in terminal area.

  • PDF

평균 샘플 수 최소화를 통한 계량형 반복 샘플링 검사의 설계 (A Variables Repetitive Group Sampling Plan for Minimizing Average Sample Number)

  • 박희곤;문영건;전치혁;;이재욱
    • 대한산업공학회지
    • /
    • 제30권3호
    • /
    • pp.205-212
    • /
    • 2004
  • This paper proposes the variables repetitive group sampling plan where the quality characteristic following normal distribution has upper or lower specification limit. The problem is formulated as a non-linear programming problem where the objective function to minimize is the average sample number and the constraints are related to lot acceptance probabilities at acceptable quality level (AQL) and limiting quality level (LQL) under the operating characteristic curve. Sampling plan tables are constructed for the selection of parameters indexed by AQL and LQL in the cases of known standard deviation and unknown standard deviation. It is shown that the proposed sampling plan significantly reduces the average sample number as compared with the single or the double sampling plan.

아웃소싱을 고려한 병렬기계 일정계획 연구 (A Parallel Machine Scheduling Problem with Outsourcing Options)

  • 이익선;윤상흠
    • 산업경영시스템학회지
    • /
    • 제31권3호
    • /
    • pp.101-109
    • /
    • 2008
  • This paper considers an integrated decision for scheduling and outsourcing(or, subcontracting) of a finite number of jobs(or, orders) in a time-sensitive make-to-order manufacturing environment. The jobs can be either processed in a parallel in-house facilities or outsourced to subcontractors. We should determine which jobs should be processed in-house and which jobs should be outsourced. And, we should determine the schedule for the jobs to be processed in-house. If a job is determined to be processed in-house, then the scheduling cost(the completion time of the Job) is imposed. Otherwise(if the job should be outsourced), then an additional outsourcing cost is imposed. The objective is to minimize the linear combination of scheduling and outsourcing costs under a budget constraint for the total available outsourcing cost. In the problem analysis, we first characterize some solution properties and then derive dynamic programming and branch-and- bound algorithms. An efficient heuristic is also developed. The performances of the proposed algorithms are evaluated through various numerical experiments.

컨베이어 추적을 위한 로보트 매니퓰레이터의 동적계획 (Motion Planning of a Robot Manipulator for Conveyor Tracking)

  • 박태형;이범희;고명삼
    • 대한전기학회논문지
    • /
    • 제38권12호
    • /
    • pp.995-1006
    • /
    • 1989
  • 로보트 매니퓰레이터가 컨베이어 상의 파트를 추적 하면서 작업을 수행하는 것은 작업 효율의 증가에 크게 기여한다. 본 논문은 컨베이어 상의 파트를 추적하기 위한 로보트 매니퓰레이터의 동작계획 알고리즘을 제안한다. 로보트 매니퓰레이터의 추적 동작은 밸트의 속도, 추적 시작 시간에서의 파트와 로보트 핸드의 위체이 의하여 결정된다. 이때 토크 및 관절 속도, 관절 가속도, 관절 저크의 제한범위가 모두 고려되며, 최소의 정착시간을 갖는 추적 궤적이 생성된다. 추적 해는 linearr quadratic tracking문제로 접근하여 구한다. 로보트매니퓰레이터의 동적 방정식은 파라메터의 함수 성능 지수를 최소화 하는 동적 방정식의 해는 동적 계획법에 의하여 구한다. ${\mu}-VAX_@$에 의한 시뮬레이션 결과를 제시한다.

유한차분법과 ADS(Automated Design Synthesis)를 이용한 광픽업 액추에이터의 동특성 개선 (Improvement of Dynamic Characteristics for Optical Pickup Actuator using Finite Difference Scheme and Automated Design Synthesis)

  • 정기원;이진우;이동주;박노철;박영필
    • 대한기계학회논문집A
    • /
    • 제27권12호
    • /
    • pp.1997-2003
    • /
    • 2003
  • Recently, there have been many researches and developments in optical disc drive by high density of track and high access speed. Therefore, the optical pick-up should guarantee highly accurate dynamic characteristics for the wide bandwidth in order to cope with this trend. These demands for optical pick-up actuator can be solved by improvements of lens-holder through the following methods. The first way is the analysis of the sensitivity matrix of design variables for vibration modes after appropriate design parameters are selected like shapes and local dimensions of a lens-holder. The second way is the optimization of design variables by calculating sequential linear programming after the problem of extending bandwidth are converted to problem of minimizing adequate objective function. In the result, modified FE model is obtained through several iterations by finite difference scheme(FDS). While results of the first way show better convergence of the target frequency, the second result shows better reduction of mass increase.

Output-error state-space identification of vibrating structures using evolution strategies: a benchmark study

  • Dertimanis, Vasilis K.
    • Smart Structures and Systems
    • /
    • 제14권1호
    • /
    • pp.17-37
    • /
    • 2014
  • In this study, four widely accepted and used variants of Evolution Strategies (ES) are adapted and applied to the output-error state-space identification problem. The selection of ES is justified by prior strong indication of superior performance to similar problems, over alternatives like Genetic Algorithms (GA) or Evolutionary Programming (EP). The ES variants that are being tested are (i) the (1+1)-ES, (ii) the $({\mu}/{\rho}+{\lambda})-{\sigma}$-SA-ES, (iii) the $({\mu}_I,{\lambda})-{\sigma}$-SA-ES, and (iv) the (${\mu}_w,{\lambda}$)-CMA-ES. The study is based on a six-degree-of-freedom (DOF) structural model of a shear building that is characterized by light damping (up to 5%). The envisaged analysis is taking place through Monte Carlo experiments under two different excitation types (stationary / non-stationary) and the applied ES are assessed in terms of (i) accurate modal parameters extraction, (ii) statistical consistency, (iii) performance under noise-corrupted data, and (iv) performance under non-stationary data. The results of this suggest that ES are indeed competitive alternatives in the non-linear state-space estimation problem and deserve further attention.

화물의 인도시기를 최우선으로 하는 배선문제 (Optimum Allocation of Ships Emphasizing the Cargo Delivery Time)

  • 이중우;양시권;이철영
    • 한국항해학회지
    • /
    • 제5권1호
    • /
    • pp.1-23
    • /
    • 1981
  • As far as transportation problems are concerned, the minimization of transportation cost is the most prevailing object. But in some cases, the cargo delivery time is the utter problem rather than the cost. For instance, we may imagine the case that the delivery of the construction materials is delayed behind the schedule and this makes the construction cost increased because of idle time of other materials and man power, in addition to the indemnity. Therefore the allocation of ships, in marine transportation which is now the main route of overseas trade, to the needed area on the required time is to be appropriately performed. However, there are several restrictions for cargo delivery to meet the demand, such as ship's size, number to be employed and cargo handling capacity of the ports, etc. And there are some other factors to be considered, that is, the degree of necessities of commodities, on their kinds, amount, and the time of arrival, etc. This paper deals with the problem of optimum allocation of ships emphasizing the cargo delivery time adopting Linear Programming technique with those cargo delivery restrictions and factors transformed by introducing the multi-speed conception, the conversion of multi-commodity to a single commodity, allowable delivery time, weight penalty number and nominating priority. This paper presents a case of optimum allocation of ships in the light of cargo delivery time for a construction company which has two different construction places and analyzes the result. This study will give a planner a good tool for optimum planning of maring transportation and be used for decision of schemes.

  • PDF