• Journal of Advanced Marine Engineering and Technology
• /
• 제27권7호
• /
• pp.817-825
• /
• 2003

The amount of damage suffered from the red tide occurring at the near shore is increasing rapidly. The Windows visual system discussed in this paper is developed in order to help minimize the damage. The system is focused on the monitoring the coastal environment. and forecasting the red tide occurrence. Although several similar systems are now existing. most of them are based on the web application. which cause the large response time. limited presentation ability of data. and inability of data storing at client side. The Windows visual system described in this paper operates on the Internet to get the ubiquitous access. One of three components of the Windows visual system. client system is developed as a Windows application in order to overcome the weak points of the previous systems. The gathering. analysis, and monitoring of data can be done at real time using the Windows visual system.

• 산업경영시스템학회지
• /
• 제29권3호
• /
• pp.62-69
• /
• 2006

Vehicle routing problem with time windows is determined each vehicle route in order to minimize the transportation costs. All delivery points in geography have various time restriction in camparision with the basic vehicle routing problem. Vechicle routing problem with time windows is known to be NP-hard, and it needs a lot of computing time to get the optimal solution, so that heuristics are more frequently developed than optimal algorithms. This study aims to develop a heuristic method which combines guided local search with a tabu search in order to minimize the transportation costs for the vehicle routing assignment and uses ILOG programming library to solve. The computational tests were performed using the benchmark problems.

• Industrial Engineering and Management Systems
• /
• 제12권4호
• /
• pp.306-316
• /
• 2013

The semiconductor industry has grown rapidly, and subsequently production planning problems have raised many important research issues. The reentrant flow-shop (RFS) scheduling problem with time windows constraint for harddisk devices (HDD) manufacturing is one such problem of the expanded semiconductor industry. The RFS scheduling problem with the objective of minimizing the makespan of jobs is considered. Meeting this objective is directly related to maximizing the system throughput which is the most important of HDD industry requirements. Moreover, most manufacturing systems have to handle the quality of semiconductor material. The time windows constraint in the manufacturing system must then be considered. In this paper, we propose a hybrid genetic algorithm (HGA) for improving chromosomes/offspring by checking and repairing time window constraint and improving offspring by left-shift routines as a local search algorithm to solve effectively the RFS scheduling problem with time windows constraint. Numerical experiments on several problems show that the proposed HGA approach has higher search capability to improve quality of solutions.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1993년도 춘계공동학술대회 발표논문 및 초록집; 계명대학교, 대구; 30 Apr.-1 May 1993
• /
• pp.354-366
• /
• 1993

In this paper, new algorithms for solving the multiple traveling salesman problem with time windows are presented. These algorithms are based on the flow based algorithms for solving the vehicle scheduling problem. Computational results on problems up to 750 customers indicate that these algorithms produce superior results to existing heuristic algorithms for solving the vehicle routing problems when the time windows are 'tight enough' where 'tight enough' is based on a metric proposed by desrosiers et al.(1987).

• 산업공학
• /
• 제24권2호
• /
• pp.112-118
• /
• 2011

This paper introduces one type of prize collecting travelling salesman problem with time windows (PCTSPTW), proposes a mixed integer programming model for the problem, and shows that the problem can be reduced to the elementary shortest path problem with time windows and capacity constraints (ESPPTC). Then, a new dynamic programming algorithm is proposed to solve ESPPTC quickly. Computational results show the effectiveness of the proposed algorithm.

• 산업경영시스템학회지
• /
• 제22권53호
• /
• pp.13-22
• /
• 1999

This paper presents a model and dynamic programming based algorithm for the Traveling Salesperson Problem with Time Windows (TSPTW). The main difference of our model compared with the previous ones lies in that the time windows we are concerned are far more flexible and realistic. In the typical TSPTW, the service at a node must begin within the time grid called the time window that is defined by the earliest and the latest time to start the service at the node. But, in real business practices, a lateness cost is usually penalized rather than the service is prohibited at all when a vehicle arrives after the latest time. Considering this situation, we propose a model with a new time window that allows an arrival after the latest time and penalizes the late arrival by charging a lateness cost. An algorithm introduced for the model is extensively tested to verify the accuracy and efficiency.

• KIEAE Journal
• /
• 제7권5호
• /
• pp.87-92
• /
• 2007

As expansion of balconies at apartments has been legalized, the major function of the balconies as a thermal buffer zone is disappearing. This weakens the ability of window to insulate heat and multiplies surface condensation. Thus more and more residents require solutions to increasing surface condensation and aggravation in thermal comfort. This study intends to provide basic data by evaluating performance of triple layered Low-E windows, triple layered clear windows, double layered Low-E windows and double layered clear window used for expanded balconies and marketed within the country in terms of surface condensation and thermal environment through simulation. Results revealed that no surface condensation occurred at double layered Low-E windows and triple layered Low-E windows. Surface condensation took place at double layered clear windows and triple layered clear windows at a relative humidity of 60%. Thermal environment analysis suggested that double layered clear windows showed the most time falling into the range of comfort at $23^{\circ}C$. The figure were $22^{\circ}C$ for triple layered clear windows, $22^{\circ}C$ for double layered Low-E windows and $21^{\circ}C$ for triple layered Low-E windows.

• 한국공작기계학회:학술대회논문집
• /
• 한국공작기계학회 1999년도 추계학술대회 논문집 - 한국공작기계학회
• /
• pp.585-590
• /
• 1999

• 한국콘텐츠학회논문지
• /
• 제11권7호
• /
• pp.51-59
• /
• 2011

미래 시장을 선도할 핵심 분야로 지능형 서비스 로봇을 꼽을 수 있으며, 지능형 서비스 로봇은 인간과 공존하면서 육체적, 정신적, 감성적으로 인간을 보조하는 로봇이다. 지능형 서비스 로봇은 인간과 밀접한 관계를 맺으며 동작하기 때문에 지능형 서비스 로봇이 제공하는 핵심 서비스의 안정적인 수행은 로봇 사용자의 안전을 보장하기 위한 필수적인 고려사항이다. 이러한 안전성을 위해서는 정해진 시간마다 주기적으로 핵심 서비스를 수행시키는 실시간성이 필수 불가결한 요소이다. 현재 많은 로봇 컴포넌트들이 개발의 편의성을 위해 범용 운영체제인 윈도우를 사용하지만, 윈도우는 실시간성을 지원하지 않는 문제점이 있으며 실시간성 제공을 위해 RTX나 INtime과 같은 고가의 써드파티를 별도로 설치하여 사용해야 한다. 또한 로봇 컴포넌트는 유저 레벨에서 동작하기 때문에 유저영역에서 실시간성을 제공할 수 있는 방법에 대한 연구가 필요하다. 본 논문에서는 범용 운영체제 윈도우의 커널 레벨에서 실시간성을 제공하는 RTiK을 이용하여 유저 레벨에서 동작하는 함수를 주기적으로 동작시키는 방법을 설계 및 구현하였다.

• 융합보안논문지
• /
• 제20권5호
• /
• pp.27-32
• /
• 2020

Windows Event Log에는 시스템의 전반적인 동작들을 정의하고 있는 Log이며, 해당 파일에는 사용자의 여러 행위 및 이상 징후를 탐지할 수 있는 데이터가 저장되어 있다. 하지만 행위마다 Event Log가 발생함으로써, 로그들을 분석할 때, 상당한 시간이 소요된다. 따라서 본 연구에서는 NSA에서 발표한 "Spotting the Adversary with Windows Event Log Monitoring"의 주요 Event Log 목록을 바탕으로 XML 기반한 Event Log 분석 도구를 설계 및 구현 하였다.