• 제목/요약/키워드: Manufacturing optimization problem

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

조립수율을 고려한 공차할당 및 가공중심 결정 (Tolerance allotment with Design Centering considering Assembly Yield)

  • 이진구
    • 한국생산제조학회지
    • /
    • 제9권1호
    • /
    • pp.45-52
    • /
    • 2000
  • The purpose of this research was developing an integrated way to solve two typical tolerance optimization problem i.e. optimal tolerance allotment and design centering. A new problem definition design centering-tolerance allotment problem (DCTA) was proposed here for the first time and solved. Genetic algorithm and coarse Monte Carlo simulation were used to solve the stochastic optimization problem. Optimal costs were compared with the costs from the previous optimization strategies Significant cost reductions were achieved by DCTA scheme.

  • PDF

Multiobjective Genetic Algorithm for Scheduling Problems in Manufacturing Systems

  • Gen, Mitsuo;Lin, Lin
    • Industrial Engineering and Management Systems
    • /
    • 제11권4호
    • /
    • pp.310-330
    • /
    • 2012
  • Scheduling is an important tool for a manufacturing system, where it can have a major impact on the productivity of a production process. In manufacturing systems, the purpose of scheduling is to minimize the production time and costs, by assigning a production facility when to make, with which staff, and on which equipment. Production scheduling aims to maximize the efficiency of the operation and reduce the costs. In order to find an optimal solution to manufacturing scheduling problems, it attempts to solve complex combinatorial optimization problems. Unfortunately, most of them fall into the class of NP-hard combinatorial problems. Genetic algorithm (GA) is one of the generic population-based metaheuristic optimization algorithms and the best one for finding a satisfactory solution in an acceptable time for the NP-hard scheduling problems. GA is the most popular type of evolutionary algorithm. In this survey paper, we address firstly multiobjective hybrid GA combined with adaptive fuzzy logic controller which gives fitness assignment mechanism and performance measures for solving multiple objective optimization problems, and four crucial issues in the manufacturing scheduling including a mathematical model, GA-based solution method and case study in flexible job-shop scheduling problem (fJSP), automatic guided vehicle (AGV) dispatching models in flexible manufacturing system (FMS) combined with priority-based GA, recent advanced planning and scheduling (APS) models and integrated systems for manufacturing.

근사모델 및 성공확률을 이용한 강건설계 (A Robust Design Using Approximation Model and Probability of Success)

  • 송병철;이권희
    • 한국기계가공학회지
    • /
    • 제7권3호
    • /
    • pp.3-11
    • /
    • 2008
  • Robust design pioneered by Dr. G. Taguchi has been applied to versatile engineering problems for improving quality. Since 1980s, the Taguchi method has been introduced to numerical optimization, complementing the deficiencies of deterministic optimization, which is often called the robust optimization. In this study, the robust optimization strategy is proposed by considering the robustness of objective and constraint functions. The statistics of responses in the functions are surrogated by kriging models. In addition, objective and/or constraint function is represented by the probability of success, thus facilitating robust optimization. The mathematical problem and the two-bar design problem are investigated to show the validity of the proposed method.

  • PDF

요청한 작업 경로에 따른 매니퓰레이터의 기구학적 변수 선정을 위한 군집 지능 기반 최적 설계 (Swarm Intelligence-based Optimal Design for Selecting the Kinematic Parameters of a Manipulator According to the Desired Task Space Trajectory)

  • 이준우
    • 한국생산제조학회지
    • /
    • 제25권6호
    • /
    • pp.504-510
    • /
    • 2016
  • Robots are widely utilized in many fields, and various demands need customized robots. This study proposes an optimal design method based on swarm intelligence for selecting the kinematic parameter of a manipulator according to the task space trajectory desired by the user. The optimal design method is dealt with herein as an optimization problem. This study is based on swarm intelligence-based optimization algorithms (i.e., ant colony optimization (ACO) and particle swarm optimization algorithms) to determine the optimal kinematic parameters of the manipulator. The former is used to select the optimal kinematic parameter values, whereas the latter is utilized to solve the inverse kinematic problem when the ACO determines the parameter values. This study solves a design problem with the PUMA 560 when the desired task space trajectory is given and discusses its results in the simulation part to verify the performance of the proposed design.

유전자 알고리듬을 이용한 공자기계구조물의 정강성 해석 및 다목적 함수 최적화(I) (Static Compliance Analysis & Multi-Objective Optimization of Machine Tool Structures Using Genetic Algorithm(I))

  • 이영우;성활경
    • 한국공작기계학회:학술대회논문집
    • /
    • 한국공작기계학회 2000년도 추계학술대회논문집 - 한국공작기계학회
    • /
    • pp.443-448
    • /
    • 2000
  • In this paper, multiphase optimization of machine structure is presented. The goal of first step is to obtain (i) light weight, (ii) rigidity statically. In this step, multiple optimization problem with two objective functions is treated using Pareto Genetic Algorithm. Where two objective functions are weight of the structure, and static compliance. The method is applied to a new machine structure design.

  • PDF

