• 제목/요약/키워드: complex problem-solving

검색결과 272건 처리시간 0.023초

A NON-RECURSIVE APPROACH TO NEVANLINNA-PICK INTERPOLATION PROBLEM

  • Kim, Jeongook
    • 호남수학학술지
    • /
    • 제41권4호
    • /
    • pp.823-835
    • /
    • 2019
  • A solution for Nevanlinna-Pick interpolation problem with low complexity is constructed via non-recursive method. More precisely, a stable rational function satifying the given interpolation data in the complex right half plane is found by solving a homogeneous interpolation problem related to a minial interpolation problem for the given data in the right half plane together with its mirror-image data.

Constraint Programming을 이용한 자원제약 동적 다중프로젝트 일정계획 (Resource Constrained Dynamic Multi-Projects Scheduling Based by Constraint Programming)

  • 이화기;정제원
    • 산업공학
    • /
    • 제12권3호
    • /
    • pp.362-373
    • /
    • 1999
  • Resource Constrained Dynamic Multi-Projects Scheduling (RCDMPS) is intended to schedule activities of two or more projects sequentially arriving at die shop under restricted resources. The aim of this paper is to develop a new problem solving method for RCDMPS to make an effect schedule based by constraint programming. The constraint-based scheduling method employs ILOG Solver which is C++ constraint reasoning library for solving complex resource management problems and ILOG Schedule which is a add-on library to ILOG Solver dedicated to solving scheduling problems. And this method interfaces with ILOG Views so that the result of scheduling displays with Gantt chart. The scheduling method suggested in this paper was applied to a company scheduling problem and compared with the other heuristic methods, and then it shows that the new scheduling system has more preference.

  • PDF

스크래치를 이용한 문제해결 프로그래밍에서 CT-TDPS 학습 모형의 효과성 연구 (A Study on the Effectiveness of CT-TDPS Learning Model in Problem Solving Programming using Scratch)

  • 김영직;김성식
    • 컴퓨터교육학회논문지
    • /
    • 제23권3호
    • /
    • pp.41-47
    • /
    • 2020
  • 21세기 미래 인재에게 필요한 핵심 역량으로 컴퓨팅 사고력이 주목받고 있다. 국내외적으로 컴퓨팅 사고력 향상을 위한 소프트웨어 교육이 한창이다. 그중에서 문제해결 프로그래밍 교육은 컴퓨팅 사고력 향상에 도움이 된다. CT-TDPS 학습 모형은 복잡한 문제들을 모듈화하는 분해, 추상화 사고 과정과 이를 구현하는 반복적·점증적 프로그래밍 방식인 애자일(Agile) 개발 방식을 따른다. 본 연구에서는 스크래치를 이용한 문제해결 프로그래밍 교육에 CT-TDPS 학습 모형을 적용하여 컴퓨팅 사고력 향상을 확인하고자 하였다. 연구 결과, CT-TDPS 학습 모형을 적용한 문제해결 프로그래밍 교육에서 컴퓨팅 사고력의 하위 요인인 컴퓨팅 개념, 컴퓨팅 수행, 컴퓨팅 관점에서 모두 향상이 되었음을 확인할 수 있었다. 그리고, Dr.Scratch 자동 평가 결과에 대한 t 검정 결과 실험집단에서 유의한 차이가 있음을 확인하였다.

전략적 의사결정을 위한 SDSS 프레임웍에 관한 연구: 프로세스와 기법을 중심으로 (A Study on the Framework of SDSS for Strategic Decision)

  • 김상수;이재원;윤상웅
    • 경영정보학연구
    • /
    • 제9권3호
    • /
    • pp.45-65
    • /
    • 2007
  • 경영 환경이 급격하게 변화함에 따라서 전략적 의사결정의 중요성이 커지고 있고, 효과적인 전략적 의사결정 지원 시스템을 개발하기 위해서는 체계적인 전략적 의사결정 프로세스 개발, 효과적인 문제 해결 기법, 편리한 IT 도구가 필요하다. 본 연구에서는 전략적 의사결정 프로세스를 개발하고, 문제해결 기법을 분류하고, 이를 기반으로 기법 추천 시스템을 개발하였다. 이를 기반으로 한 SDSS 프레임웍은 기업의 전략적 의사결정을 지원하기 위한 SDSS 개발에 많은 도움을 줄 것으로 기대된다.

Instability of (Heterogeneous) Euler beam: Deterministic vs. stochastic reduced model approach

  • Ibrahimbegovic, Adnan;Mejia-Nava, Rosa Adela;Hajdo, Emina;Limnios, Nikolaos
    • Coupled systems mechanics
    • /
    • 제11권2호
    • /
    • pp.167-198
    • /
    • 2022
  • In this paper we deal with classical instability problems of heterogeneous Euler beam under conservative loading. It is chosen as the model problem to systematically present several possible solution methods from simplest deterministic to more complex stochastic approach, both of which that can handle more complex engineering problems. We first present classical analytic solution along with rigorous definition of the classical Euler buckling problem starting from homogeneous beam with either simplified linearized theory or the most general geometrically exact beam theory. We then present the numerical solution to this problem by using reduced model constructed by discrete approximation based upon the weak form of the instability problem featuring von Karman (virtual) strain combined with the finite element method. We explain how such numerical approach can easily be adapted to solving instability problems much more complex than classical Euler's beam and in particular for heterogeneous beam, where analytic solution is not readily available. We finally present the stochastic approach making use of the Duffing oscillator, as the corresponding reduced model for heterogeneous Euler's beam within the dynamics framework. We show that such an approach allows computing probability density function quantifying all possible solutions to this instability problem. We conclude that increased computational cost of the stochastic framework is more than compensated by its ability to take into account beam material heterogeneities described in terms of fast oscillating stochastic process, which is typical of time evolution of internal variables describing plasticity and damage.

