• 제목/요약/키워드: large-scale problem

검색결과 950건 처리시간 0.024초

An Integer Programming Model for a Complex University Timetabling Problem: A Case Study

  • Prabodanie, R.A. Ranga
    • Industrial Engineering and Management Systems
    • /
    • 제16권1호
    • /
    • pp.141-153
    • /
    • 2017
  • A binary integer programming model is proposed for a complex timetabling problem in a university faculty which conducts various degree programs. The decision variables are defined with fewer dimensions to economize the model size of large scale problems and to improve modeling efficiency. Binary matrices are used to incorporate the relationships between the courses and students, and the courses and teachers. The model includes generally applicable constraints such as completeness, uniqueness, and consecutiveness; and case specific constraints. The model was coded and solved using Open Solver which is an open-source optimizer available as an Excel add-in. The results indicate that complicated timetabling problems with large numbers of courses and student groups can be formulated more efficiently with fewer numbers of variables and constraints using the proposed modeling framework. The model could effectively generate timetables with a significantly lower number of work hours per week compared to currently used timetables. The model results indicate that the particular timetabling problem is bounded by the student overlaps, and both human and physical resource constraints are insignificant.

ADMM for least square problems with pairwise-difference penalties for coefficient grouping

  • Park, Soohee;Shin, Seung Jun
    • Communications for Statistical Applications and Methods
    • /
    • 제29권4호
    • /
    • pp.441-451
    • /
    • 2022
  • In the era of bigdata, scalability is a crucial issue in learning models. Among many others, the Alternating Direction of Multipliers (ADMM, Boyd et al., 2011) algorithm has gained great popularity in solving large-scale problems efficiently. In this article, we propose applying the ADMM algorithm to solve the least square problem penalized by the pairwise-difference penalty, frequently used to identify group structures among coefficients. ADMM algorithm enables us to solve the high-dimensional problem efficiently in a unified fashion and thus allows us to employ several different types of penalty functions such as LASSO, Elastic Net, SCAD, and MCP for the penalized problem. Additionally, the ADMM algorithm naturally extends the algorithm to distributed computation and real-time updates, both desirable when dealing with large amounts of data.

행렬 부호 함수를 이용한 대규모 선형 시불변 계통의 준최적 합성 제어기의 설계에 관한 연구 (On the near optimal composite regulator problem for the large scale linear time invariant system using matrix sign function)

  • 천희영;박귀택;이동기
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1986년도 한국자동제어학술회의논문집; 한국과학기술대학, 충남; 17-18 Oct. 1986
    • /
    • pp.566-570
    • /
    • 1986
  • 본 논문의 목적은 대규모 선형 시불변 계통에 대한 합성 제어기의 설계에 관한 새로운 방법을 제시하기 위한 것이다. 주어진 계통을 행렬 부호 함수를 이용하여 그 고유치의 크기에 따라 블럭 대각 분해하고 각부 계통에 대한 최적 제어기 및 전체계통에 대한 준최적 합성 제어기를 설계한다. 이 방법은 주어진 계통의 고유치를 미리 알 필요가 없으며 계통의 블력 분해 과정에서 Riccati 방정식및 Lyapunov 방정식의 해를 구할 필요가 없고 특이섭등 기법이나 Two time scale seperation 방법에서의 제약조건에 관계없이 광범위하게 적용되는 장점이 있다.

  • PDF

구조물 최적화를 위한 선형화 기법 (Application of linearization method for large-scale structure optimizations)

  • 이희각
    • 전산구조공학
    • /
    • 제1권1호
    • /
    • pp.87-94
    • /
    • 1988
  • 반복 비선형 계획법의 하나인 선형화 기법을 절대수렴의 전제아래 합성 구조물의 최적 설계에 응용한다. 선형화 기법은 설계문제의 제약조건을 선형화된 등가 제약조건으로 변형시키며 active-set 정책을 구사한다. 결과, 매 설계단계에서 풀어야 할 상태 및 수반 방정식의 수를 줄임으로써 실질적인 계산의 절감을 기한다. 기둥으로 받쳐진 판-보 구조물은 최적화 기법의 능력을 시험키 위한 합성구조물의 좋은 예로서, 설계결과 선형화 기법은 만족할만한 수렴치로써 최적해를 산출함을 알 수 있고 나아가 이 방법은 모든 종류의 최적화 문제에 적용될 수 있을 것으로 보인다.

  • PDF

