• Title/Summary/Keyword: Annealing Algorithm

Search Result 438, Processing Time 0.026 seconds

Resolutions of NP-complete Optimization Problem (최적화 문제 해결 기법 연구)

  • Kim Dong-Yun;Kim Sang-Hui;Go Bo-Yeon
    • Journal of the military operations research society of Korea
    • /
    • v.17 no.1
    • /
    • pp.146-158
    • /
    • 1991
  • In this paper, we deal with the TSP (Traveling Salesperson Problem) which is well-known as NP-complete optimization problem. the TSP is applicable to network routing. task allocation or scheduling. and VLSI wiring. Well known numerical methods such as Newton's Metheod. Gradient Method, Simplex Method can not be applicable to find Global Solution but the just give Local Minimum. Exhaustive search over all cyclic paths requires 1/2 (n-1) ! paths, so there is no computer to solve more than 15-cities. Heuristic algorithm. Simulated Annealing, Artificial Neural Net method can be used to get reasonable near-optimum with polynomial execution time on problem size. Therefore, we are able to select the fittest one according to the environment of problem domain. Three methods are simulated about symmetric TSP with 30 and 50-city samples and are compared by means of the quality of solution and the running time.

  • PDF

Output encoding methods for the design of insturction decoder (명령어 해독기 설계를 위한 출력 부호화 방법)

  • 김한흥;황승호;경종민
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.31A no.10
    • /
    • pp.132-140
    • /
    • 1994
  • In this paper, we consider the area-minimal implementation of the instruction decoder for microprogrammed processors such as modern CISC-type microprocessor. We formulate it as a constrained output encoding problem and, based on simulated annealing algorithm, propose efficient heuristic solution methods both for PLA and multi-level implementation of the decoder. Experimental results on various examples show that our methods produce, on the average, 10~40% reduction of the number of product terms for the PLA implementations and 9.8~34.4% reduction of the number of literal for the multi-level implementations compared to the results of random encoding method.

  • PDF

A Study on the Optimal Allocation of Irregular Shapes and Cutting Path Optimization (임의 형상 부재의 최적배치 및 절단 경로 최적화에 관한 연구)

  • 한윤근;장창두
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 1999.04a
    • /
    • pp.27-33
    • /
    • 1999
  • This paper describes a new algorithm for irregular shapes allocation (known as nesting) and cutting path optimization, both implemented in PC-based software with graphic user interface (GUI). Main characteristic of the nesting W is that it deals with only vertices of Placed Pieces to reduce calculation time and for effective allocation. And the other characteristic of the nesting program is that every parts are grouped with respect to their areas and placed along the column of placement region. The cutting paths can be determined by an optimization method called simulated annealing. It was shown that the developed code is superior to other previous nesting H in elapsed time and waste ratio.

  • PDF

Heuristics for Synchronization of Production and Transportation Planning in the Supply Chain (공급사슬에서 생산 및 물류의 동기화를 위한 발견적 기법)

  • Jeong Jeong-U;Lee Yeong-Hae
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2006.05a
    • /
    • pp.159-166
    • /
    • 2006
  • The aim of synchronization of production and transportation planning in the supply chain is to increase the flexibility and to decrease various costs. The suggested model in this study synchronizes the timing to supply to a downstream manufacturer directly after production and to be consumed in a downstream manufacturer right after receipt. This model deals with the frequent delivery in small amount which is a new trend of the transportation not governed the economy of scale principle. Moreover, various types of transportation governed by the economy of scale principle or not are considered. Then, the two-phase mathematical model is suggested to obtain optimal job sequence and production quantity for each tasks. But, it is difficult to gain optimal solutions if there is a transportation governed by the economy of scale principle in the supply chain, or the size of the problem is increased. Thus, heuristic algorithms based on simulated annealing and genetic algorithm are suggested to find good solutions in the reasonable time.

  • PDF

An investigation of non-linear optimization methods on composite structures under vibration and buckling loads

  • Akbulut, Mustafa;Sarac, Abdulhamit;Ertas, Ahmet H.
    • Advances in Computational Design
    • /
    • v.5 no.3
    • /
    • pp.209-231
    • /
    • 2020
  • In order to evaluate the performance of three heuristic optimization algorithms, namely, simulated annealing (SA), genetic algorithm (GA) and particle swarm optimization (PSO) for optimal stacking sequence of laminated composite plates with respect to critical buckling load and non-dimensional natural frequencies, a multi-objective optimization procedure is developed using the weighted summation method. Classical lamination theory and first order shear deformation theory are employed for critical buckling load and natural frequency computations respectively. The analytical critical buckling load and finite element calculation schemes for natural frequencies are validated through the results obtained from literature. The comparative study takes into consideration solution and computational time parameters of the three algorithms in the statistical evaluation scheme. The results indicate that particle swarm optimization (PSO) considerably outperforms the remaining two methods for the special problem considered in the study.

