• 제목/요약/키워드: SA algorithm

검색결과 283건 처리시간 0.03초

구조물의 설계 최적화를 위한 메트로폴리스 유전알고리즘의 개발 및 적용 (Development and Application of Metropolis Genetic Algorithm for the Structural Design Optimization)

  • 박균빈;류연선;김정태;조현만
    • 한국전산구조공학회:학술대회논문집
    • /
    • 한국전산구조공학회 2003년도 가을 학술발표회 논문집
    • /
    • pp.115-122
    • /
    • 2003
  • A Metropolis genetic algorithm(MGA) is developed and applied for the structural design optimization. In MGA favorable features of Metropolis algorithm in simulated annealing(SA) are incorporated in simple genetic algorithm(SGA), so that the MGA alleviates the disadvantage of finding imprecise solution in SGA and time-consuming computation in SA. Performances of MGA are compared with those of conventional algorithms such as Holland's SGA, Krishnakumar's micro genetic algorithm(μGA), and Kirkpatrick's SA. Typical numerical examples are used to evaluate the favorable features and applicability of MGA From the theoretical evaluation and numerical experience, it is concluded that the proposed MGA is a reliable and efficient tool for structural design optimization.

  • PDF

Optimization Method of Knapsack Problem Based on BPSO-SA in Logistics Distribution

  • Zhang, Yan;Wu, Tengyu;Ding, Xiaoyue
    • Journal of Information Processing Systems
    • /
    • 제18권5호
    • /
    • pp.665-676
    • /
    • 2022
  • In modern logistics, the effective use of the vehicle volume and loading capacity will reduce the logistic cost. Many heuristic algorithms can solve this knapsack problem, but lots of these algorithms have a drawback, that is, they often fall into locally optimal solutions. A fusion optimization method based on simulated annealing algorithm (SA) and binary particle swarm optimization algorithm (BPSO) is proposed in the paper. We establish a logistics knapsack model of the fusion optimization algorithm. Then, a new model of express logistics simulation system is used for comparing three algorithms. The experiment verifies the effectiveness of the algorithm proposed in this paper. The experimental results show that the use of BPSO-SA algorithm can improve the utilization rate and the load rate of logistics distribution vehicles. So, the number of vehicles used for distribution and the average driving distance will be reduced. The purposes of the logistics knapsack problem optimization are achieved.

다특성 차량경로문제에 대한 휴리스틱 알고리즘 : 국내 복합사료 업체 사례 (Heuristics for Rich Vehicle Routing Problem : A Case of a Korean Mixed Feed Company)

  • 손동훈;김화중
    • 산업경영시스템학회지
    • /
    • 제42권1호
    • /
    • pp.8-20
    • /
    • 2019
  • The vehicle routing problem is one of the vibrant research problems for half a century. Many studies have extensively studied the vehicle routing problem in order to deal with practical decision-making issues in logistics. However, developments of new logistics strategies have inevitably required investigations on solution methods for solving the problem because of computational complexity and inherent constraints in the problem. For this reason, this paper suggests a simulated annealing (SA) algorithm for a variant of vehicle routing problem introduced by a previous study. The vehicle routing problem is a multi-depot and multi-trip vehicle routing problem with multiple heterogeneous vehicles restricted by the maximum permitted weight and the number of compartments. The SA algorithm generates an initial solution through a greedy-type algorithm and improves it using an enhanced SA procedure with three local search methods. A series of computational experiments are performed to evaluate the performance of the heuristic and several managerial findings are further discussed through scenario analyses. Experiment results show that the proposed SA algorithm can obtain good solutions within a reasonable computation time and scenario analyses show that a transportation system visiting non-dedicated factories shows better performance in truck management in terms of the numbers of vehicles used and trips for serving customer orders than another system visiting only dedicated factories.

Improvement of Tomographic Imaging in Coded Aperture System based on Simulated annealing

  • Noritoshi Kitabatake;Chen, Yen-Wei;Zensyo Nakao
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2000년도 ITC-CSCC -1
    • /
    • pp.425-428
    • /
    • 2000
  • In this paper, we propose a new method based on SA(simulated annealing) with a fast algorithm for 3D image reconstructrion from the coded apereture images. The reconstructed images can be significantly improved by SA and to large computation cost of SA can be significantly reduced by the fast algorithm.

  • PDF

유전 알고리즘을 이용한 멀티프로세서 시스템에서의 태스크 스케쥴링 알고리즘 (Task Scheduling Algorithm in Multiprocessor System Using Genetic Algorithm)

  • 김현철
    • 한국멀티미디어학회논문지
    • /
    • 제9권1호
    • /
    • pp.119-126
    • /
    • 2006
  • 멀티 프로세서 시스템에서 스케쥴링은 매우 중요한 부분이지만, 최적의 해를 구하는 것이 복잡하여 최근 다양한 휴리스틱 방법들에 의한 스케쥴링 알고리즘들이 제안되고 있다. 본 논문에서는 유전 알고리즘을 이용한 새로운 스케쥴링 알고리즘을 제시한다. 또한, 해를 구하는 과정에서 시뮬레이티드 어닐링 (simulated annealing)의 확률을 이용하여 유전 알고리즘의 성능을 개선시킨다. 제시된 알고리즘은 태스크들의 최종 수행 완료 시간 (makespan)을 최소화하는 것을 목표로 한다. 모의 실험을 통하여 제시된 알고리즘이 다른 알고리즘보다 최종 수행 완료 시간이 작음을 확인할 수 있었다.

  • PDF

