• 제목/요약/키워드: Meta Heuristics

검색결과 49건 처리시간 0.021초

대기시간 최소화 문제를 위한 메타 휴리스틱 해법의 개발 (Developing Meta heuristics for the minimum latency problem)

  • 양병학
    • 대한안전경영과학회지
    • /
    • 제11권4호
    • /
    • pp.213-220
    • /
    • 2009
  • The minimum latency problem, also known as the traveling repairman problem and the deliveryman problem is to minimize the overall waiting times of customers, not to minimize their routing times. In this research, a genetic algorithm, a clonal selection algorithm and a population management genetic algorithm are introduced. The computational experiment shows the objective value of the clonal selection algorithm is the best among the three algorithms and the calculating time of the population management genetic algorithm is the best among the three algorithms.

Optimum design of steel frame structures by a modified dolphin echolocation algorithm

  • Gholizadeh, Saeed;Poorhoseini, Hamed
    • Structural Engineering and Mechanics
    • /
    • 제55권3호
    • /
    • pp.535-554
    • /
    • 2015
  • Dolphin echolocation (DE) optimization algorithm is a recently developed meta-heuristic in which echolocation behavior of Dolphins is utilized for seeking a design space. The computational performance of meta-heuristic algorithms is highly dependent to its internal parameters. But the computational time of adjusting these parameters is usually extensive. The DE is an efficient optimization algorithm as it includes few internal parameters compared with other meta-heuristics. In the present paper a modified Dolphin echolocation (MDE) algorithm is proposed for optimization of steel frame structures. In the MDE the step locations are determined using one-dimensional chaotic maps and this improves the convergence behavior of the algorithm. The effectiveness of the proposed MDE algorithm is illustrated in three benchmark steel frame optimization test examples. Results demonstrate the efficiency of the proposed MDE algorithm in finding better solutions compared to standard DE and other existing algorithms.

Simplified dolphin echolocation algorithm for optimum design of frame

  • Kaveh, Ali;Vaez, Seyed Rohollah Hoseini;Hosseini, Pedram
    • Smart Structures and Systems
    • /
    • 제21권3호
    • /
    • pp.321-333
    • /
    • 2018
  • Simplified Dolphin Echolocation (SDE) algorithm is a recently developed meta-heuristic algorithm. This algorithm is an improved and simplified version of the Dolphin Echolocation Optimization (DEO) method, based on the baiting behavior of the dolphins. The main advantage of the SDE algorithm is that it needs no empirical parameter. In this paper, the SDE algorithm is applied for optimization of three well-studied frame structures. The designs are then compared with those of other meta-heuristic methods from the literature. Numerical results show the efficiency of the SDE algorithm and its competitive ability with other well-established meta-heuristics methods.

A new hybrid optimization algorithm based on path projection

  • Gharebaghi, Saeed Asil;Ardalan Asl, Mohammad
    • Structural Engineering and Mechanics
    • /
    • 제65권6호
    • /
    • pp.707-719
    • /
    • 2018
  • In this article, a new method is introduced to improve the local search capability of meta-heuristic algorithms using the projection of the path on the border of constraints. In a mathematical point of view, the Gradient Projection Method is applied through a new approach, while the imposed limitations are removed. Accordingly, the gradient vector is replaced with a new meta-heuristic based vector. Besides, the active constraint identification algorithm, and the projection method are changed into less complex approaches. As a result, if a constraint is violated by an agent, a new path will be suggested to correct the direction of the agent's movement. The presented procedure includes three main steps: (1) the identification of the active constraint, (2) the neighboring point determination, and (3) the new direction and step length. Moreover, this method can be applied to some meta-heuristic algorithms. It increases the chance of convergence in the final phase of the search process, especially when the number of the violations of the constraints increases. The method is applied jointly with the authors' newly developed meta-heuristic algorithm, entitled Star Graph. The capability of the resulted hybrid method is examined using the optimal design of truss and frame structures. Eventually, the comparison of the results with other meta-heuristics of the literature shows that the hybrid method is successful in the global as well as local search.

Meta-Heuristic Algorithms for a Multi-Product Dynamic Lot-Sizing Problem with a Freight Container Cost

  • Kim, Byung-Soo;Lee, Woon-Seek
    • Industrial Engineering and Management Systems
    • /
    • 제11권3호
    • /
    • pp.288-298
    • /
    • 2012
  • Lot sizing and shipment scheduling are two interrelated decisions made by a manufacturing plant and a third-party logistics distribution center. This paper analyzes a dynamic inbound ordering problem and shipment problem with a freight container cost, in which the order size of multiple products and single container type are simultaneously considered. In the problem, each ordered product placed in a period is immediately shipped by some freight containers in the period, and the total freight cost is proportional to the number of containers employed. It is assumed that the load size of each product is equal and backlogging is not allowed. The objective of this study is to simultaneously determine the lot-sizes and the shipment schedule that minimize the total costs, which consist of production cost, inventory holding cost, and freight cost. Because the problem is NP-hard, we propose three meta-heuristic algorithms: a simulated annealing algorithm, a genetic algorithm, and a new population-based evolutionary meta-heuristic called self-evolution algorithm. The performance of the meta-heuristic algorithms is compared with a local search heuristic proposed by the previous paper in terms of the average deviation from the optimal solution in small size problems and the average deviation from the best one among the replications of the meta-heuristic algorithms in large size problems.

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

  • 정일한;윤원영;김호균
    • 경영과학
    • /
    • 제26권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.

