• 제목/요약/키워드: near-time optimal

검색결과 298건 처리시간 0.023초

개국약사의 적정조제건수 산출 (Estimation of the Number of Optimal Dispensing Cases for the Community Pharmacist)

  • 이의경;박정영
    • 보건행정학회지
    • /
    • 제11권4호
    • /
    • pp.88-108
    • /
    • 2001
  • Separation of prescribing and dispensing practice in Korea has changed the service pattern of the pharmacy. The prescription dispensing activities, however, are concentrated excessively on the pharmacies near hospitals or clinics. Thus this study was conducted to estimate the number of optimal dispensing cases for the community pharmacy. Forty-six pharmacies were selected using systematic stratified random sampling method, and ninety-five pharmacists were interviewed on their workload of dispensing and other activities at pharmacies. One hundred and seventy prescriptions were chosen based on the length of drug administration and drug dosage form, and the dispensing time was measured by time-watch method. Also pharmacy benefit claims data were analyzed to identify the characteristics of the pharmacies which performed more than optimal dispensing cases. According to the study results, the average work time per pharmacist per day was found to be 10hours 32minutes and the dispensing activities occupied 7hours 36minutes. It took 5.72minutes on average for each dispensing case. The optimal dispensing case was estimated as 75 cases under the condition of 10hours 32minutes work time and 6% allowance rate. Even though the pharmacies near hospitals or clinics participated dispensing services actively, only pharmacies near clinics dealt with more than optimal dispensing cases. For the pharmacies near hospitals they dealt with less than optimal cases, but drug administration period per prescription was almost 3 times longer than that of pharmacies near clinics. Thus the intensity of dispensing activities such as drug administration period is to be considered to estimate optimal dispensing cases more accurately.

  • PDF

열원 및 공조설비 통합 최적제어기법 구현에 관한 연구 (Real Time Near Optimal Control Application Strategy for Heat Source and HVAC System)

  • 송재엽;안병천;주영덕;김진
    • 대한설비공학회:학술대회논문집
    • /
    • 대한설비공학회 2008년도 하계학술발표대회 논문집
    • /
    • pp.60-65
    • /
    • 2008
  • The near-optimal control algorithm for central cooling and heating system has been developed for minimizing energy consumption while maintaining the comfort of indoor thermal environment in terms of the environmental variables such as time varying indoor load and outdoor temperatures. The optimal set-points of control parameters with near-optimal control are supply air and chilled or hot water temperatures. The near optimal control algorithm has been implemented by using LabVIEW program in order to analyze energy performance for central cooling and heating control system.

  • PDF

중앙냉방시스템의 실시간 준최적제어 적용에 따른 실험적 연구 (Real Time Near Optimal Control Application Strategy of Central Cooling System)

  • 안병천;송재엽;주영덕;김진
    • 설비공학논문집
    • /
    • 제20권7호
    • /
    • pp.470-477
    • /
    • 2008
  • The near-optimal control algorithm for central cooling system has been developed for minimizing energy consumption while maintaining the comfort of indoor thermal environment in terms of the environmental variables such as time varying indoor cooling load and outdoor temperatures. The optimal set-points of control parameters with near-optimal control are supply air and chilled water temperatures. The near optimal control algorithm has been implemented by using LabVIEW program in order to analyze energy performance for central cooling control system.

Time-Profit Trade-Off of Construction Projects Under Extreme Weather Conditions

  • Senouci, Ahmed;Mubarak, Saleh
    • Journal of Construction Engineering and Project Management
    • /
    • 제4권4호
    • /
    • pp.33-40
    • /
    • 2014
  • Maximizing the profitability and minimizing the duration of construction projects in extreme weather regions is a challenging objective that is essential for project success. An optimization model is presented herein for the time-profit trade-off analysis of construction projects under extreme weather conditions. The model generates optimal/near optimal schedules that maximize profit and minimize the duration of construction projects in extreme weather regions. The computations in the model are organized into: (1) a scheduling module that develops practical schedules for construction projects, (2) a profit module that computes project costs (direct, indirect, and total) and project profit, and (3) a multi-objective module that determines optimal/near optimal trade-offs between project duration and profit. One example is used to show the impact of extreme weather on construction time and profit. Another example is used to show the model's ability to generate optimal trade-offs between the time and profit of construction projects under extreme weather conditions.

ATM망의 체증을 해결하기 위한 최적 제어기 설계 (Design of Optimal Controller for the Congestion in ATM Networks)

  • 정우채;김영중;임묘택
    • 대한전기학회논문지:시스템및제어부문D
    • /
    • 제54권6호
    • /
    • pp.359-365
    • /
    • 2005
  • This paper presents an reduced-order near-optimal controller for the congestion control of Available Bit Rate (ABR) service in Asynchronous Transfer Mode (ATM) networks. We introduce the model, of a class of ABR traffic, that can be controlled using a Explicit Rate feedback for congestion control in ATM networks. Since there are great computational complexities in the class of optimal control problem for the ABR model, the near-optimal controller via reduced-order technique is applied to this model. It is implemented by the help of weakly coupling and singular perturbation theory, and we use bilinear transformation because of its computational convenience. Since the bilinear transformation can convert discrete Riccati equation into continuous Riccati equation, the design problems of optimal congestion control can be reduced. Using weakly coupling and singular perturbation theory, the computation time of Riccati equations can be saved, moreover the real-time congestion control for ATM networks can be possible.

