• Title/Summary/Keyword: grid search

Search Result 274, Processing Time 0.042 seconds

Grid Search Based Production Switching Heuristic for Aggregate Production Planning

  • Nam, Sang-Jin;Kim, Joung-Ja
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.18 no.1
    • /
    • pp.127-138
    • /
    • 1993
  • The Production Switching Heuristic (PSH) develope dby Mellichamp and Love (1978) has been suggested as a more realistic, practical and intuitively appealing approach to aggregate production planning (APP). In this researh, PSH has been modified to present a more sophisticated open grid search procedure for solving the APP problem. The effectiveness of this approach has been demonstrated by determining a better near-optimala solution to the classic paint factory problem. The performance of the modified production switching heuristic is then compared in the context of the paint factory problem with results obtained by other prominent APP models including LDR, PPP, and PSH to conclude that the modified PSH offers a better minimum cost solution than the original PSH model.

  • PDF

GRID-BASED METHODS FOR LINEARLY EQUALITY CONSTRAINED OPTIMIZATION PROBLEMS

  • Feng, Yan;Zhang, Xuesheng;Liu, Liying
    • Journal of applied mathematics & informatics
    • /
    • v.23 no.1_2
    • /
    • pp.269-279
    • /
    • 2007
  • This paper describes a direct search method for a class of linearly constrained optimization problem. Through research we find it can be treated as an unconstrained optimization problem. And with the decrease of dimension of the variables need to be computed in the algorithms, the implementation of convergence to KKT points will be simplified to some extent. Convergence is shown under mild conditions which allow successive frames to be rotated, translated, and scaled relative to one another.

Group Action Recognition through Grid search and Transformer (Grid search와 Transformer를 통한 그룹 행동 인식)

  • Gi-Duk Kim;Geun-Hoo Lee
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2023.07a
    • /
    • pp.513-515
    • /
    • 2023
  • 본 논문에서는 그리드 탐색과 트랜스포머를 사용한 그룹 행동 인식 모델을 제안한다. 추출된 여러 사람의 스켈레톤 정보를 차분 벡터, 변위 벡터, 관계 벡터로 변환하고 사람별로 묶어 이를 TimeDistributed 함수에 넣고 풀링을 한다. 이를 트랜스포머 모델의 입력으로 넣고 그룹 행동 인식 분류를 출력하였다. 논문에서 3가지 벡터를 입력으로 하여 합치고 트랜스포머 계층을 거친 모델과 3가지 벡터를 입력으로 하고 계층적으로 트랜스포머 모델을 거쳐 행동 인식 분류를 출력하는 두 가지 모델을 제안한다. 3가지 벡터를 합친 모델에서 클래스 분류 정확도는 CAD 데이터 세트 96.6%, Volleyball 데이터 세트 91.4%, 계층적 트랜스포머 모델은 CAD 데이터 세트 96.8%, Volleyball 데이터 세트 91.1%를 얻었다

  • PDF

DL-RRT* algorithm for least dose path Re-planning in dynamic radioactive environments

  • Chao, Nan;Liu, Yong-kuo;Xia, Hong;Peng, Min-jun;Ayodeji, Abiodun
    • Nuclear Engineering and Technology
    • /
    • v.51 no.3
    • /
    • pp.825-836
    • /
    • 2019
  • One of the most challenging safety precautions for workers in dynamic, radioactive environments is avoiding radiation sources and sustaining low exposure. This paper presents a sampling-based algorithm, DL-RRT*, for minimum dose walk-path re-planning in radioactive environments, expedient for occupational workers in nuclear facilities to avoid unnecessary radiation exposure. The method combines the principle of random tree star ($RRT^*$) and $D^*$ Lite, and uses the expansion strength of grid search strategy from $D^*$ Lite to quickly find a high-quality initial path to accelerate convergence rate in $RRT^*$. The algorithm inherits probabilistic completeness and asymptotic optimality from $RRT^*$ to refine the existing paths continually by sampling the search-graph obtained from the grid search process. It can not only be applied to continuous cost spaces, but also make full use of the last planning information to avoid global re-planning, so as to improve the efficiency of path planning in frequently changing environments. The effectiveness and superiority of the proposed method was verified by simulating radiation field under varying obstacles and radioactive environments, and the results were compared with $RRT^*$ algorithm output.

