• 제목/요약/키워드: Replacement scheduling

검색결과 15건 처리시간 0.033초

Optimal Replacement Scheduling of Water Pipelines

  • Ghobadi, Fatemeh;Kang, Doosun
    • 한국수자원학회:학술대회논문집
    • /
    • 한국수자원학회 2021년도 학술발표회
    • /
    • pp.145-145
    • /
    • 2021
  • Water distribution networks (WDNs) are designed to satisfy water requirement of an urban community. One of the central issues in human history is providing sufficient quality and quantity of water through WDNs. A WDN consists of a great number of pipelines with different ages, lengths, materials, and sizes in varying degrees of deterioration. The available annual budget for rehabilitation of these infrastructures only covers part of the network; thus it is important to manage the limited budget in the most cost-effective manner. In this study, a novel pipe replacement scheduling approach is proposed in order to smooth the annual investment time series based on a life cycle cost assessment. The proposed approach is applied to a real WDN currently operating in South Korea. The proposed scheduling plan considers both the annual budget limitation and the optimum investment on pipes' useful life. A non-dominated sorting genetic algorithm is used to solve a multi-objective optimization problem. Three decision-making objectives, including the minimum imposed LCC of the network, the minimum standard deviation of annual cost, and the minimum average age of the network, are considered to find optimal pipe replacement planning over long-term time period. The results indicate that the proposed scheduling structure provides efficient and cost-effective rehabilitation management of water network with consistent annual budget.

  • PDF

골리앗 크레인의 공주행 거리와 와이어 교체 최소를 고려한 최적 블록 리프팅 계획 (Optimal Block Lifting Scheduling Considering the Minimization of Travel Distance at an Idle State and Wire Replacement of a Goliath Crane)

  • 노명일;이규열
    • 한국CDE학회논문집
    • /
    • 제15권1호
    • /
    • pp.1-10
    • /
    • 2010
  • Recently, a shipyard is making every effort to efficiently manage equipments of resources such as a gantry crane, transporter, and so on. So far block lifting scheduling of a gantry crane has been manually performed by a manager of the shipyard, and thus it took much time to get scheduling results and moreover the quality of them was not optimal. To improve this, a block lifting scheduling system of the gantry crane using optimization techniques was developed in this study. First, a block lifting scheduling problem was mathematically formulated as a multi-objective optimization problem, considering the minimization of travel distance at an idle state and wire replacement during block lifting. Then, to solve the problem, a meta-heuristic optimization algorithm based on the genetic algorithm was proposed. To evaluate the efficiency and applicability of the developed system, it was applied to an actual block lifting scheduling problem of the shipyard. The result shows that blocks can be efficiently lifted by the gantry crane using the developed system, compared to manual scheduling by a manager.

Proper Decision for Maintenance Intervals of Equipment in Power Stations by Considering Maintenance Replacement Rate and Operation Rate

  • Nakamura, Masatoshi;Suzuki, Yoshihiro;Hatazaki, Hironori
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2001년도 ICCAS
    • /
    • pp.157.3-157
    • /
    • 2001
  • In this paper, the optimal maintenance scheduling for turbine with considering maintenance replacement rate was proposed in order to reduce the maintenance cost during the whole period of operation, meanwhile keeping current reliability of turbine. The proposed method is only based on a few limited available data with various factors relating to maintenance replacement and repair of turbine. The proposed method will be adopted by Kyushu Electric Power Co., Inc. from April in 2002 to determine the maintenance schedule of thermal power plants.

  • PDF

선박운항일정계획 문제의 유전해법 (A Genetic Algorithm for the Ship Scheduling Problem)

  • 이희용;김시화
    • 한국항해학회지
    • /
    • 제24권5호
    • /
    • pp.361-371
    • /
    • 2000
  • This paper treats a genetic algorithm for ship scheduling problem in set packing formulation. We newly devised a partition based representation of solution and compose initial population using a domain knowledge of problem which results in saving calculation cost. We established replacement strategy which makes each individual not to degenerate during evolutionary process and applied adaptive mutate operator to improve feasibility of individual. If offspring is feasible then an improve operator is applied to increase objective value without loss of feasibility. A computational experiment was carried out with real data and showed a useful result for a large size real world problem.

  • PDF

Equipment Failure Forecasting Based on Past Failure Performance and Development of Replacement Strategies

  • Begovic, Miroslav;Perkel, Joshua;Hartlein, Rick
    • Transactions on Electrical and Electronic Materials
    • /
    • 제7권5호
    • /
    • pp.217-223
    • /
    • 2006
  • When only partial information is available about equipment failures (installation date and amount, as well as failure and replacement rates), data on sufficiently large number of yearly populations of the components can be combined, and estimation of model parameters may be possible. The parametric models may then be used for forecasting of the system's short term future failure and for formulation of replacement strategies. We employ the Weibull distribution and show how we estimate its parameters from past failure data. Using Monte Carlo simulations, it is possible to assess confidence ranges of the forecasted component performance data.

