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

검색결과 569건 처리시간 0.027초

4개 시간구간에 의한 가변속도 차량경로해법 (A Possible Heuristic for Variable Speed Vehicle Routing Problem with 4 Time Zone)

  • 문기주;박성미
    • 산업경영시스템학회지
    • /
    • 제35권4호
    • /
    • pp.171-178
    • /
    • 2012
  • A possible heuristic to solve metropolitan area vehicle routing problems with variable vehicle speeds is suggested in this research. Delivery hours are classified into 4 different time zones to make variable vehicle speeds no change within the same time zone to make TDVRP simple to solve. The suggested heuristic consists of 2 stages such as initial solution development step and initial solution improvement step. A computer program using C++ is constructed to evaluate the suggested heuristic. Randomly generated vehicle routing problems are used for the experiments. This heuristic could be helpful to logistics companies by increasing delivery efficiencies since the 4 zone classification is taken from the observed traffic information offered by a local government.

HS 최적화 알고리즘을 이용한 계단응답과 연속시스템 인식 (Identification of Continuous System from Step Response using HS Optimization Algorithm)

  • 이태봉;손진근
    • 전기학회논문지P
    • /
    • 제65권4호
    • /
    • pp.292-297
    • /
    • 2016
  • The first-order plus dead time(FOPDT) and second-order plus dead time(SOPDT), which describes a linear monotonic process quite well in most chemical and industrial processes and is often sufficient for PID and IMC controller tuning. This paper presents an application of heuristic harmony search(HS) optimization algorithm to the identification of linear continuous time-delay systems from step response. This recently developed HS algorithm is conceptualized using the musical process of searching for a perfect state of harmony. It uses a stochastic random search instead of a gradient search so that derivative information is unnecessary. The effectiveness of the proposed identification method has been demonstrated through a number of simulation examples.

A novel heuristic search algorithm for optimization with application to structural damage identification

  • Nobahari, Mehdi;Ghasemi, Mohammad Reza;Shabakhty, Naser
    • Smart Structures and Systems
    • /
    • 제19권4호
    • /
    • pp.449-461
    • /
    • 2017
  • One of the most recent methods of structural damage identification is using the difference between structures responses after and before damage occurrence. To do this one can formulate the damage detection problem as an inverse optimization problem where the extents of damage in each element are considered as the optimizations variables. To optimize the objective function, heuristic methods such as GA, PSO etc. are widely utilized. In this paper, inspired by animals such as bat, dolphin, oilbird, shrew etc. that use echolocation for finding food, a new and efficient method, called Echolocation Search Algorithm (ESA), is proposed to properly identify the site and extent of multiple damage cases in structural systems. Numerical results show that the proposed method can reliably determine the location and severity of multiple damage cases in structural systems.

A hybrid CSS and PSO algorithm for optimal design of structures

  • Kaveh, A.;Talatahari, S.
    • Structural Engineering and Mechanics
    • /
    • 제42권6호
    • /
    • pp.783-797
    • /
    • 2012
  • A new hybrid meta-heuristic optimization algorithm is presented for design of structures. The algorithm is based on the concepts of the charged system search (CSS) and the particle swarm optimization (PSO) algorithms. The CSS is inspired by the Coulomb and Gauss's laws of electrostatics in physics, the governing laws of motion from the Newtonian mechanics, and the PSO is based on the swarm intelligence and utilizes the information of the best fitness historically achieved by the particles (local best) and by the best among all the particles (global best). In the new hybrid algorithm, each agent is affected by local and global best positions stored in the charged memory considering the governing laws of electrical physics. Three different types of structures are optimized as the numerical examples with the new algorithm. Comparison of the results of the hybrid algorithm with those of other meta-heuristic algorithms proves the robustness of the new algorithm.

계층적 분할 방법과 최적화를 이용한 간호원 로스터링 해법연구 (Hybrid Heuristic Using Hierarchical Decomposition and Optimization for the Nurse Rostering Problem)

  • 장윤희;김선훈;이영훈
    • 대한산업공학회지
    • /
    • 제40권2호
    • /
    • pp.184-194
    • /
    • 2014
  • Numerous studies have been studied to provide an efficient solution for the Nurse Rostering Problem (NRP), most of which have suffered from its complexity arising from incorporating nurse's work shift and ability. The test-bed data for the NRP is released for the public Competition in 2010. This study suggests a new mixed integer programming for Nurse Rostering Problem and develops a hybrid approach, where a hierarchical decomposition and the corresponding optimization are combined. The computation experiment is performed to show that the suggested algorithms may give a better solution in various instances, compared to the one appeared in the literature.

공학설계 최적화 문제 해결을 위한 GA-VNS-HC 접근법 (GA-VNS-HC Approach for Engineering Design Optimization Problems)

  • 윤영수
    • 한국산업정보학회논문지
    • /
    • 제27권1호
    • /
    • pp.37-48
    • /
    • 2022
  • 본 연구에서는 공학설계 최적화 문제 해결을 위한 혼합 메타휴리스틱(Hybrid Meta-heuristic) 접근법을 제안된다. 공학 설계 최적화 문제는 다양한 형태의 변수를 가지며, 복잡한 제약조건들하에서 그 최적해를 구하는 문제로 이미 많은 기존 연구들을 통해 다양한 접근법들이 개발되어져 왔다. 하지만 그 효율성은 아직까지 크게 개선되지 못하고 있는 실정이다. 따라서 본 연구에서는 이러한 효율성을 개선하기 위한 새로운 접근법을 제안한다. 제안된 혼합 메타휴리스틱 접근법은 탐색 공간에 대한 전역적 탐색을 위해 유전알고리즘(Genetic Algorithm: GA) 접근법, 지역적 탐색을 위해 변동이웃탐색(Variable Neighborhood Search: VNS) 접근법과 언덕오르기(Hill Climbing: HC) 접근법을 혼합(GA-VNS-HC)하였다. 사례 연구에서는 다양한 형태의 공학설계 최적화 문제를 이용하여 본 연구에서 제안한 GA-VNS-HC 접근법의 우수성을 입증하였다.

A Dynamic Programming Approach to PCB Assembly Optimization for Surface Mounters

  • Park, Tae-Hyoung;Kim, Nam
    • International Journal of Control, Automation, and Systems
    • /
    • 제5권2호
    • /
    • pp.192-199
    • /
    • 2007
  • This paper proposes a new printed circuit board (PCB) assembly planning method for multi-head surface mounters. We present an integer programming formulation for the optimization problem, and propose a heuristic method to solve the large NP-complete problem within a reasonable time. A dynamic programming technique is then applied to the feeder arrangement optimization and placement sequence optimization to reduce the overall assembly time. Comparative simulation results are finally presented to verify the usefulness of the proposed method.

S 모양 가상재료를 이용한 위상최적화 (Topology Optimization using S-shape material model)

  • 윤길호;김윤영
    • 대한기계학회:학술대회논문집
    • /
    • 대한기계학회 2000년도 추계학술대회논문집A
    • /
    • pp.345-350
    • /
    • 2000
  • In this paper, we introduce a new artificial material model for topology optimization. The present material model, named S-shape material model, accelerates topology optimization process especially in mathematical programming. We overcome the instability and the flatness in heuristic optimization process. Numerical examples show the superiority of the proposed material.

  • 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.