• Title/Summary/Keyword: 신장트리 기반 유전자 알고리즘

Search Result 3, Processing Time 0.016 seconds

Solving Nonlinear Fixed Charge Transportation Problem by Spanning Tree-based Genetic Algorithm (신장트리 기반 유전자 알고리즘에 의한 비선형 fcTP 해법)

  • Jo, Jung-Bok;Ko, Suc-Bum;Gen, Mitsuo
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.8
    • /
    • pp.752-758
    • /
    • 2005
  • The transportation problem (TP) is known as one of the important problems in Industrial Engineering and Operational Research (IE/OR) and computer science. When the problem is associated with additional fixed cost for establishing the facilities or fulfilling the demand of customers, then it is called fixed charge transportation problem (fcTP). This problem is one of NP-hard problems which is difficult to solve it by traditional methods. This paper aims to show the application of spanning-tree based Genetic Algorithm (GA)approach for solving nonlinear fixed charge transportation problem. Our new idea lies on the GA representation that includes the feasibility criteria and repairing procedure for the chromosome. Several numerical experimental results are presented to show the effectiveness of the proposed method.

A Multi-objective Genetic Algorithm for Tree-based Routing in WSN Having High Mobile Base Node (베이스 노드의 이동성이 큰 센서 네트워크에서 트리기반 라우팅을 위한 다목적 유전자 알고리즘)

  • Kang, Seung-Ho;Kim, Ki-Young;Pyo, Se-Jun;Kang, Il-Woo;Lee, Seong-Ro;Jung, Min-A
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2010.04a
    • /
    • pp.627-630
    • /
    • 2010
  • 무선 센서 & 액터 네트워크(WSAN)와 같이 다수의 베이스 노드가 존재하거나 베이스 노드의 이동성이 큰 센서 네트워크에서 최소 Wiener수 신장 트리(MWST)기반 라우팅 방법은 최소 신장 트리(MST)기반 라우팅 방법에 비해 패킷 전송 거리가 짧고 전력 소모가 적다. 하지만 주어진 그래프로부터 최소 Wiener 수 신장 트리를 찾는 문제는 NP-hard 문제이고 최소 신장 트리에 비해 네트워크 수명이 짧은 단점이 있다. 본 논문은 이러한 문제를 해결하고자 Wiener 수 적응도, 네트워크 수명 적응도, 차수 적응도 등을 동시에 고려한 다목적 유전자 알고리즘을 설계하고 네트워크 전체 전력 소모를 크게 증가시키지 않으면서도 네트워크의 수명을 Wiener 수 적응도만을 사용했을 때 보다 연장시킴을 실험을 통해 보인다.

Local Shape Analysis of the Hippocampus using Hierarchical Level-of-Detail Representations (계층적 Level-of-Detail 표현을 이용한 해마의 국부적인 형상 분석)

  • Kim Jeong-Sik;Choi Soo-Mi;Choi Yoo-Ju;Kim Myoung-Hee
    • The KIPS Transactions:PartA
    • /
    • v.11A no.7 s.91
    • /
    • pp.555-562
    • /
    • 2004
  • Both global volume reduction and local shape changes of hippocampus within the brain indicate their abnormal neurological states. Hippocampal shape analysis consists of two main steps. First, construct a hippocampal shape representation model ; second, compute a shape similarity from this representation. This paper proposes a novel method for the analysis of hippocampal shape using integrated Octree-based representation, containing meshes, voxels, and skeletons. First of all, we create multi-level meshes by applying the Marching Cube algorithm to the hippocampal region segmented from MR images. This model is converted to intermediate binary voxel representation. And we extract the 3D skeleton from these voxels using the slice-based skeletonization method. Then, in order to acquire multiresolutional shape representation, we store hierarchically the meshes, voxels, skeletons comprised in nodes of the Octree, and we extract the sample meshes using the ray-tracing based mesh sampling technique. Finally, as a similarity measure between the shapes, we compute $L_2$ Norm and Hausdorff distance for each sam-pled mesh pair by shooting the rays fired from the extracted skeleton. As we use a mouse picking interface for analyzing a local shape inter-actively, we provide an interaction and multiresolution based analysis for the local shape changes. In this paper, our experiment shows that our approach is robust to the rotation and the scale, especially effective to discriminate the changes between local shapes of hippocampus and more-over to increase the speed of analysis without degrading accuracy by using a hierarchical level-of-detail approach.