• 인터넷정보학회논문지
• /
• 제8권6호
• /
• pp.75-85
• /
• 2007

프로그래밍 교육에 있어 학습자의 학업 성취도를 향상시킬 수 있는 중요한 요인 중의 하나는 다양한 형태의 과제를 학습자에게 부여하여 문제 해결 연습 기회를 많이 제공해 주는 것이다. 그러나 프로그래밍 과제 평가는 대부분 수작업으로 행해지고 있으면 정확한 평가 방법을 제공해 줄 수 있는 자동화된 도구 또한 결여되어 있는 게 현실이다. 이러한 제한된 환경 하에서 과제 평가는 교수자들에게 많은 시간과 노력을 요구하게 되어 다양한 형태의 과제 부여는 현실적으로 어려움이 있다. 이러한 문제를 극복하기 위해서는 교수자가 효율적이고 일괄적인 방법으로 과제를 쉽게 평가할 수 있고, 학습자들 상호간의 프로그램 소스코드의 표절 또한 용이하게 검사할 수 있는 자동화된 프로그래밍 평가 시스템이 필요하다. 따라서 본 논문에서는 교수자가 프로그램의 성능을 자동적인 방법으로 평가할 수 있을 뿐만 아니라 적절한 피드백과 함께 프로그램의 스타일과 표절에 대한 검사 또한 용이하게 수행할 수 있는 웹을 기반으로 한 프로그래밍 과제 평가 시스템을 설계하고 구현한다.

• 한국국방경영분석학회지
• /
• 제26권1호
• /
• pp.56-69
• /
• 2000

A frequency assignment problem on time division duplex system is considered. Republic of Korea Army (ROKA) has been establishing an infrastructure of tactical communication (SPIDER) system for next generation and it will be a core network structure of system. VHF system is the backbone network of SPIDER, that performs transmission of data such as voice, text and images. So, it is a significant problem finding the frequency assignment with no interference under very restricted resource environment. With a given arbitrary configuration of communications network, we find a feasible solution that guarantees communication without interference between sites and relay stations. We formulate a frequency assignment problem as an Integer Programming model, which has NP-hard complexity. To find the assignment results within a reasonable time, we take a genetic algorithm approach which represents the solution structure with available frequency order, and develop a genetic operation strategies. Computational result shows that the network configuration of SPIDER can be solved efficiently within a very short time.

• 한국항해학회지
• /
• 제13권3호
• /
• pp.37-44
• /
• 1989

Recently recognize the labor productivity of port physical distribution system in the port and shipping areas, Much Efforts for evaluating this productivity has been made continuously. BUt still there is little study, so far, on a systematic research for the management of port labor gangs, and even those were mainly depended on a rule of thumb. Especially the object of this study is to introduce the method of optimal allocation and assignment for the labor gangs per pier unit in the multiple ships berthed at an arbitary pier or port. In case the multiple ships have a homogeneous cargoes or do not have sufficient labor gangs to be assigned. The problem of optimal allocation and assignment of the labor gangs to be i) formalized with multi-state decision process in form of difference equation as the pattern which converted the independent multiple ships into a single ship with the intra-multiple ships, and ii) the optimal size of labor gangs could be obtained through the simple mathematical method instead of complicated dynamic programming, and iii) In case of shortage of labor gangs available the evaluation function considering the labor gangs available and total shift times was introduced, and iv) the optimal allocation and assignment of labor gangs was dealt at the point of minimizing the summation of the total shift times and at the point of minimizing the total cost charged for the extra waiting time except PHI time during port times for the multiple ships combinations.

• 한국콘텐츠학회:학술대회논문집
• /
• 한국콘텐츠학회 2016년도 춘계 종합학술대회 논문집
• /
• pp.43-44
• /
• 2016

최근 국내외에서 프로그래밍 교육이 주목받고 있다. 그중 초보자를 위한 한글 프로그래밍 언어인 새싹은 소프트웨어 프로그래밍 교육에 적합한 언어이다. 하지만 새싹을 위한 과제 평가 시스템은 아직 개발되어 있지 않다. 이 논문에서는 새싹을 위한 과제 평가 시스템을 개발하고자 한다. 이를 위해 기존 과제 평가 시스템인 neoESPA를 수정하여 새싹을 지원하도록 한다. 그리고 새싹을 위한 과제 간의 표절 여부를 판단하는 도구를 개발하고 이를 neoESPA에 탑재하여 정당한 평가를 도와주는 과제 평가 시스템을 제안한다.

• 산업경영시스템학회지
• /
• 제41권2호
• /
• pp.105-116
• /
• 2018

In this study, we consider the assembly line balancing (ALB) problem which is known as an very important decision dealing with the optimal design of assembly lines. We consider ALB problems with soft constraints which are expected to be fulfilled, however they are not necessarily to be satisfied always and they are difficult to be presented in exact quantitative forms. In previous studies, most researches have dealt with hard constraints which should be satisfied at all time in ALB problems. In this study, we modify the mixed integer programming model of the problem introduced in the existing study where the problem was first considered. Based on the modified model, we propose a new algorithm using the genetic algorithm (GA). In the algorithm, new features like, a mixed initial population selection method composed of the random selection method and the elite solutions of the simple ALB problem, a fitness evaluation method based on achievement ratio are applied. In addition, we select the genetic operators and parameters which are appropriate for the soft assignment constraints through the preliminary tests. From the results of the computational experiments, it is shown that the proposed algorithm generated the solutions with the high achievement ratio of the soft constraints.