국소교란이 가해지는 박리기포의 대형구조 (Large-Scale Structure of Leading-Edge Separation Bbubble with Local Forcing)

  • 김유익;성형진
    • 대한기계학회논문집
    • /
    • 제19권4호
    • /
    • pp.1134-1147
    • /
    • 1995
  • POD (proper orthogonal decomposition) is applied to turbulent leading-edge separation bubble to extract coherent structures. A two-dimensional leading-edge separation bubble is simulated by discrete-vortex method, where a time-dependent source forcing is incorporated. Based on the wealth of numerical data, POD is applied in a range of the forcing amplitude ( $A_{o}$ = 0, 0.5, 1.0 and 1.5) and forcing frequency (0 .leq. $f_{F}$H/ $U_{\infty}$.leq. 0.3). It is demonstrated that the structures of POD have noticeable changes with local forcings. In an effort to investigate the mechanism of decreasing reattachment length, dynamic behaviors of the expansion coefficients and contributions of the eigenfunctions of POD are scrutinized. As the forcing amplitude increases, the large-scale vortex structures are formed near the forcing amplitude increases, the large-scale vortex structures are formed near the separation point and the flow structures become more organized and more regular, accompanying with the reduction of reattachment length. By further inverstigation of POD global entropy, it is seen that the reattachment length is closely linked to the degree of organization of the flow structures.es.s.

대규모 T-S 퍼지 시스템의 H- 고장검출을 위한 관측기 설계 (Observer Design for H- Fault Detection of Large Scale T-S Fuzzy Systems)

  • 지성철;이호재;주영훈;김도완
    • 한국지능시스템학회논문지
    • /
    • 제20권1호
    • /
    • pp.15-20
    • /
    • 2010
  • 본 논문은 대규모 연속시간 T-S (Takagi-Sugeno) 퍼지 시스템의 고장검출을 위한 관측기 설계 문제를 논의한다. 관측기의 출력신호로부터 고장 여부를 판단하기 위해서 관측기는 고장신호에 가능한 민감해야하며 이를 위해 $\mathfrak{H}_-$ 성능지수를 도입한다. 설계 조건은 선형행렬부등식으로 표현되며 수치적 예제로부터 그 효용성을 확인한다.

외연 Lagrangian 유한요소법 기반의 대규모 유한요소 모델 병렬처리 (Parallel Computing of Large Scale FE Model based on Explicit Lagrangian FEM)

  • 백승훈;김승조;이민형
    • 한국항공우주학회지
    • /
    • 제34권8호
    • /
    • pp.33-40
    • /
    • 2006
  • 비선형 외연 유한요소법에서 유한요소 병렬 처리 방안을 기술하고 코드에 구현하였다. 성능테스트 장비로 자체 구축한 520 개의 CPU를 갖는 리눅스 클러스터 슈퍼컴퓨터를 사용하였다. 대규모 모델 테스트 결과 256 개의 CPU 까지도 거의 이상적인 속도 증가를 보였다. 유한요소 계산시간 대비 통신시간 계산이 전체 성능에 미치는 영향도 검토하였다. 사용 프로세서가 증가할수록 상용코드의 병렬 성능 대비 더 좋은 성능을 보이는 것으로 나타났다.

Interference-free Clustering Protocol for Large-Scale and Dense Wireless Sensor Networks

  • Chen, Zhihong;Lin, Hai;Wang, Lusheng;Zhao, Bo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권3호
    • /
    • pp.1238-1259
    • /
    • 2019
  • Saving energy is a big challenge for Wireless Sensor Networks (WSNs), which becomes even more critical in large-scale WSNs. Most energy waste is communication related, such as collision, overhearing and idle listening, so the schedule-based access which can avoid these wastes is preferred for WSNs. On the other hand, clustering technique is considered as the most promising solution for topology management in WSNs. Hence, providing interference-free clustering is vital for WSNs, especially for large-scale WSNs. However, schedule management in cluster-based networks is never a trivial work, since it requires inter-cluster cooperation. In this paper, we propose a clustering method, called Interference-Free Clustering Protocol (IFCP), to partition a WSN into interference-free clusters, making timeslot management much easier to achieve. Moreover, we model the clustering problem as a multi-objective optimization issue and use non-dominated sorting genetic algorithm II to solve it. Our proposal is finally compared with two adaptive clustering methods, HEED-CSMA and HEED-BMA, demonstrating that it achieves the good performance in terms of delay, packet delivery ratio, and energy consumption.