Using Fuzzy Set Theory in Project Planning Problem

  • Park, Seung-Hun;Chang, In seong
    • 한국경영과학회지
    • /
    • 제20권1호
    • /
    • pp.131-145
    • /
    • 1995
  • This paper presents a method for solving project planning problem which the opinions of experts greatly disagree in each activity processing time. Triangular fuzzy numbers (TFNs) are used to represent activity times of experts. And we introduce a pessimistic project planning with major TFNs and an optimistic project planning with minor. TFNs, and illustrate the approach using a combination of the existing composite and the comparison methods, which is used to solve the complex project planning problem.

  • PDF

A study on the column subtraction method applied to ship scheduling problem

  • Hwang, Hee-Su;Lee, Hee-Yong;Kim, Si-Hwa
    • 한국항해항만학회:학술대회논문집
    • /
    • 한국항해항만학회 2004년도 춘계학술대회 논문집
    • /
    • pp.401-405
    • /
    • 2004
  • Column subtraction, originally proposed by Harche and Thompson(]994), is an exact method for solving large set covering, packing and partitioning problems. Since the constraint set of ship scheduling problem(SSP) have a special structure, most instances of SSP can be solved by LP relaxation. This paper aims at applying the column subtraction method to solve SSP which can not be solved by LP relaxation. For remained instances of unsolvable ones, we subtract columns from the finale simplex table to get another integer solution in an iterative manner. Computational results having up to 10,000 0-1 variables show better performance of the column subtraction method solving the remained instances of SSP than complex branch-and-bound algorithm by LINDO.

  • PDF

유연생산셀의 지능형 스케쥴링을 위한 전문가 시스템 (An expert system for intelligent scheduling in flexible manufacturing cell)

  • 전병선;박승규;이노성;안인석;서기성;이동헌;우광방
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국내학술편); Seoul National University, Seoul; 20-22 Oct. 1993
    • /
    • pp.1111-1116
    • /
    • 1993
  • In this study, we discuss the design of the expert system for the scheduling of the FMC(Flexible Manufacturing Cell) consisting of the several versatile machines. Due to the NP property, the scheduling problem of several machine FMC is very complex task. Thus we proposed the two heuritstic shceduling algorithms for solving the problem and constituted the algorithm based of solving the problem and constituted the algorithm base of ISS(Intelligent Scheduling System) using them. By the rules in the rule base, the best alternative among various algorithms in algorithm base is selected and applied in controlling the FMC. To show the efficiency of ISS, the scheduling output of ISS and the existent dynamic dispatching rule were tested and compared. The results indicate that the ISS is superior to the existent dynamic dispatching rules in various performance indexes.

  • PDF

A study on the column subtraction method applied to ship scheduling problem

  • Hwang, Hee-Su;Lee, Hee-Yong;Kim, Si-Hwa
    • 한국항해항만학회지
    • /
    • 제28권2호
    • /
    • pp.129-133
    • /
    • 2004
  • Column subtraction, originally proposed by Harche and Thompson(1994), is an exact method for solving large set covering, packing and partitioning problems. Since the constraint set of ship scheduling problem(SSP) have a special structure, most instances of SSP can be solved by LP relaxation This paper aim, at applying the column subtraction method to solve SSP which am not be solved by LP relaxation For remained instances of unsolvable ones, we subtract columns from the finale simplex table to get another integer solution in an iterative manner. Computational results having up to 10,000 0-1 variables show better performance of the column subtraction method solving the remained instances of SSP than complex branch and-bound algorithm by LINDO.

수학 문장제의 명사화 여부에 따른 초등학교 3학년의 해결 과정 분석 (Analysis of the 3rd Graders' Solving Processes of the Word Problems by Nominalization)

  • 강윤지;장혜원
    • 한국수학교육학회지시리즈C:초등수학교육
    • /
    • 제26권2호
    • /
    • pp.83-97
    • /
    • 2023
  • 명사화는 문법적 은유 중 하나로, 수식으로 변환해야 하는 대상의 수학화를 용이하게 한다는 장점과 함께 복잡하고 압축된 문장 구성으로 인해 문장 이해를 어렵게 할 가능성이 있다는 단점이 있다. 이러한 명사화가 실제 학생들의 문장제 해결 과정에 어떠한 영향을 미치는지 파악하기 위하여 초등학교 3학년을 대상으로 명사화 여부에 따른 사칙연산 문장제 8개를 제공하여 검사를 실시하였다. 분석 결과, 문장제의 명사화 여부는 문제 이해 및 수식화 가능 여부에 의미 있는 영향을 미치지 못하였다. 그러나, 검사에 참여한 학생에게 명사화에 대한 사전 경험이 없음에도 불구하고 문제 이해 단계에서 명사화 또는 탈명사화가 나타나는 것을 확인하였으며, 명사화의 유형 변화가 발생하는 경우 성공 비율이 높게 나타나는 등 수식화 단계를 용이하게 하였다. 이를 통하여 명사화가 문장제의 문제 이해 및 수식화 단계에서 교수학적 전략으로 활용될 수 있으며 문장제의 학습에서 더 깊이 있는 이해를 유도할 수 있을 것으로 기대할 수 있다.