• 한국컴퓨터정보학회논문지
• /
• 제24권9호
• /
• pp.9-20
• /
• 2019

In this paper, we study the university timetabling problem, which consists of two subproblems, the university course timetabling problem and the examination timetabling problem. Given a set of classrooms, students, teachers, and lectures, the problem is to assign a number of courses (and examinations) to suitable timeslots and classrooms while satisfying the given set of constraints. We discuss the modeling and solution approaches to construct course and examination timetables for one of the largest Korean university. By using binary integer programming formulations, we describe these two complex real-world problems. Then, we propose a solution method, called NOGOOD, to solve the examination timetabling model. The computation results show that NOGOOD finds the optimal examination schedule for the given instance. Although we consider a specific instance of the university timetabling problem, the methods we use can be applicable to modeling and solving other timetabling problems.

• Management Science and Financial Engineering
• /
• 제13권2호
• /
• pp.1-27
• /
• 2007

This paper presents a fuzzy-goal programming(FGP) approach for Bi-Level Linear Multiple Objective Decision Making(BLL-MODM) problem in a large hierarchical decision making and planning organization. The proposed approach combines the attractive features of both fuzzy set theory and goal programming(GP) for MODM problem. The GP problem has been developed by fixing the weights and aspiration levels for generating pareto-optimal(satisfactory) solution at each level for BLL-MODM problem. The higher level decision maker(HLDM) provides the preferred values of decision vector under his control and bounds of his objective function to direct the lower level decision maker(LLDM) to search for his solution in the right direction. Illustrative numerical example is provided to demonstrate the proposed approach.

• Journal of Electrical Engineering and Technology
• /
• 제7권2호
• /
• pp.151-156
• /
• 2012

The current study presents a zero-one integer programming approach to determine the minimum break point set for the coordination of directional relays. First, the network is reduced if there are any parallel lines or three-end nodes. Second, all the directed loops are enumerated to reduce the iteration. Finally, the problem is formulated as a set-covering problem, and the break point set is determined using the zero-one integer programming technique. Arbitrary starting relay locations and the arbitrary consideration of relay sequence to set and coordinate relays result in navigating the loops many times and futile attempts to achieve system-wide relay coordination. These algorithms are compared with the existing methods, and the results are presented. The problem is formulated as a setcovering problem solved by the zero-one integer programming approach using LINGO 12, an optimization modeling software.

• 한국콘텐츠학회논문지
• /
• 제10권11호
• /
• pp.468-475
• /
• 2010

본 논문은 웹 2.0을 활용한 로봇프로그래밍 교육이 학습자의 문제해결력에 미치는 영향에 대하여 알아 보았다. 이를 위해 웹 2.0 기반 시스템인 스프링노트를 활용하여 로봇프로그래밍 교육 시스템을 구축하고, D지역 정보영재교육원의 학생들을 대상으로 수업을 실시하고, 문제해결력 검사지를 교육 전, 교육 후 투입하여 문제해결력의 신장 정도를 알아보았다. 결론적으로 웹 2.0을 활용한 로봇프로그래밍 교육이 학습자의 문제해결력을 신장시키는 것으로 드러났다.

• 대한산업공학회지
• /
• 제17권2호
• /
• pp.131-142
• /
• 1991

The concept of criterion function is proposed as a framework for comparing the geometric and computational characteristics of various nonlinear programming approaches to linear programming such as the method of centers, Karmakar's algorithm and the gravitational method. Also, we discuss various computational issues involved in obtaining an efficient parallel implementation of these methods. Clearly, the most time consuming part in solving a linear programming problem is the direction finding procedure, where we obtain an improving direction. In most cases, finding an improving direction is equivalent to solving a simple optimization problem defined at the current feasible solution. Again, this simple optimization problem can be seen as a least squares problem, and the computational effort in solving the least squares problem is, in fact, same as the effort as in solving a system of linear equations. Hence, getting a solution to a system of linear equations fast is very important in solving a linear programming problem efficiently. For solving system of linear equations on parallel computing machines, an iterative method seems more adequate than direct methods. Therefore, we propose one possible strategy for getting an efficient parallel implementation of an iterative method for solving a system of equations and present the summary of computational experiment performed on transputer based parallel computing board installed on IBM PC.

• 컴퓨터교육학회논문지
• /
• 제18권5호
• /
• pp.1-13
• /
• 2015

최근 개발 적용되고 있는 국내외 교육과정에서는 지식정보화 사회의 구성원으로서 학생들이 습득해야 할 핵심 소양으로 '문제해결' 역량이 강조되고 있으며, 문제해결력 향상을 목표로 한 프로그래밍 교육 방안이 다양하게 연구되고 있다. 하지만 관련 연구에서 다루어지고 있는 프로그래밍 문제는 전통적인 프로그래밍 수업에서 활용되고 있는 문제와 차별성이 없었으며, 제시된 문제를 다루는 방법의 대부분은 문제해결 능력 제고에 적합하기 보다는 특정 프로그래밍 언어를 습득하는데 주안점을 두고 있었다. 이에 본 연구에서는 문제해결 역량 함양에 적합한 프로그래밍 문제와 교육과정을 개발하고 문제해결활동(PSA)을 중심으로 교수 학습 콘텐츠를 설계 개발하였다. 또한 개발된 콘텐츠를 교재로 교육과정을 운영하여 학습자의 문제해결력과 논리적 사고력 향상에 유의미한 결과를 얻었다. 본 연구 결과는 '문제해결' 역량 증진을 목적으로 프로그래밍 교수 학습 콘텐츠나 교육과정을 개발 운영할 때 기초 자료로나 참조 모델로 활용될 수 있을 것으로 기대된다.

• 경영과학
• /
• 제10권2호
• /
• pp.1-9
• /
• 1993

This paper shows the application of fuzzy set and nonlinear membership function to linear programming problems in a fuzzy environment. In contrast to typical linear programming problems, the objectives and constraints of the problem in a fuzzy environment are defined imprecisely. This paper describes that fuzzy linear programming models can be formulated using the basic concepts of membership functions and fuzzy sets, and that they can be solved by quadratic programming methods. In a numerical example, a linear programming problem with two constraints and two decision variables is provided to illustrate the solution procedure.

• 대한수학회논문집
• /
• 제20권4호
• /
• pp.837-847
• /
• 2005

We consider multiobjective fractional programming problems with generalized invexity. An equivalent multiobjective programming problem is formulated by using a modification of the objective function due to Antczak. We give relations between a multiobjective fractional programming problem and an equivalent multiobjective fractional problem which has a modified objective function. And we present modified vector saddle point theorems.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제6권3호
• /
• pp.232-239
• /
• 2006

This paper is for applying interactive fuzzy linear programming for the problem of product mix planning, which is one of the aggregate planning problem. We developed a modified algorithm, which has two-phase approach for interactive fuzzy linear programming to get a better solution. Adding two-phase method, we expect to obtain not only the highest membership degree, but also a better utilization of each constrained resource.

• 한국철도학회논문집
• /
• 제8권5호
• /
• pp.391-397
• /
• 2005

In this paper we present a model for the maintenance routing construction and the trainset allocation (maintenance routing problem). The model solves the maintenance routing problem using column generation algorithm which was used to combine constraint programming and linear programming. Ilog-cplex was used to solve the linear programming model and Ilog-solver was used to solve the constraint programming model. The computational experience is also provided.