마르코프 과정을 이용한 공차 최적화 (Tolerance Optimization with Markov Chain Process)

  • Lee, Jin-Koo
    • 한국공작기계학회논문집
    • /
    • 제13권2호
    • /
    • pp.81-87
    • /
    • 2004
  • This paper deals with a new approach to tolerance optimization problems. Optimal tolerance allotment problems can be formulated as stochastic optimization problems. Most schemes to solve the stochastic optimization problems have been found to exhibit difficulties in multivariate integration of the probability density function. As a typical example of stochastic optimization the optimal tolerance allotment problem has the same difficulties. In this stochastic model, manufacturing system is represented by Gauss-Markov stochastic process and the manufacturing unit availability is characterized for realistic optimization modeling. The new algorithm performed robustly for a large deviation approximation. A significant reduction in computation time was observed compared to the results obtained in previous studies.

Evolutionary Network Optimization: Hybrid Genetic Algorithms Approach

  • Gen, Mitsuo
    • 한국지능시스템학회:학술대회논문집
    • /
    • 한국퍼지및지능시스템학회 2003년도 ISIS 2003
    • /
    • pp.195-204
    • /
    • 2003
  • Network optimization is being increasingly important and fundamental issue in the fields such as engineering, computer science, operations research, transportation, telecommunication, decision support systems, manufacturing, and airline scheduling. Networks provide a useful way to modeling real world problems and are extensively used in practice. Many real world applications impose on more complex issues, such as, complex structure, complex constraints, and multiple objects to be handled simultaneously and make the problem intractable to the traditional approaches. Recent advances in evolutionary computation have made it possible to solve such practical network optimization problems. The invited talk introduces a thorough treatment of evolutionary approaches, i.e., hybrid genetic algorithms approach to network optimization problems, such as, fixed charge transportation problem, minimum cost and maximum flow problem, minimum spanning tree problem, multiple project scheduling problems, scheduling problem in FMS.

  • PDF

A Simulated Annealing Method for the Optimization Problem in a Multi-Server and Multi-Class Customer Ssystem

  • Yoo, Seuck-Cheun
    • 한국경영과학회지
    • /
    • 제18권2호
    • /
    • pp.83-103
    • /
    • 1993
  • This paper addresses an optimization problem faced by a multi-server and multi-class customer system in manufacturing facilities and service industries. This paper presents a model of an integrated problem of server allocation and customer type partitioning. We approximate the problem through two types of models to make it tractable. As soution approach, the simulated annealing heuristic is constructed based on the general simulated annealing method. Computational results are presented.

  • PDF

응력 제한조건하의 신뢰성 기반 형상 최적설계 (Reliability-Based Shape Optimization Under the Stress Constraints)

  • 오영규;박재용;임민규;박재용;한석영
    • 한국생산제조학회지
    • /
    • 제19권4호
    • /
    • pp.469-475
    • /
    • 2010
  • The objective of this study is to integrate reliability analysis into shape optimization problem using the evolutionary structural optimization (ESO) in the application example. Reliability-based shape optimization is formulated as volume minimization problem with probabilistic stress constraint under minimization max. von Mises stress and allow stress. Young's modulus, external load and thickness are considered as uncertain variables. In order to compute reliability index, four methods, i.e., reliability index approach (RIA), performance measure approach (PMA), single-loop singlevector (SLSV) and adaptive-loop (ADL), are used. Reliability-based shape optimization design process is conducted to obtain optimal shape satisfying max. von Mises stress and reliability index constraints with the above four methods, and then each result is compared with respect to numerical stability and computing time.

Path Optimization for Welding/Soldering Robots Using an Improved Genetic Algorithm

  • Kang, Sung-Gyun;Kwon, Son;Choi, Hyuk-Jin
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2001년도 ICCAS
    • /
    • pp.180.6-180
    • /
    • 2001
  • Welding/soldering automation is one of the most important manufacturing issues in order to lower the cost, increase the quality, and avoid labor problems. An off-line programming, OLP, is one of the powerful methods to solve this kind of diver sity problem, Unless an OLP system is ready for the path optimization in welding/soldering, a waste of time and cost is unavoidable due to an inefficient path in welding/soldering processes. Therefore, this study attempts to obtain path optimization using a genetic algorithm based on artificial intelligences. The problem of the welding path optimization is defined as conventional TSP (traveling salesman problem), but still paths have to go through welding lines. An improved genetic algorithm was suggested and the problem was formulated as a TSP problem considering ...

  • PDF