• Title/Summary/Keyword: assembly algorithm

Search Result 376, Processing Time 0.026 seconds

Development of the General Inspection-Machine for the Vehicle Forming Assembly (자동차 성형 조립품을 위한 범용 검사기 개발)

  • Kim, Dong-Hwan;Yun, Jae-Sik;Kim, Jin-Wook;Kim, Seok-Tae
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2011.05a
    • /
    • pp.813-815
    • /
    • 2011
  • This study inspects the fault of the vehicle forming assembly and the assembly state of components at high speed and high degree of precision. This study also proposes the general inspection system capable of adapting to a number of products. The inspection program is composed of the fault inspection algorithm to examine the surface of the object and the state of the assembly and the high speed procession algorithm for the real time examination. The fault inspection algorithm is processed largely by a method using average of pixel in ROI and a method dividing the area and checking the presence of the object. Lastly, we verified the efficiency of the sysytem through the evaluation of its accuracy and processing time.

  • PDF

Scheduling for Mixed-Model Assembly Lines in JIT Production Systems (JIT 생산 시스템에서의 혼합모델 조립라인을 위한 일정계획)

  • Ro, In-Kyu;Kim, Joon-Seok
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.17 no.1
    • /
    • pp.83-94
    • /
    • 1991
  • This study is concerned with the scheduling problem for mixed-model assembly lines in Just-In-Time(JIT) production systems. The most important goal of the scheduling for the mixed-model assembly line in JIT production systems is to keep a constant rate of usage for every part used by the systems. In this study, we develop two heuristic algorithms able to keep a constant rate of usage for every part used by the systems in the single-level and the multi-level. In the single-level, the new algorithm generates sequence schedule by backward tracking and prevents the destruction of sequence schedule which is the weakest point of Miltenburg's algorithms. The new algorithm gives better results in total variations than the Miltenburg's algorithms. In the multi-level, the new algorithm extends the concept of the single-level algorithm and shows more efficient results in total variations than Miltenburg and Sinnamon's algorithms.

  • PDF

An Endosymbiotic Evolutionary Algorithm for Balancing and Sequencing in Mixed-Model Two-Sided Assembly Lines (혼합모델 양면조립라인의 밸런싱과 투입순서를 위한 내공생 진화알고리즘)

  • Jo, Jun-Young;Kim, Yeo-Keun
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.37 no.3
    • /
    • pp.39-55
    • /
    • 2012
  • This paper presents an endosymbiotic evolutionary algorithm (EEA) to solve both problems of line balancing and model sequencing in a mixed-model two-sided assembly line (MMtAL) simultaneously. It is important to have a proper balancing and model sequencing for an efficient operation of MMtAL. EEA imitates the natural evolution process of endosymbionts, which is an extension of existing symbiotic evolutionary algorithms. It provides a proper balance between parallel search with the separated individuals representing partial solutions and integrated search with endosymbionts representing entire solutions. The strategy of localized coevolution and the concept of steady-state genetic algorithms are used to improve the search efficiency. The experimental results reveal that EEA is better than two compared symbiotic evolutionary algorithms as well as a traditional genetic algorithm in solution quality.

Sequencing Problem to Keep a Constant Rate of Part Usage In Mixed Model Assembly Lines : A Genetic Algorithm Approach (혼합모델 조립라인에서 부품사용의 일정률 유지를 위한 생산순서 결정 : 유전알고리즘 적용)

  • Hyun, Chul-Ju
    • Journal of the Korea Safety Management & Science
    • /
    • v.9 no.4
    • /
    • pp.129-136
    • /
    • 2007
  • This paper considers the sequencing of products in mixed model assembly lines under Just-In-Time (JIT) systems. Under JIT systems, the most important goal for the sequencing problem is to keep a constant rate of usage every part used by the systems. The sequencing problem is solved using Genetic Algorithm Genetic Algorithm is a heuristic method which can provide a near optimal solution in real time. The performance of proposed technique is compared with existing heuristic methods in terms of solution quality. Various examples are presented and experimental results are reported to demonstrate the efficiency of the technique.

Development of a Fast Alignment Method of Micro-Optic Parts Using Multi Dimension Vision and Optical Feedback

  • Han, Seung-Hyun;Kim, Jin-Oh;Park, Joong-Wan;Kim, Jong-Han
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.273-277
    • /
    • 2003
  • A general process of electronic assembly is composed of a series of geometric alignments and bonding/screwing processes. After assembly, the function is tested in a following process of inspection. However, assembly of micro-optic devices requires both processes to be performed in equipment. Coarse geometric alignment is made by using vision and optical function is improved by the following fine motion based on feedback of tunable laser interferometer. The general system is composed of a precision robot system for 3D assembly, a 3D vision guided system for geometric alignment and an optical feedback system with a tunable laser. In this study, we propose a new fast alignment algorithm of micro-optic devices for both of visual and optical alignments. The main goal is to find a fastest alignment process and algorithms with state-of-the-art technology. We propose a new approach with an optimal sequence of processes, a visual alignment algorithm and a search algorithm for an optimal optical alignment. A system is designed to show the effectiveness and efficiency of the proposed method.

  • PDF

