• 제목/요약/키워드: Hierarchical planning

검색결과 225건 처리시간 0.023초

자기조직화 신경망과 계층적 군집화 기법(SONN-HC)을 이용한 인터넷 뱅킹의 고객세분화 모형구축 (Customer Segmentation Model for Internet Banking using Self-organizing Neural Networks and Hierarchical Gustering Method)

  • 신택수;홍태호
    • Asia pacific journal of information systems
    • /
    • 제16권3호
    • /
    • pp.49-65
    • /
    • 2006
  • This study proposes a model for customer segmentation using the psychological characteristics of Internet banking customers. The model was developed through two phased clustering method, called SONN-HC by integrating self-organizing neural networks (SONN) and hierarchical clustering (HC) method. We applied the SONN-HC method to internet banking customer segmentation and performed an empirical analysis with 845 cases. The results of our empirical analysis show the psychological characteristics of Internet banking customers have significant differences among four clusters of the customers created by SONN-HC. From these results, we found that the psychological characteristics of Internet banking customers had an important role of planning a strategy for customer segmentation in a financial institution.

SCP-Matrix based shipyard APS design: Application to long-term production plan

  • Nam, SeungHoon;Shen, HuiQiang;Ryu, Cheolho;Shin, Jong Gye
    • International Journal of Naval Architecture and Ocean Engineering
    • /
    • 제10권6호
    • /
    • pp.741-761
    • /
    • 2018
  • A shipyard is an Engineer To Order (ETO) company that designs and manufactures new products when orders are placed. Various tasks are concurrently performed, thereby making process management considerably important. It is particularly important to plan and control production activities because production constitutes the largest part of the overall process. Therefore, this study focuses on the development of a production planning system based on an Advanced Planning System (APS). An APS is an integrated planning system that targets supply chain processes in accordance with the principles of hierarchical planning. In this study, a Supply Chain Planning Matrix (SCP-Matrix), which is used as a guideline for APS development, is designed through analysis of shipyard cases. Then, we define the process in detail, starting from long-term production plan as the initial application, and design and implement a long-term production planning system using a component-based development.

동적 이벤트를 고려한 수주생산환경의 계층적 생산계획 및 통제 시스템 (A Hierarchical Production Planning and Control System in a Make-to-Order Environment with Dynamic Events)

  • 장길상;김재균
    • 산업공학
    • /
    • 제14권1호
    • /
    • pp.9-19
    • /
    • 2001
  • Production planning and control system plays an important role in manufacturing companies because it determines all production capacity planning, material procurement planning, and production scheduling which are needed in the process of producing products. Many researches on production planning and control system have been conducted for many manufacturing companies for recent decade. But, a considerable research achievement has mainly been obtained on the forecast-driven production for a make-to-stock and an assemble-to-order. The reason is that there are some hardships such as difficulties of standardizing product information, the frequent changes of design and material, and the unexpected dynamic events that influence the production of customer's order in a make-to-order or an engineering-to-order environments. By these characteristics and their complexities, some studies for production planning and control system in a make-to-order environment are presented recently. In this paper, we present the framework of the hietachical production planning and control for a make-to-order environment with dynamic events. In order to illustrate the usefulness of the proposed framework for a hietachical production planning and control, the information system for a make-to-order production was implemented with the object of the company of producing electricity transformer.

  • PDF

다양한 위협 하에서 복수 무인기의 경로점 계획을 위한 계층적 입자 군집 최적화 (Hierarchical Particle Swarm Optimization for Multi UAV Waypoints Planning Under Various Threats)

  • 정원모;김명건;이산하;이상필;박춘신;손흥선
    • 한국항공우주학회지
    • /
    • 제50권6호
    • /
    • pp.385-391
    • /
    • 2022
  • 본 논문에서는 경사 하강법 기반의 경로 생성(GBPP)과 입자 군집 최적화(PSO)를 결합하여 3차원 공간에서 금지구역, 지형정보, 고정익 특성 등을 고려한 경로 생성 알고리즘을 제안한다. 기존의 GBPP 방법의 경우 빠르게 경로 생성이 가능하지만 초기 경로에 따라 지역적 최적 값에 빠져 안전하지 않은 경로가 생성될 수 있다. 유전 알고리즘(GA)과 PSO 등 생물학에서 영감을 받은 군집 지능 알고리즘들의 경우 다양한 경로들을 샘플링하여 지역적 최적 값 문제를 해결할 수 있다. 다만 무인기와 경로점 개수가 증가하여 최적 변수가 증가할 경우 군집 개수를 늘려야 하고 계산 시간이 크게 증가한다. 두 알고리즘 단점을 보완하고자 본 연구에서는 GBPP 입력 값인 초기경로를 수평, 수직 방향에 대한 변위 두 가지 변수로 정의하고 이를 PSO 변수로 정의하여 계층적 경로 최적화 알고리즘 HPSO를 제안한다. 제안한 알고리즘은 통용되는 비행 제어 컴퓨터(FCC)의 software-in-the-loop simulation(SILS)을 사용하여 고정익 무인기에 대한 사용 가능성을 검증하였다.

