• Title/Summary/Keyword: Time windows

Search Result 797, Processing Time 0.023 seconds

A Design and Implementation of a Windows Visual System for the Monitoring of Red Tide on the Internet (인터넷을 통한 적조 관측용 윈도우 비주얼 시스템의 설계 및 구현)

  • 박진우;손주영
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.27 no.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.

Hybrid Search for Vehicle Routing Problem With Time Windows (시간제약이 있는 차량경로문제에 대한 Hybrid 탐색)

  • Lee, Hwa-Ki;Lee, Hong-Hee;Lee, Sung-Woo;Lee, Seung-Woo
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.29 no.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.

Hybrid Genetic Algorithms for Solving Reentrant Flow-Shop Scheduling with Time Windows

  • Chamnanlor, Chettha;Sethanan, Kanchana;Chien, Chen-Fu;Gen, Mitsuo
    • Industrial Engineering and Management Systems
    • /
    • v.12 no.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.

Flow based heuristics for the multiple traveling salesman problem with time windows

  • Lee, Myung-Sub
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1993.04a
    • /
    • 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).

  • PDF

Dynamic Programming Approach for Prize Colleting Travelling Salesman Problem with Time Windows (시간제약이 있는 상금 획득 외판원 문제에 대한 동적 계획 접근 방법)

  • Tae, Hyun-Chul;Kim, Byung-In
    • IE interfaces
    • /
    • v.24 no.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.

An Algorithm for the Traveling Salesperson Problem with Time Windows and Lateness Costs

  • Suh, Byung-Kyoo;Kim, Jong-Soo
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.22 no.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.

  • PDF

A Study on the Condensation and Thermal Environment according to Window Systems Types Installed for a Extended-Balcony Apartment (확장형 발코니 공동주택의 창호종류에 따른 결로 및 온열환경에 관한 연구)

  • Yoon, Jong-Ho;An, Young-Sub;Kim, Byoung-Soo
    • KIEAE Journal
    • /
    • v.7 no.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.

A Method to Support Real-time for User-level Robot Components on Windows (윈도우 유저 레벨 로봇 컴포넌트에 실시간성 지원 방법)

  • Ju, Min-Gyu;Lee, Jin-Wook;Jang, Choul-Soo;Kim, Sung-Hoon;Lee, Cheol-Hoon
    • The Journal of the Korea Contents Association
    • /
    • v.11 no.7
    • /
    • pp.51-59
    • /
    • 2011
  • Intelligent service robots leading the future market are robots which assist humans physically, mentally, and emotionally. Since intelligent service robots operate in a tightly coupled manner with humans, their safe operation should be an inevitable consideration. For this safety, real-time capabilities are necessary to execute certain services periodically. Currently, most robot components are being developed based on Windows for the sake of development convenience. However, since Windows does not support real-time, there is no option but to use expensive third-party software such as RTX and INTime. Also since most robot components are usually execute in user-level, we need to research how to support real-time in user-level. In this paper, we design and implement how to support real-time for components running in user-level on Windows using RTiK which actually supports real-time in kernel level on Windows.

XML-based Windows Event Log Forensic tool design and implementation (XML기반 Windows Event Log Forensic 도구 설계 및 구현)

  • Kim, Jongmin;Lee, DongHwi
    • Convergence Security Journal
    • /
    • v.20 no.5
    • /
    • pp.27-32
    • /
    • 2020
  • The Windows Event Log is a Log that defines the overall behavior of the system, and these files contain data that can detect various user behaviors and signs of anomalies. However, since the Event Log is generated for each action, it takes a considerable amount of time to analyze the log. Therefore, in this study, we designed and implemented an XML-based Event Log analysis tool based on the main Event Log list of "Spotting the Adversary with Windows Event Log Monitoring" presented at the NSA.