Neural Network Model-based Algorithm for Identifying Job Status in Block Assembly Shop for Shipbuilding (신경망 모델 기반 조선소 조립공장 작업상태 판별 알고리즘)

  • Hong, Seung-Taek;Choi, Jin-Young;Park, Sang-Chul
    • IE interfaces
    • /
    • v.24 no.3
    • /
    • pp.267-273
    • /
    • 2011
  • In the shipbuilding industry, since production processes are so complicated that the data collection for decision making cannot be fully automated, most of production planning and controls are based on the information provided only by field workers. Therefore, without sufficient information it is very difficult to manage the whole production process efficiently. Job status is one of the most important information used for evaluating the remaining processing time in production control, specifically, in block assembly shop. Currently, it is checked by a production manager manually and production planning is modified based on that information, which might cause a delay in production control, resulting in performance degradation. Motivated by these remarks, in this paper we propose an efficient algorithm for identifying job status in block assembly shop for shipbuilding. The algorithm is based on the multi-layer perceptron neural network model using two key factors for input parameters. We showed the superiority of the algorithm by using a numerical experiment, based on real data collected from block assembly shop.

Integer Programming Approach to Line Optimization of Multiple Surface Mounters (정수계획법에 의한 다수 표면실장기의 라인 최적화)

  • Kim Kyung-Min;Park Tae-Hyoung
    • The Journal of the Korea Contents Association
    • /
    • v.6 no.4
    • /
    • pp.46-54
    • /
    • 2006
  • We propose an optimization method for PCB assembly lines including multiple surface mounters. To increase the productivity of PCB assembly line, the component allocation, feeder assignment, and assembly sequence of each surface mounter should be optimized. The optimization Problem is formulated as an integer programming problem. We divide the overall problem into two hierarchical sub-problems: forward-path problem and backward-path problem. The clustering algorithm and branch-and-bound algorithm are applied to solve the forward-path problem. The assignment algorithm and connection algorithm are applied to solve the backward-path problem. Simulation results are presented to verify the usefulness of the proposed method.

  • PDF

A Synchronized Job Assignment Model for Manual Assembly Lines Using Multi-Objective Simulation Integrated Hybrid Genetic Algorithm (MO-SHGA) (다목적 시뮬레이션 통합 하이브리드 유전자 알고리즘을 사용한 수동 조립라인의 동기 작업 모델)

  • Imran, Muhammad;Kang, Changwook
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.40 no.4
    • /
    • pp.211-220
    • /
    • 2017
  • The application of the theoretical model to real assembly lines has been one of the biggest challenges for researchers and industrial engineers. There should be some realistic approach to achieve the conflicting objectives on real systems. Therefore, in this paper, a model is developed to synchronize a real system (A discrete event simulation model) with a theoretical model (An optimization model). This synchronization will enable the realistic optimization of systems. A job assignment model of the assembly line is formulated for the evaluation of proposed realistic optimization to achieve multiple conflicting objectives. The objectives, fluctuation in cycle time, throughput, labor cost, energy cost, teamwork and deviation in the skill level of operators have been modeled mathematically. To solve the formulated mathematical model, a multi-objective simulation integrated hybrid genetic algorithm (MO-SHGA) is proposed. In MO-SHGA each individual in each population acts as an input scenario of simulation. Also, it is very difficult to assign weights to the objective function in the traditional multi-objective GA because of pareto fronts. Therefore, we have proposed a probabilistic based linearization and multi-objective to single objective conversion method at population evolution phase. The performance of MO-SHGA is evaluated with the standard multi-objective genetic algorithm (MO-GA) with both deterministic and stochastic data settings. A case study of the goalkeeping gloves assembly line is also presented as a numerical example which is solved using MO-SHGA and MO-GA. The proposed research is useful for the development of synchronized human based assembly lines for real time monitoring, optimization, and control.

Development of Scheduling Software for Flexible Manufacturing System (FMS운용을 위한 일정계획용 소프트웨어)

  • 윤덕균;황의철
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.14 no.24
    • /
    • pp.53-69
    • /
    • 1991
  • This paper is concerned with software developments for scheduling and sequencing of FMS. The scheduling algorithms are developed for 3 types of FMS:single machine type FMS, flowshop type FMS. assembly line type FMS. For the single machine type FMS. full enumeration algorithm is used. For the flowshop type FMS heuristic algorithms are developed. For the assembly type FMS the exsisting PERT/CPM algorithm is applied. Numerical examples are presented for illustration of each algorithm. Each soft ware program list are attached as appendices.

  • PDF

A Mount Sequence Optimization for Multihead-Gantry Chip Mounters Using Genetic Algorithm (유전자 알고리즘을 이용한 멀티헤드 겐트리타입 칩마운터의 장착순서 최적화)

  • Lee, Jae-Young;Park, Tae-Hyoung
    • Proceedings of the KIEE Conference
    • /
    • 2003.07d
    • /
    • pp.2450-2452
    • /
    • 2003
  • We present a method to increase the productivity of multihead-gantry chip mounters for PCB assembly lines. To minimize the assembly time, we generate the mount sequence using the genetic algorithm. The chromosome, fitness function, and operators are newly defined to apply the algorithm. Simulation results are presented to verified the usefulness of the method.

  • PDF