Gamma ray interactions based optimization algorithm: Application in radioisotope identification

  • Ghalehasadi, Aydin;Ashrafi, Saleh;Alizadeh, Davood;Meric, Niyazi
    • Nuclear Engineering and Technology
    • /
    • 제53권11호
    • /
    • pp.3772-3783
    • /
    • 2021
  • This work proposes a new efficient meta-heuristic optimization algorithm called Gamma Ray Interactions Based Optimization (GRIBO). The algorithm mimics different energy loss processes of a gamma-ray photon during its passage through a matter. The proposed novel algorithm has been applied to search for the global minima of 30 standard benchmark functions. The paper also considers solving real optimization problem in the field of nuclear engineering, radioisotope identification. The results are compared with those obtained by the Particle Swarm Optimization, Genetic Algorithm, Gravitational Search Algorithm and Grey Wolf Optimizer algorithms. The comparisons indicate that the GRIBO algorithm is able to provide very competitive results compared to other well-known meta-heuristics.

Differential Evolution Algorithms Solving a Multi-Objective, Source and Stage Location-Allocation Problem

  • Thongdee, Thongpoon;Pitakaso, Rapeepan
    • Industrial Engineering and Management Systems
    • /
    • 제14권1호
    • /
    • pp.11-21
    • /
    • 2015
  • The purpose of this research is to develop algorithms using the Differential Evolution Algorithm (DE) to solve a multi-objective, sources and stages location-allocation problem. The development process starts from the design of a standard DE, then modifies the recombination process of the DE in order improve the efficiency of the standard DE. The modified algorithm is called modified DE. The proposed algorithms have been tested with one real case study (large size problem) and 2 randomly selected data sets (small and medium size problems). The computational results show that the modified DE gives better solutions and uses less computational time than the standard DE. The proposed heuristics can find solutions 0 to 3.56% different from the optimal solution in small test instances, while differences are 1.4-3.5% higher than that of the lower bound generated by optimization software in medium and large test instances, while using more than 99% less computational time than the optimization software.

Examination of three meta-heuristic algorithms for optimal design of planar steel frames

  • Tejani, Ghanshyam G.;Bhensdadia, Vishwesh H.;Bureerat, Sujin
    • Advances in Computational Design
    • /
    • 제1권1호
    • /
    • pp.79-86
    • /
    • 2016
  • In this study, the three different meta-heuristics namely the Grey Wolf Optimizer (GWO), Stochastic Fractal Search (SFS), and Adaptive Differential Evolution with Optional External Archive (JADE) algorithms are examined. This study considers optimization of the planer frame to minimize its weight subjected to the strength and displacement constraints as per the American Institute of Steel and Construction - Load and Resistance Factor Design (AISC-LRFD). The GWO algorithm is associated with grey wolves' activities in the social hierarchy. The SFS algorithm works on the natural phenomenon of growth. JADE on the other hand is a powerful self-adaptive version of a differential evolution algorithm. A one-bay ten-story planar steel frame problem is examined in the present work to investigate the design ability of the proposed algorithms. The frame design is produced by optimizing the W-shaped cross sections of beam and column members as per AISC-LRFD standard steel sections. The results of the algorithms are compared. In addition, these results are also mapped with other state-of-art algorithms.

액적 충돌 현상기반 최적알고리즘의 비교 (Meta-Heuristic Algorithm Comparison for Droplet Impingements)

  • 문주현
    • 한국분무공학회지
    • /
    • 제28권4호
    • /
    • pp.161-168
    • /
    • 2023
  • Droplet impingement on solid surfaces is pivotal for a range of spray and heat transfer processes. This study aims to optimize the cooling performance of single droplet impingement on heated textured surfaces. We focused on maximizing the cooling effectiveness or the total contact area at the droplet maximum spread. For efficient estimation of the optimal values of the unknown variables, we introduced an enhanced Genetic Algorithm (GA) and Particle swarm optimization algorithm (PSO). These novel algorithms incorporate its developed theoretical backgrounds to compare proper optimized results. The comparison, considering the peak values of objective functions, computation durations, and the count of penalty particles, confirmed that PSO method offers swifter and more efficient searches, compared to GA algorithm, contributing finding the effective way for the spray and droplet impingement process.