• 제목/요약/키워드: Continuous Optimization Algorithm

검색결과 183건 처리시간 0.022초

An Improved Particle Swarm Optimization Algorithm for Care Worker Scheduling

  • Akjiratikarl, Chananes;Yenradee, Pisal;Drake, Paul R.
    • Industrial Engineering and Management Systems
    • /
    • 제7권2호
    • /
    • pp.171-181
    • /
    • 2008
  • Home care, known also as domiciliary care, is part of the community care service that is a responsibility of the local government authorities in the UK as well as many other countries around the world. The aim is to provide the care and support needed to assist people, particularly older people, people with physical or learning disabilities and people who need assistance due to illness to live as independently as possible in their own homes. It is performed primarily by care workers visiting clients' homes where they provide help with daily activities. This paper is concerned with the dispatching of care workers to clients in an efficient manner. The optimized routine for each care worker determines a schedule to achieve the minimum total cost (in terms of distance traveled) without violating the capacity and time window constraints. A collaborative population-based meta-heuristic called Particle Swarm Optimization (PSO) is applied to solve the problem. A particle is defined as a multi-dimensional point in space which represents the corresponding schedule for care workers and their clients. Each dimension of a particle represents a care activity and the corresponding, allocated care worker. The continuous position value of each dimension determines the care worker to be assigned and also the assignment priority. A heuristic assignment scheme is specially designed to transform the continuous position value to the discrete job schedule. This job schedule represents the potential feasible solution to the problem. The Earliest Start Time Priority with Minimum Distance Assignment (ESTPMDA) technique is developed for generating an initial solution which guides the search direction of the particle. Local improvement procedures (LIP), insertion and swap, are embedded in the PSO algorithm in order to further improve the quality of the solution. The proposed methodology is implemented, tested, and compared with existing solutions for some 'real' problem instances.

BIM 기반 비정형 건축물 패널화 모델 생성 방법에 관한 연구 (BIM-Based Generation of Free-form Building Panelization Model)

  • 김양길;이윤구;함남혁;김재준
    • 한국BIM학회 논문집
    • /
    • 제12권4호
    • /
    • pp.19-31
    • /
    • 2022
  • With the development of 3D-based CAD (Computer Aided Design), attempts at freeform building design have expanded to small and medium-sized buildings in Korea. However, a standardized system for continuous utilization of shape data and BIM conversion process implemented with 3D-based NURBS is still immature. Without accurate review and management throughout the Freeform building project, interference between members occurs and the cost of the project increases. This is very detrimental to the project. To solve this problem, we proposed a continuous utilization process of 3D shape information based on BIM parameters. Our process includes algorithms such as Auto Split, Panel Optimization, Excel extraction based on shape information, BIM modeling through Adaptive Component, and BIM model utilization method using ID Code. The optimal cutting reference point was calculated and the optimal material specification was derived using the Panel Optimization algorithm. With the Adaptive Component design methodology, a BIM model conforming to the standard cross-section details and specifications was uniformly established. The automatic BIM conversion algorithm of shape data through Excel extraction created a BIM model without omission of data based on the optimized panel cutting reference point and cutting line. Finally, we analyzed how to use the BIM model built for automatic conversion. As a result of the analysis, in addition to the BIM utilization plan in the general construction stage such as visualization, interference review, quantity calculation, and construction simulation, an individual management plan for the unit panel was derived through ID data input. This study suggested an improvement process by linking the existing research on atypical panel optimization and the study of parameter-based BIM information management method. And it showed that it can solve the problems of existing Freeform building project.

유전자 알고리즘을 이용한 깊은 홈 볼 베어링의 고부하용량 설계 (Genetic Algorithm Based Design of Beep Groove Ball Bearing for High-Load Capacity)

  • 윤기찬;조영석;최동훈
    • 한국윤활학회:학술대회논문집
    • /
    • 한국윤활학회 1999년도 제30회 추계학술대회
    • /
    • pp.167-173
    • /
    • 1999
  • This paper suggests a method to design the deep groove ball bearing for high-load capacity by using a genetic algorithm. The design problem of ball bearings is a typical discrete/continuous optimization problem because the deep groove ball bearing has discrete variables, such as ball size and number of balls. Thus, a genetic algorithm is employed to find the optimum values from a set of discrete design variables. The ranking process is proposed to effectively deal with the constraints in genetic algorithm. Results obtained fer several 63 series deep groove ball bearings demonstrated the effectiveness of the proposed design methodology by showing that the average basic dynamic capacities of optimally designed bearings increase about 9~34% compared with the standard ones.

  • PDF