Optimal Scheduling of Multi-product Batch Process for Common Intermediate Storage Policy; A Model for Batch Process Automation (다품종용 회분식 공정에서의 중간 저장 탱크 공유를 위한 최적 생산계획 ; 회분식 조업의 자동화 모델)

  • 정재학;이인범;양대륙;장근수
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1992.10a
    • /
    • pp.303-308
    • /
    • 1992
  • In this study, we propose a shared storage system which is more efficient policy than MIS(Mixed Intermediate Storage) policy for relatively rare storage system and can be called CIS(Common Intermediate Storage) policy. Using this strategy, we develop a new completion time algorithm and apply it to two kinds of optimal or near optimal scheduling method; combinatorial search and simulated annealing method. We also extend this strategy to other storage policy, for example MIS policy, with PLC(Programmable Logic Controller) logic and on/off action of electronic valves. It thus can be accepted as a basic form of FMS(Flexible Manufacturing System) for operating various storage policies. Finally we suggest the interlocking block to compansate for the shortcoming of CIS policy, i.e, complication of operation and safety, resulting in a basic batch process automation mode.

  • PDF

Image Security and Personal Identification using CGH and Phase Mask (CGH와 위상 마스크를 이용한 영상 보안 및 개인 인증)

  • 김종윤;박세준;김종찬;김철수;조웅호;김수중
    • Proceedings of the IEEK Conference
    • /
    • 1999.06a
    • /
    • pp.958-961
    • /
    • 1999
  • A new image encoding and identification scheme is proposed for security verification by using CGH(computer generated hologram), random phase mask, and correlation technique. The encrypted image, which is attached to the security product, is made by multiplying QPH(quadratic phase hologram) using SA(simulated annealing) algorithm with a random phase function. The random phase function plays a role of key when the encrypted image is decrypted. The encrypted image could be optically recovered by 2-f system and automatically verified for personal identification. Simulation results show the proposed method cand be used for the reconstruction and the recognition of the encrypted. Image.

  • PDF

Simultaneous Optimization of Level of Repair and Spare Parts Allocation for MIME Systems under Availability Constraint with Simulation and a Meta-heuristic (가용도 제약하에 시뮬레이션과 메타 휴리스틱을 이용한 MIME 시스템의 수리수준 및 수리부속 할당 동시 최적화)

  • Chung, Il-Han;Yun, Won-Young;Kim, Ho-Gyun
    • Korean Management Science Review
    • /
    • v.26 no.1
    • /
    • pp.209-223
    • /
    • 2009
  • In this paper, an analysis problem of repair levels and spare part allocation for MIME(Multi indenture multi echelon) systems is studied using simulation and meta-heuristics. We suggest a method to determine simultaneously repair levels and spare parts allocation to minimize the life cycle cost of MIME system under availability constraint. A simulated annealing method is used to analyze the repair levels and genetic algorithm is used to obtain the optimal allocation of spare parts. We also develop a simulation system to calculate the life cycle cost and system availability. Some numerical examples are also studied.

Optimal Loudspeaker Positions of an Active Noise Control System with an Opening in an Enclosure (개구부를 가지는 실내의 능동소음제어시스템에서의 최적스피커 위치)

  • 백광현
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2003.11a
    • /
    • pp.788-791
    • /
    • 2003
  • Optimal loudspeaker positions are important as much as the control algorithms and hardware performance in the active noise control system. This study is similar to the past researches on the optimal transducer locations but with a far field noise source having a plane wave characteristic and the noise coming through an opening such as a window in the enclosure. An optimization technique called simulated annealing algorithm is used to find a set of optimal loudspeaker positions from a larger possible loudspeaker positions. Loudspeakers are placed on the surface of opening at the wail. Using the measured acoustic transfer impedances and numerical simulations with the optimization technique, optimal positions we identified and compared. When a small number of loudspeakers are used, loudspeaker positions on the opening near the center seems to be the best place, but when a larger number of loudspeakers are used it was difficult to find simple patterns Un the optimal positions.

  • PDF

A Study on the Optimum Structural Design for Oil Tankers Using Multi-Objective Optimization

  • Jang, Chang-Doo;Shin, Sang-Hun
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 1998.04a
    • /
    • pp.245-253
    • /
    • 1998
  • Recently, the importance of multi-objective optimization techniques and stochastic search methods is increasing. The stochastic search methods have the concepts of the survival of the fittest and natural selection such as genetic algorithms(GA), simulated annealing(SA) and evolution strategies (ES). As many accidents of oil tankers cause marine pollution, oil tankers of double hull or mid deck structure are being built to minimize the marine pollution. For the improvement of oil tanker design technique, an efficient optimization technique is proposed in this study. Multi-objective optimization problem of weight and cost of double hull and mid deck tanker is formulated. Discrete design variables are used considering real manufacturing, and the concept of relative production cost is also introduced. The ES method is used as an optimization technique, and the ES algorithm was developed to generate a more efficient Pareto optimal set.

  • PDF