• 제목/요약/키워드: Heuristic

검색결과 2,713건 처리시간 0.034초

콤플렉스 시스템의 신뢰도 최적화를 위한 발견적 합성해법의 개발 (A Hybrid-Heuristic for Reliability Optimization in Complex Systems)

  • 김재환
    • 해양환경안전학회지
    • /
    • 제5권2호
    • /
    • pp.87-97
    • /
    • 1999
  • This study is concerned with developing a hybrid heuristic algorithm for solving the redundancy optimization problem which is very important in system safety, This study develops a HH(Hybrid Heuristic) method combined with two strategies to alleviate the risks of being trapped at a local optimum. One of them is to construct the populations of the initial solutions randomly. The other is the additional search with SA(Simulated Annealing) method in final step. Computational results indicate that HH performs consistently better than the KY method proposed in Kim[8]. Therefore, the proposed HH is believed to an attractive to other heuristic methods.

  • PDF

공정납기를 이용한 jop shop 일정계획의 발견적 기법 (A heuristic technique for jop shop scheduling using operation due dates)

  • 배상윤;김여근;김영균
    • 한국경영과학회:학술대회논문집
    • /
    • 대한산업공학회/한국경영과학회 1996년도 춘계공동학술대회논문집; 공군사관학교, 청주; 26-27 Apr. 1996
    • /
    • pp.46-49
    • /
    • 1996
  • This paper presents a multi-pass heuristic for job shop scheduling with due dates. The proposed heuristic iteratively improves solutions based on operation due dates. To find a good solution efficiently, a method for searching the neighborhood of current schedule is developed. The heuristic is compared with two existing heuristics as well as several dispatching rules in terms of solution quality and computation time. The experimental results show that the proposed approach is promising.

  • PDF

휴리스틱 방법을 이용한 준비기간을 갖는 휴가형 $Geo^X/G/1$ 모형의 평균대기시간 분석 (Heuristic Interpretation of the Mean Waiting Time of $Geo^X/G/1$ Vacation Queues with Set-up Time)

  • 이성희;김성진;채경철
    • 한국경영과학회:학술대회논문집
    • /
    • 대한산업공학회/한국경영과학회 2006년도 춘계공동학술대회 논문집
    • /
    • pp.1111-1115
    • /
    • 2006
  • We present heuristic interpretations of the mean waiting time of $Geo^X/G/1$ vacation queues with set-up time. The heuristic interpretation of the mean waiting time is originally proposed for the continuous-time queues. We demonstrate that the heuristic approach is useful for the discrete-time queues as well.

  • PDF

복수모기지의 항공기 운항계획및 승무계획 문제의 발견적 기법 (Greedy Heuristic Algorithm for a Multidepot Aircraft Scheduling and Crew Scheduling Problem)

  • 장병만;박순달
    • 대한산업공학회지
    • /
    • 제11권2호
    • /
    • pp.155-163
    • /
    • 1985
  • This paper presents a heuristic algorithm for a multidepot aircraft scheduling and crew scheduling with deal-head flights. This algorithm is extended from a Greedy heuristic algorithm for a multi-depot multi-salesman traveling salesman problem. We first transform a given flight schedule into a multi-depot multi-traveling salesman problem, considering aircraft flight policies and crew management constraints. Then we solve this problem by applying a modified Greedy heuristic algorithm.

  • PDF

A Heuristic Algorithm for the Reliability Optimization of a Distributed Communication Network

  • Hung, Chih-Young;Yang, Jia-Ren;Park, Dong-Ho;Liu, Yi-Hsin
    • International Journal of Reliability and Applications
    • /
    • 제9권1호
    • /
    • pp.1-5
    • /
    • 2008
  • A heuristic algorithm for reliability optimization of a distributed network system is developed so that the reliability of a large system can be determined efficiently. This heuristic bases on the determination of maximal reliability set of maximum node capacity, maximal link reliability and maximal node degree.

  • PDF