Membership Management based on a Hierarchical Ring for Large Grid Environments

  • Gu, Tae-Wan;Hong, Seong-Jun;Uhmn, Saang-Yong;Lee, Kwang-Mo
    • Journal of Information Processing Systems
    • /
    • v.3 no.1
    • /
    • pp.8-15
    • /
    • 2007
  • Grid environments provide the mechanism to share heterogeneous resources among nodes. Because of the similarity between grid environments and P2P networks, the structures of P2P networks can be adapted to enhance scalability and efficiency in deployment and to search for services. In this paper, we present a membership management based on a hierarchical ring which constructs P2P-like Grid environments. The proposed approach uses only a limited number of connections, reducing communication cost. Also, it only keeps local information for membership, which leads to a further reduction in management cost. This paper analyzes the performance of the approach by simulation and compares it with other approaches.

Operational Cost Minimization Considering Line Flow Limits of MIcroGrid Connection (마이크로 그리드간 선로제약을 고려한 운영비용 최소화)

  • Rhee, Sang-Bong;Kim, Kyu-Ho;Kim, Soo-Nam;Lee, Sang-Keun;Kim, Chul-Hwan
    • Proceedings of the KIEE Conference
    • /
    • 2009.07a
    • /
    • pp.151_152
    • /
    • 2009
  • The capacity constraints of tie-lines in production cost analysis are very important issues in the operation and planning of MicroGrid power systems. This paper presents the Harmony Search(HS) algorithm to solve the Economic Dispatch (ED) problem with tie-line capacity limits in MicroGrid system. The applied HS algorithm has achieved efficient and accurate solutions for three-area MicroGrid systems with renewable power units.

  • PDF

A Study on De-Identification of Metering Data for Smart Grid Personal Security in Cloud Environment

  • Lee, Donghyeok;Park, Namje
    • Journal of Multimedia Information System
    • /
    • v.4 no.4
    • /
    • pp.263-270
    • /
    • 2017
  • Various security threats exist in the smart grid environment due to the fact that information and communication technology are grafted onto an existing power grid. In particular, smart metering data exposes a variety of information such as users' life patterns and devices in use, and thereby serious infringement on personal information may occur. Therefore, we are in a situation where a de-identification algorithm suitable for metering data is required. Hence, this paper proposes a new de-identification method for metering data. The proposed method processes time information and numerical information as de-identification data, respectively, so that pattern information cannot be analyzed by the data. In addition, such a method has an advantage that a query such as a direct range search and aggregation processing in a database can be performed even in a de-identified state for statistical processing and availability.

Optimal Operation Method of Microgrid System Using DS Algorithm (DS 알고리즘을 이용한 마이크로 그리드 최적운영기법)

  • Park, Si-Na;Rhee, Sang-Bong
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.29 no.5
    • /
    • pp.34-40
    • /
    • 2015
  • This paper presents an application of Differential Search (DS) meta-heuristic optimization algorithm for optimal operation of micro grid system. DS algorithm has the benefit of high convergence rate and precision compared to other optimization methods. The micro grid system consists of a wind turbine, a diesel generator, and a fuel cell. The simulation is applied to micro grid system only. The wind turbine generator is modeled by considering the characteristics of variable output. One day load data which is divided every 20 minute and wind resource for wind turbine generator are used for the study. The method using the proposed DS algorithm is easy to implement, and the results of the convergence performance are better than other optimization algorithms.

Two-Phase Distributed Evolutionary algorithm with Inherited Age Concept

  • Kang, Young-Hoon;Z. Zenn Bien
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.101.4-101
    • /
    • 2001
  • Evolutionary algorithm has been receiving a remarkable attention due to the model-free and population-based parallel search attributes and much successful results are coming out. However, there are some problems in most of the evolutionary algorithms. The critical one is that it takes much time or large generations to search the global optimum in case of the objective function with multimodality. Another problem is that it usually cannot search all the local optima because it pays great attention to the search of the global optimum. In addition, if the objective function has several global optima, it may be very difficult to search all the global optima due to the global characteristics of the selection methods. To cope with these problems, at first we propose a preprocessing process, grid-filtering algorithm(GFA), and propose a new distributed evolutionary ...

  • PDF