자율주행로봇의 최소경로계획을 위한 그래프 탐색 방법 (A Graph Search Method for Shortest Path-Planning of Mobile Robots)

  • 유진오;채호병;박태형
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2006년 학술대회 논문집 정보 및 제어부문
    • /
    • pp.184-186
    • /
    • 2006
  • We propose a new method for shortest path planning of mobile robots. The topological information of the graph is obtained by thinning method to generate the collision-free path of robot. And the travelling path is determined through hierarchical planning stages. The first stage generates an initial path by use of Dijkstra's algorithm. The second stage then generates the final path by use of dynamic programming (DP). The DP adjusts the intial path to reduce the total travelling distance of robot. Simulation results are presented to verify the performance of the proposed method.

  • PDF

A Software Design Methodology for Designing APS (Activity Planning System)

  • Baik, Doo-Kwon
    • 대한산업공학회지
    • /
    • 제13권2호
    • /
    • pp.47-57
    • /
    • 1987
  • 본 논문의 주된 목적은 APS(Activity Planning System)라고 불리우는 활동계획을 위한 간단한 대화식 소프트웨어 시스템을 설계하는데 있다. 여기에서는, 시스템 설계에 있어서 비형식적인 명세와 형식적인 명세의 중요성을 논하였고, 또한 몇가지 저명한 시스템 설계 방법론을 조사하였다. 그리고 APS를 설계하기 위하여 시스템의 계층구조적 분해에 의한 하나의 설계방법론을 제시하였고, 이 방법론을 응용하여 APS를 설계하였다.

  • PDF

가정환경에서의 분류된 지역정보를 통한 계층적 시맨틱 지도 작성 (Building of a Hierarchical Semantic Map with Classified Area Information in Home Environments)

  • 박중태;송재복
    • 로봇학회논문지
    • /
    • 제7권4호
    • /
    • pp.252-258
    • /
    • 2012
  • This paper describes hierarchical semantic map building using the classified area information in home environments. The hierarchical semantic map consists of a grid, CAIG (Classified Area Information in Grid), and topological map. The grid and CAIG maps are used for navigation and motion selection, respectively. The topological map provides the intuitive information on the environment, which can be used for the communication between robots and users. The proposed semantic map building algorithm can greatly improve the capabilities of a mobile robot in various domains, including localization, path-planning and HRI (Human-Robot Interaction). In the home environment, a door can be used to divide an area into various sections, such as a room, a kitchen, and so on. Therefore, we used not only the grid map of the home environment, but also the door information as a main clue to classify the area and to build the hierarchical semantic map. The proposed method was verified through various experiments and it was found that the algorithm guarantees autonomous map building in the home environment.

On Finding a Convenient Path in the Hierarchical Road Network

  • Sung, Ki-Seok;Park, Chan-Kyoo;Lee, Sang-Wook;Doh, Seung-Yong;Park, Soon-Dal
    • Management Science and Financial Engineering
    • /
    • 제12권2호
    • /
    • pp.87-110
    • /
    • 2006
  • In a hierarchical road network, all roads can be classified according to their attributes such as speed limit, number of lanes, etc. By splitting the whole road network into the subnetworks of the highlevel and low-level roads, we can reduce the size of the network to be calculated at once, and find a path in the way that drivers usually adopt when searching out a travel route. To exploit the hierarchical property of road networks, we define a convenient path and propose an algorithm for finding convenient paths. We introduce a parameter indicating the driver's tolerance to the difference between the length of a convenient path and that of a shortest convenient path. From this parameter, we can determine how far we have to search for the entering and exiting gateway. We also propose some techniques for reducing the number of pairs of entries and exits to be searched in a road network. A result of the computational experiment on a real road network is given to show the efficiency of the proposed algorithm.

FMS의 생산계획 및 일정계획을 위한 의사결정을 위한 의사결정 지원시스템의 개발 (Development of an integrated decision support system for FMS production planning and scheduling problems)

  • 장성용;장병만;박진우
    • 경영과학
    • /
    • 제8권1호
    • /
    • pp.51-70
    • /
    • 1991
  • This paper discusses planning and scheduling problems for efficient utilization of an FMS and presents an integrated decision support system for FMS production planning and scheduling problems. The decision support system, FMSDS(Flexible Manufacturing Systems Decision Support System), includes of data of handling module, part selection module, loading module, load adjusting module, scheduling module and simulation module etc. This paper includes the solution methodology of each subproblem. And an integrated interface scheme between the subproblems is presented. The interface scheme considers the relationships between the subproblems and generates solution using hierarchical and looping approaches. FMSDS is made up of six alternative models considering 3 loading objectives and 2 production order processing strategies. Performance comparisons among 6 alternatives and other decision support systems are shown using the non-terminating simulation techniques.

  • PDF

치구계획의 자동화시스템 구성 및 데이텀 체계의 결정 (System Architecture and Datum Reference Frame for Computer Aided Fixture Planning System)

  • 조규갑;정영득
    • 산업공학
    • /
    • 제4권2호
    • /
    • pp.1-12
    • /
    • 1991
  • This paper deals with the development of a computer aided fixture planning system that automatically selects set-ups, set-up sequence and fixture design for prismatic parts. This study presents the hierarchical data structure for feature-based part model and the preprocessing procedure for the proposed system. The preprocessing procedure generates tools such as DDR(Degree of Dimensional Relationship), AMV(Admissible Misalignment Value) and the datum reference frame of each feature according to the proposed decision table. The proposed system is called AFIX(Automated FIXture planning system) which is implemented by using C language on the workstation. A case study for a cavity plate is presented to show the performance of the AFM.

  • PDF