• Title/Summary/Keyword: 가변 휴리스틱

Search Result 14, Processing Time 0.02 seconds

On Energy-Optimal Voltage Scheduling for Fixed-Priority Hard Real-Time Systems (고정 우선순위 경성 실시간 시스템에 대한 최적의 전압 스케줄링)

  • 윤한샘;김지홍
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.31 no.10
    • /
    • pp.562-574
    • /
    • 2004
  • We address the problem of energy-optimal voltage scheduling for fixed-priority hard real-time systems. First, we prove that the problem is NP-hard. Then, we present a fully polynomial time approximation scheme (FPTAS) for the problem. for any $\varepsilon$>0, the proposed approximation scheme computes a voltage schedule whose energy consumption is at most (1+$\varepsilon$) times that of the optimal voltage schedule. Furthermore, the running time of the proposed approximation scheme is bounded by a polynomial function of the number of input jobs and 1/$\varepsilon$. Experimental results show that the approximation scheme finds more efficient voltage schedules faster than the best existing heuristic.

Improved Track Movable Lighting System using Intelligent Lighting Control (지능형 조명 제어를 적용한 개선된 트랙무빙 조명시스템)

  • Lee, Sang-Wook;Lee, Hyeun-Tae
    • The Journal of the Korea Contents Association
    • /
    • v.11 no.12
    • /
    • pp.611-618
    • /
    • 2011
  • Track Movable Lighting System (TMLS) which is developed by New Technology Bank Co., LTD is variable lighting system which can be freely carried according to the power track comprising by including the trolley bar. This paper introduces a track design and a heuristic algorithm for intelligent lighting control of TMLS, and proposes a user interface for handling lighting control without difficulty. If New Technology Bank Co.,LTD grafts proposed control system onto TMLS, user can easily handle the lighting system movement by simply pushing the button.

Reducing Power Consumption of a Scheduling Algorithm for Optimal Selection of Supply Voltage under the Time Constraint (시간 제약 조건하에서의 최적 선택 공급 전압을 위한 전력 감소 스케줄링)

  • 최지영;김희석
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.11C
    • /
    • pp.1132-1138
    • /
    • 2002
  • This paper proposes a reducing power consumption of a scheduling algorithm for optimal selection of supply voltage. In scheduling of reduction power consumption, we determine the control steps of operations to be executed by exploiting the possibility of using variable voltage levels to reduce power consumption. In the optimal selection of supply voltage binding, we minimize the main factor of the power consumption of the switching activity on the registers using a graph coloring technique. From a set of experiments using high-level benchmark examples, we show that the proposed algorithm prefer to use optimal selection supply voltages rather than uniformed single voltage is effective in reducing power consumption.

Reviews of Bus Transit Route Network Design Problem (버스 노선망 설계 문제(BTRNDP)의 고찰)

  • Han, Jong-Hak;Lee, Seung-Jae;Lim, Seong-Su;Kim, Jong-Hyung
    • Journal of Korean Society of Transportation
    • /
    • v.23 no.3 s.81
    • /
    • pp.35-47
    • /
    • 2005
  • This paper is to review a literature concerning Bus Transit Route Network Design(BTRNDP), to describe a future study direction for a systematic application for the BTRNDP. Since a bus transit uses a fixed route, schedule, stop, therefore an approach methodology is different from that of auto network design problem. An approach methodology for BTRNDP is classified by 8 categories: manual & guideline, market analysis, system analytic model. heuristic model. hybrid model. experienced-based model. simulation-based model. mathematical optimization model. In most previous BTRNDP, objective function is to minimize user and operator costs, and constraints on the total operator cost, fleet size and service frequency are common to several previous approach. Transit trip assignment mostly use multi-path trip assignment. Since the search for optimal solution from a large search space of BTRNDP made up by all possible solutions, the mixed combinatorial problem are usually NP-hard. Therefore, previous researches for the BTRNDP use a sequential design process, which is composed of several design steps as follows: the generation of a candidate route set, the route analysis and evaluation process, the selection process of a optimal route set Future study will focus on a development of detailed OD trip table based on bus stop, systematic transit route network evaluation model. updated transit trip assignment technique and advanced solution search algorithm for BTRNDP.