다차원 설계윈도우 탐색법을 이용한 마이크로 액추에이터 형상설계 (Shape Design of Micro Electrostatic Actuator using Multidimensional Design Windows)

  • 정민중;김영진;다이수케이시하라;시노부요시무라;겐기야가와
    • 대한기계학회논문집A
    • /
    • 제25권11호
    • /
    • pp.1796-1801
    • /
    • 2001
  • For micro-machines, very few design methodologies based on optimization hale been developed so far. To overcome the difficulties of design optimization of micro-machines, the search method for multi-dimensional design window (DW)s is proposed. The proposed method is defined as areas of satisfactory design solutions in a design parameter space, using both continuous evolutionary algorithms (CEA) and the modified K-means clustering algorithm . To demonstrate practical performance of the proposed method, it was applied to an optimal shape design of micro electrostatic actuator of optical memory. The shape design problem has 5 design parameters and 5 objective functions, and finally shows 4 specific design shapes and design characters based on the proposed DWs.

Fitness Sharing Particle Swarm Optimization Approach to FACTS Installation for Transmission System Loadability Enhancement

  • Chang, Ya-Chin
    • Journal of Electrical Engineering and Technology
    • /
    • 제8권1호
    • /
    • pp.31-39
    • /
    • 2013
  • Proper installation of Flexible AC Transmission Systems (FACTS) devices in existing transmission networks can enable power systems to accommodate more power transfer with less network expansion cost. The problem to maximize transmission system loadability by determining optimal locations and settings for installations of two types of FACTS devices, namely static var compensator (SVC) and thyristor controlled series compensator (TCSC), is formulated as a mixed discrete-continuous nonlinear optimization problem (MDCP). For solving the MDCP, in the paper, the proposed method with fitness sharing technique involved in the updating process of the particle swarm optimization (PSO) algorithm, can diversify the particles over the search regions as much as possible, making it possible to achieve the optimal solution with a big probability. The modified IEEE-14 bus network and a practical power system are used to validate the proposed method.

크리깅모델을 이용한 자동차 도어의 구조설계 (Structural Design of an Automotive Door Using the Kriging Models)

  • 이권희;방일권
    • 한국자동차공학회논문집
    • /
    • 제15권1호
    • /
    • pp.146-153
    • /
    • 2007
  • Weight reduction for automobile components has been sought to achieve fuel efficiency and energy conservation. There are two approaches in reducing their weights. One is by using material lighter than steel, and the other is by redesigning their structures. The latter has been performed by adopting hydroforming, tailor weled blank, optimization, etc. In this research, the kriging approximation method and simulated annealing algorithm are applied to the design of a front door made by TWB (Tailor Welded Blank) technology. The design variables are set up as the thicknesses of parts and the positions of parting lines. A thickness set considered as a design variable of each part is not arbitrarily determined but selected from standard products, so it is a discrete set. This research presents the discrete and continuous structural optimization method for an automotive door design.

A Hybrid PSO-BPSO Based Kernel Extreme Learning Machine Model for Intrusion Detection

  • Shen, Yanping;Zheng, Kangfeng;Wu, Chunhua
    • Journal of Information Processing Systems
    • /
    • 제18권1호
    • /
    • pp.146-158
    • /
    • 2022
  • With the success of the digital economy and the rapid development of its technology, network security has received increasing attention. Intrusion detection technology has always been a focus and hotspot of research. A hybrid model that combines particle swarm optimization (PSO) and kernel extreme learning machine (KELM) is presented in this work. Continuous-valued PSO and binary PSO (BPSO) are adopted together to determine the parameter combination and the feature subset. A fitness function based on the detection rate and the number of selected features is proposed. The results show that the method can simultaneously determine the parameter values and select features. Furthermore, competitive or better accuracy can be obtained using approximately one quarter of the raw input features. Experiments proved that our method is slightly better than the genetic algorithm-based KELM model.