셀 스케줄링 알고리즘의 실행 (Implementation of Cell Scheduling Algorithm)

  • Leem, Choon Woo;Lee, Noh Sung
    • 산업경영시스템학회지
    • /
    • 제20권43호
    • /
    • pp.229-240
    • /
    • 1997
  • 셀 생산방식에서 생산시스템은 생산셀로 나누어 지기 때문에 셀 스케줄링 문제의 범위는 일반적인 스케줄링 문제에서 작은 셀들의 스케줄링 문제로 줄어든다. 각각의 생산셀의 경우에서는 부품과 머신들의 수가 일반적인 경우보다 훨씬 줄어든다. 본 논문은 생산셀에서의 작업순서를 결정하기 위해 exchange-heuristic 알고리즘을 사용한다. 셀 스케줄링 문제에 exchange-heuristic 알고리즘의 전과정들이 적용된다. 셀 exchange-heuristic에서의 성능은 두가지 경우, 즉, 두 기계 머신인 경우와 다 머신인 경우에 대하여 분석된다. 이때, 셀 exchange-heuristic 문제는 일괄처리 작업방식으로 하며, 성능지표는 생산기간의 단축으로 한다.

  • PDF

자원제약을 고려하며 기간단축이 가능한 복수의 양식을 지닌 단일 프로젝트의 일정문제:자원 가용량이 시간에 따라 변하는 경우의 휴리스틱 기법 (Resource Constrained Project Scheduling Problem with Multiple Crashable Modes: A Heuristic Procedure for the Resource Availabilities Varying from Period to Period)

  • 안태호
    • 한국컴퓨터정보학회논문지
    • /
    • 제3권4호
    • /
    • pp.154-163
    • /
    • 1998
  • In this paper a heuristic procedure for a resource constrained project scheduling problem with multiple crashable modes is presented. A similar heuristic procedure by Ahn and Erengue was recently introduced, but the procedure assumes the resource capacities constant over the project life. The Procedure of this paper is able to deal with the resource capacities varying over the project life. The computational results with a set of 110 test problems demonstrate the efficacy of the heuristic procedure.

  • PDF

경험적 규칙을 이용한 자동 동조 PID제어기 (Auto-Tuning PID Controller using Some Heuristic Rules)

  • 이창구;김성중;황형수
    • 대한전기학회논문지
    • /
    • 제39권5호
    • /
    • pp.485-493
    • /
    • 1990
  • The idea of expert control is to incorporate a rule based expert system in a feedback control system. In this paper, we present some heuristic rules based on relay experiment for the choice of controller structure and the setting of the controller parameters. Heuristic rules are used as an element of the feedback loop in an auto-tuning PID controller. The algorithms are coded in a form which is as pure as possible and the heuristic logic is implemented with the rules. This paper reports an implementation of an expert controller on microcomputer-based system, including an industrial programmable controller.

Ring형 Network 설계문제의 휴리스틱 알고리즘 (Heuristic Algorithm for the Ring-type Network Design Problem)

  • 김길동;이경식
    • 산업경영시스템학회지
    • /
    • 제15권25호
    • /
    • pp.83-90
    • /
    • 1992
  • This paper aims at the problem that design the network of Rig-star type with the minimum cost, which the Ring is composed of the selected nodes(concentrators) among the several candidate nodes on the network and other nodes(terminals) is connected to the Ring by star subnetwork. Especially, we consider the terminal reliability in network design problem. We develop the heuristic algorithm for network design problem to obtain the near optimal(best) solution for problem. We use an add-heuristic method and 2-exchange method in developing the heuristic algorithm.

  • PDF

A new hybrid meta-heuristic for structural design: ranked particles optimization

  • Kaveh, A.;Nasrollahi, A.
    • Structural Engineering and Mechanics
    • /
    • 제52권2호
    • /
    • pp.405-426
    • /
    • 2014
  • In this paper, a new meta-heuristic algorithm named Ranked Particles Optimization (RPO), is presented. This algorithm is not inspired from natural or physical phenomena. However, it is based on numerous researches in the field of meta-heuristic optimization algorithms. In this algorithm, like other meta-heuristic algorithms, optimization process starts with by producing a population of random solutions, Particles, located in the feasible search space. In the next step, cost functions corresponding to all random particles are evaluated and some of those having minimum cost functions are stored. These particles are ranked and their weighted average is calculated and named Ranked Center. New solutions are produced by moving each particle along its previous motion, the ranked center, and the best particle found thus far. The robustness of this algorithm is verified by solving some mathematical and structural optimization problems. Simplicity of implementation and reaching to desired solution are two main characteristics of this algorithm.