입체 트러스구조물의 최적설계를 위한 SA기법 (Simulated Annealing Algorithm for Optimum Design of Space Truss Structures)

  • 정제원;박효선
    • 한국전산구조공학회:학술대회논문집
    • /
    • 한국전산구조공학회 1999년도 봄 학술발표회 논문집
    • /
    • pp.102-109
    • /
    • 1999
  • Two phase simulated annealing algorithm is presented as a structural optimization technique and applied to minimum weight design of space trusses subjected to stress and displacement constraints under multiple loading conditions. Univariate searching algorithm is adopted for automatic selection of initial values of design variables for SA algorithm. The proper values of cooling factors and reasonable stopping criteria for optimum design of space truss structures are proposed to enhance the performance of optimization process. Optimum weights and design solutions are presented for two well-blown example structures and compared with those reported in the literature.

  • PDF

Simulated Annealing의 가속화와 ATM 망에서의 가상경로 설정에의 적용 (Acceleration of Simulated Annealing and Its Application for Virtual Path Management in ATM Networks)

  • 윤복식;조계연
    • 한국경영과학회지
    • /
    • 제21권2호
    • /
    • pp.125-140
    • /
    • 1996
  • Simulated annealing (SA) is a very promising general purpose algorithm which can be conveniently utilized for various complicated combinatorial optimization problems. But its slowness has been pointed as a major drawback. In this paper, we propose an accelerated SA and test its performance experimentally by applying it for two standard combinatorial optimization problems (TSP(Travelling Salesman Problem) and GPP(Graph Partitioning Problem) of various sizes. It turns out that performance of the proposed method is consistently better both in convergenge speed and the quality of solution than the conventional SA or SE (Stochastic Evolution). In the second part of the paper we apply the accelerated SA to solve the virtual path management problem encountered in ATM netowrks. The problem is modeled as a combinatorial optimization problem to optimize the utilizy of links and an efficient SA implementation scheme is proposed. Two application examples are given to demonstrate the validity of the proposed algorithm.

  • PDF

Discrete Cosine Transformer with Variable-Length Basis Vector for MPEG-4 Video Codec

  • Kuroda, Ryo;Fujita, Gen;Onoye, Takao;Shirakawa, Isao
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2000년도 ITC-CSCC -2
    • /
    • pp.811-814
    • /
    • 2000
  • It this paper a VLSI architecture of the Shape-Adaptive Discrete Cosine Transform (SA-DCT) is described, which can be employed dedicatedly for MPEG-4 video codec. Adopting a fast DCT algorithm, the number of multipliers can be reduced by half in comparison with a conventional algorithm. This SA-DCT core with a small additional amount of hardware can perform the SA-Inverse DCT (SA-IDCT) by sharing multipliers and a transportation memory. The proposed SA-DCT core is integrated with 40,000 gates by using 0.35$mu$m triple-metal CMOS technology, which operates at 20 Mhz, and hence enables the realtime codec of CIF ($352{\times}288$ pixels) pictures.

  • PDF

A Hybrid Metaheuristic for the Series-parallel Redundancy Allocation Problem in Electronic Systems of the Ship

  • Son, Joo-Young;Kim, Jae-Hwan
    • Journal of Advanced Marine Engineering and Technology
    • /
    • 제35권3호
    • /
    • pp.341-347
    • /
    • 2011
  • The redundancy allocation problem (RAP) is a famous NP.complete problem that has beenstudied in the system reliability area of ships and airplanes. Recently meta-heuristic techniques have been applied in this topic, for example, genetic algorithms, simulated annealing and tabu search. In particular, tabu search (TS) has emerged as an efficient algorithmic approach for the series-parallel RAP. However, the quality of solutions found by TS depends on the initial solution. As a robust and efficient methodology for the series-parallel RAP, the hybrid metaheuristic (TSA) that is a interactive procedure between the TS and SA (simulated annealing) is developed in this paper. In the proposed algorithm, SA is used to find the diversified promising solutions so that TS can re-intensify search for the solutions obtained by the SA. We test the proposed TSA by the existing problems and compare it with the SA and TS algorithm. Computational results show that the TSA algorithm finds the global optimal solutions for all cases and outperforms the existing TS and SA in cases of 42 and 56 subsystems.

멀티콥터 영상 전송을 위한 압축 센싱 기법 (Compressed Sensing Techniques for Video Transmission of Multi-Copter)

  • 정국현;이선의;이상화;김진영
    • 한국위성정보통신학회논문지
    • /
    • 제9권2호
    • /
    • pp.63-68
    • /
    • 2014
  • 본 논문에서는 멀티콥터의 효율적 영상 전송을 위해 필요한 압축센싱 기법을 제안한다. 제안된 구조는 압축센싱에 기반한 데이터 용량을 줄이는 것에 중점을 둔다. 우선 Spectrum sensing의 기본원리를 설명하고 AMP(Approximate Message Passing)와 CoSaMP(Compressive Sampling Matched Pursuit)을 수학적 분석과 모의실험 결과를 통해서 비교한다. 또한 두 알고리즘을 계산시간과 복잡도 관점에서 평가하고 멀티콥터 동작에 적합한 알고리즘을 제안한다. 본 논문의 실험결과는 AMP 알고리즘이 CoSaMP 알고리즘보다 계산시간이 적고 이미지 에러 확률도 낮다는 것을 보여준다.