대규모 협동진화 차등진화 (Large Scale Cooperative Coevolution Differential Evolution)

  • 신성윤;탄쉬지에;신광성;이현창
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국정보통신학회 2022년도 춘계학술대회
    • /
    • pp.665-666
    • /
    • 2022
  • 미분 진화는 연속 최적화 문제에 대한 효율적인 알고리즘이다. 그러나 대규모 최적화 문제를 해결하기 위해 미분 진화를 적용하면 성능이 빠르게 저하되고 런타임이 기하급수적으로 증가한다. 이 문제를 극복하기 위해 Spark(SparkDECC라고 함)를 기반으로 하는 새로운 협력 공진화 미분 진화를 제안한다. 분할 정복 전략은 SparkDECC에서 사용된다.

  • PDF

프리플렉스교의 전산화 최적설계 (Computer-Aided Optimization of Preflex Bridges)

  • 조효남;이웅세;박정배
    • 한국전산구조공학회:학술대회논문집
    • /
    • 한국전산구조공학회 1993년도 봄 학술발표회논문집
    • /
    • pp.125-133
    • /
    • 1993
  • Preflex composit girder is intended for a better use on both steel and concrete by introducting prestress into the lower flange concrete with preflection. In Korea, recently preflex bridges are widely used especially for urban construction but the design method depends on the conventional ASD(Allowable Stress Design). This paper suggests an optimization model for the design of preflex composite bridges based on LIFD(Load Resistance Factor Design). The optimization algorithm adopted for the NLP model proposed in the paper is the FTM(Flexible Tolerance Method) which is very efficient for the approximate continuous optimization. For the discrete optimum results, a pesudo discrete optimization is used for the economical round-up to the available dimensions. The economic effectiveness of optimum design based on the LRFD method is investigation by comparing the results with those of the ASD method. Based on applications to the actual design examples, it may be concluded that the optimization model suggested in the paper provides economical but reliable design. And the suggested in the paper provides economical but reliable design. And the computer code for the automatic optimum design of preflex bridges developed in the paper for a CAD system may be successfully used in practice.

  • PDF

데이타 스트림에서의 다중 조인 질의 최적화 방법 (Optimizing Multi-way Join Query Over Data Streams)

  • 박홍규;이원석
    • 한국정보과학회논문지:데이타베이스
    • /
    • 제35권6호
    • /
    • pp.459-468
    • /
    • 2008
  • 데이타 스트림이란 실시간에 연속적으로 빠르게 생성되는 데이타 집합을 의미한다. 이러한 데이타 스트림들은 최근 사회가 발달과 더불어 정보 환경도 급속도로 발전함에 따라 센서 데이타, 교통상황 수집 자료, 웹 클릭 모니터링 등과 같은 많은 응용 분야에서 적용되고 있다. 이러한 형태의 데이트 스트립을 처리하기 위해서는 미리 등록된 질의에 대하여 새롭게 들어오는 스트림 데이타의 결과를 계속적으로 생성하게 된다. 이와 같은 이유로 끊임없이 들어오는 스트링 데이타들을 빠르게 처리하는 것이 이 분야에서 주된 이슈가 되었으며, 이를 위한 방법으로 등록된 질의들을 효율적으로 처리하기 위한 질의 최적화분야에 많은 연구가 있었다. 그러므로 본 논문에서는 기존 연구에서 사용되었던 그리디 방법을 기반으로 비용 모델을 이용하여 최소의 비용을 갖는 질의 계획을 선택하는 확장된 그리디 방법(EGA)을 제시한다. 화장된 그리디 방법은 알고리즘의 정확성이 떨어지는 그리디 알고리즘의 단점을 극복하기 위하여 비용이 가장 작은 연산하나를 선택하는 대신 비용이 자은 연산들의 집합을 선택한다. 이 연산들의 집합의 크기는 알고리즘의 정확성과 수행 시간에 영향을 끼치며, 투 개의 변수에 의해서 적응적으로 조절 수 있다. 실험에서는 다양한 스트림 환경에서 대부분 그리디 알고리즘보다 향상된 성능을 보장하고, 두 변수에 의한 알고리즘의 성능 및 수행 시간 차이를 보여줌으로써 본 알고리즘의 효율성을 검증하였다.