유전자 알고리듬과 K-평균법을 이용한 지역 분할 (Zone Clustering Using a Genetic Algorithm and K-Means)

  • 임동순;오현승
    • 한국경영과학회지
    • /
    • 제23권1호
    • /
    • pp.1-16
    • /
    • 1998
  • The zone clustering problem arising from several area such as deciding the optimal location of ambient measuring stations is to devide the 2-dimensional area into several sub areas in which included individual zone shows simimlar properties. In general, the optimal solution of this problem is very hard to obtain. Therefore, instead of finding an optimal solution, the generation of near optimal solution within the limited time is more meaningful. In this study, the combination of a genetic algorithm and the modified k-means method is used to obtain the near optimal solution. To exploit the genetic algorithm effectively, a representation of chromsomes and appropriate genetic operators are proposed. The k-means method which is originally devised to solve the object clustering problem is modified to improve the solutions obtained from the genetic algorithm. The experiment shows that the proposed method generates the near optimal solution efficiently.

  • PDF

Design and optimization of steel trusses using genetic algorithms, parallel computing, and human-computer interaction

  • Agarwal, Pranab;Raich, Anne M.
    • Structural Engineering and Mechanics
    • /
    • 제23권4호
    • /
    • pp.325-337
    • /
    • 2006
  • A hybrid structural design and optimization methodology that combines the strengths of genetic algorithms, local search techniques, and parallel computing is developed to evolve optimal truss systems in this research effort. The primary objective that is met in evolving near-optimal or optimal structural systems using this approach is the capability of satisfying user-defined design criteria while minimizing the computational time required. The application of genetic algorithms to the design and optimization of truss systems supports conceptual design by facilitating the exploration of new design alternatives. In addition, final shape optimization of the evolved designs is supported through the refinement of member sizes using local search techniques for further improvement. The use of the hybrid approach, therefore, enhances the overall process of structural design. Parallel computing is implemented to reduce the total computation time required to obtain near-optimal designs. The support of human-computer interaction during layout optimization and local optimization is also discussed since it assists in evolving optimal truss systems that better satisfy a user's design requirements and design preferences.

중앙냉방시스템의 준최적 설정점제어기법 구현에 관한 연구 (An Implementation for Near-Optimal Set Point Control for Central Cooling Systems)

  • 백승재;송재엽;안병천;주영덕;김진
    • 대한설비공학회:학술대회논문집
    • /
    • 대한설비공학회 2007년도 동계학술발표대회 논문집
    • /
    • pp.46-51
    • /
    • 2007
  • The near-optimal control algorithm for central cooling system has been developed for minimizing energy consumption while maintaining the comfort of indoor thermal environment in terms of the environmental variables such as time varying indoor cooling load and outdoor temperatures. The optimal set-points of control parameters with near-optimal control are supply air temperature and chilled water temperature. This study has been done by using LapVIEW program with PID control in order to analyze the central cooling system energy saving.

  • PDF

Near-Optimal Collision Avoidance Maneuvers for UAV

  • Han, Su-Cheol;Bang, Hyo-Choong
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2004년도 ICCAS
    • /
    • pp.1999-2004
    • /
    • 2004
  • Collision avoidance for the aircraft can be stated as a problem of maintaining a safe distance between aircrafts in conflict. Optimal collision avoidance problem seeks to minimize the given cost function while simultaneously satisfying the constraints. The cost function can be a function of time or input. This paper addresses the trajectory time-optimization problem for collision avoidance of the unmanned aerial vehicles. The problem is difficult to handle, because it is a two points boundary value problem with dynamic environment. Some simplifying algorithms are used for application in on-line operation. Although there are more complicated problems, by prediction of conflict time and some assumptions, we changed a dynamic environment problem into a static one.

  • PDF

Stochastic Time-Cost Tradeoff Using Genetic Algorithm

  • Lee, Hyung-Guk;Lee, Dong-Eun
    • 국제학술발표논문집
    • /
    • The 6th International Conference on Construction Engineering and Project Management
    • /
    • pp.114-116
    • /
    • 2015
  • This paper presents a Stochastic Time-Cost Tradeoff analysis system (STCT) that identifies optimal construction methods for activities, hence reducing the project completion time and cost simultaneously. It makes use of schedule information obtained from critical path method (CPM), applies alternative construction methods data obtained from estimators to respective activities, computes an optimal set of genetic algorithm (GA) parameters, executes simulation based GA experiments, and identifies near optimal solution(s). A test case verifies the usability of STCT.

  • PDF