패키징 인쇄를 위한 병렬 오프셋 인쇄 공정의 스케줄링 (Scheduling of Parallel Offset Printing Process for Packaging Printing)

  • 문재경;태현철
    • 한국포장학회지
    • /
    • 제28권3호
    • /
    • pp.183-192
    • /
    • 2022
  • 본 연구에서는 패키징 인쇄를 위한 병렬 오프셋 인쇄 공정의 스케줄링 문제를 다루었다. 문제에 대해 두 부분으로 구분하여 접근하였고, 각각 할당 문제와 차량 경로 문제를 적용하여 수리적으로 모형화 하였다. 스케줄링 모형의 현장 적용성은 실험을 통해 검토하였다. 실제 데이터로 구성된 작은 규모의 문제에서는 수리모형으로도 실용적인 시간 내에 최적해를 도출할 수 있었고 이와 비교하여 메타 휴리스틱의 성능을 확인하였다. 기업이 보유한 데이터를 바탕으로 문제 규모를 확장한 실험에서는, 수리모형의 최적해와 비교하여 메타 휴리스틱이 해의 품질을 보장하면서 시간적 효율성을 확보할 수 있었다. 본 연구는 수작업 위주의 기존 방식은 주체(작업자)에 따라 스케줄링의 결과에 불확실성이 존재하는 문제에 주목하였다. 이러한 불확실성은 전체 생산 비용의 증가를 가져오기 때문에 이를 개선할 수 있도록 실용적인 시간 내에 일관된 결과를 제공하는 스케줄링 모형을 제시하였다. 제시한 모형은 단일 라인과 병렬 라인 모두에 적용되어 작업자의 경험에 의존하던 기존의 방식을 개선하는데 도움이 될 것으로 판단되며, 시간 함수의 정의를 통해 다른 요인들을 반영하는 연구로의 확장이 가능하다는 의의를 갖는다. 향후 주문의 납기, 복수의 라인에서 동일 주문 인쇄, 동일하지 않은 라인의 인쇄 용량, 조색 난이도 등을 고려하는 연구로의 확장을 통해 패키징 인쇄 분야의 스마트 생산 시스템 도입에 기여할 수 있을 것으로 기대된다.

마코프 누적 프로세스에서의 확률적 콘벡스성 (Stochastic convexity in markov additive processes)

  • 윤복식
    • 한국경영과학회:학술대회논문집
    • /
    • 대한산업공학회/한국경영과학회 1991년도 춘계공동학술대회 발표논문 및 초록집; 전북대학교, 전주; 26-27 Apr. 1991
    • /
    • pp.147-159
    • /
    • 1991
  • Stochastic convexity(concvity) of a stochastic process is a very useful concept for various stochastic optimization problems. In this study we first establish stochastic convexity of a certain class of Markov additive processes through the probabilistic construction based on the sample path approach. A Markov additive process is obtained by integrating a functional of the underlying Markov process with respect to time, and its stochastic convexity can be utilized to provide efficient methods for optimal design or for optimal operation schedule of a wide range of stochastic systems. We also clarify the conditions for stochatic monotonicity of the Markov process, which is required for stochatic convexity of the Markov additive process. This result shows that stochastic convexity can be used for the analysis of probabilistic models based on birth and death processes, which have very wide application area. Finally we demonstrate the validity and usefulness of the theoretical results by developing efficient methods for the optimal replacement scheduling based on the stochastic convexity property.

  • PDF

마코프 누적 프로세스에서의 확률적 콘벡스성과 그 응용 (Stochastic convexity in Markov additive processes and its applications)

  • 윤복식
    • 한국경영과학회지
    • /
    • 제16권1호
    • /
    • pp.76-88
    • /
    • 1991
  • Stochastic convexity (concavity) of a stochastic process is a very useful concept for various stochastic optimization problems. In this study we first establish stochastic convexity of a certain class of Markov additive processes through probabilistic construction based on the sample path approach. A Markov additive process is abtained by integrating a functional of the underlying Markov process with respect to time, and its stochastic convexity can be utilized to provide efficient methods for optimal design or optimal operation schedule wide range of stochastic systems. We also clarify the conditions for stochastic monotonicity of the Markov process. From the result it is shown that stachstic convexity can be used for the analysis of probabilitic models based on birth and death processes, which have very wide applications area. Finally we demonstrate the validity and usefulness of the theoretical results by developing efficient methods for the optimal replacement scheduling based on the stochastic convexity property.

  • PDF

양곡부두의 체선율 감소를 위한 부두 장비 및 사일로 스케줄링 연구 (Facility scheduling problem in Grain terminal for reducing demurrage rate)

  • 신재영;박종원
    • 한국항해항만학회:학술대회논문집
    • /
    • 한국항해항만학회 2013년도 춘계학술대회
    • /
    • pp.60-61
    • /
    • 2013
  • 항만의 생산성과 서비스수준을 측정하는 가장 중요한 척도중의 하나는 체선율이라고 할 수 있다. 현재 부산 북항 양곡부두의 경우도 체선율이 상당히 높은 수준으로 인식하고 있으며 이를 개선하기 위해 운영상 많은 노력을 기울이고 있다. 체선율을 줄이기 위해서는 하드웨어 측면읜 시설의 확충, 노후 장비의 교체 등과 같은 방법이 있고, 소프트웨어 측면인 운영상 장비의 할당 규칙, 배정 순서의 변경 등과 같은 운영적인 방법이 있다. 선박의 체선을 줄이기 위해 선석을 확충하거나 장비를 추가로 확보하는 방법이 자금적인 이유를 비롯하여 현실적으로 가능하지 않다면 운영적인 방법을 통하여 체선율을 줄이는데 도움이 될 수도 있을 것이다. 따라서 이 논문은 부산 북항 양곡부두의 장비와 기본적인 운영 방식을 모델로 하여 체선율, 즉 작업 시간을 줄이기 위한 장비의 할당 규칙 및 사일로 할당 규칙에 관한 여러 가지 운영 방식을 비교 분석하여 보도록 한다.

  • PDF