• Title/Summary/Keyword: Layout problem

Search Result 347, Processing Time 0.026 seconds

Facility Layout Planning Using Ant Algorithm (개미 알고리듬을 이용한 설비배치계획)

  • Lee Seong Yeol;Lee Wol Seon
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2003.05a
    • /
    • pp.1065-1070
    • /
    • 2003
  • Facility Layout Planning is concerned with how to arrange facilities necessary for production in a given space. Its objective is often to minimize the total sum of all material flows multiplied by the distance among facilities. FLP belongs to NP complete problem; i.e., the number of possible layout solutions increases with the increase of the number of facilities. Thus, meta heuristics such as Genetic Algorithm (GA) and Simulated Annealing have been investigated to solve the FLP problems. However, one of the biggest problems which lie in the existing meta heuristics including GA is hard to find an appropriate combinations of parameters which result in optimal solutions for the specific problem. The Ant System algorithm with elitist and ranking strategies is used to solve the FLP problem as an another good alternative. Experimental results show that the AS algorithm is able to produce the same level of solution quality with less sensitive parameters selection comparing to the ones obtained by applying other existing meta heuristic algorithms.

  • PDF

Parametric Macro for Two-Dimensional Layout on the Auto-CAD System

  • Kim, Yunyong;Park, Jewoong
    • Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
    • /
    • 2000.10a
    • /
    • pp.253-260
    • /
    • 2000
  • In recent years, a number of successful nesting approaches have been developed by using the various heuristic algorithms, and due to their application potential several commercial CAD/CAM packages include a nesting module for solving the layout problem. Since a large portion of the complexity of the part nesting problem results from the overlapping computation, the geometric representation is one of the most important factors to reduce the complexity of the problem. The proposed part representation method can easily handle parts and raw materials with widely varying geometrical shape by using the redesigning modules. This considerably reduces the amount of processed data and consequently the run time of the computer. The aim of this research is to develop parametric macro for two-dimensional layout on the Auto-CAD system. Therefore, this research can be called "pre-nesting".

  • PDF

A Study of The Layout of Boxes to the Cargo Loading Problems (화물 적재 문제에 있어서의 배치 형태에 관한 연구)

  • Kim, Young-Min;Lee, Jun-Hee
    • Journal of the Korea Safety Management & Science
    • /
    • v.8 no.3
    • /
    • pp.143-157
    • /
    • 2006
  • The purpose of this thesis is to develop a heuristic algorithm evaluating the layout to maximize number of boxes when a single-box-type is packed into a container. Actually because three-dimensional problems are involved in NP-complete, much study has been focused on heuristic algorithms. The basic concept of this study is as follows. The problem is solved as palletizing problems with each side of the container respectively. By using the height of boxes, the problem is extended to a three-dimensional problem. Consequently, through this thesis, we can get good solution and the result is displayed by three-dimensional computer graphic.

An Intelligent Cavity Layout Design System for Injection Moulds

  • Hu, Weigang;Masood, Syed
    • International Journal of CAD/CAM
    • /
    • v.2 no.1
    • /
    • pp.69-75
    • /
    • 2002
  • This paper presents the development of an Intelligent Cavity Layout Design System (ICLDS) for multiple cavity injection moulds. The system is intended to assist mould designers in cavity layout design at concept design stage. The complexities and principles of cavity layout design as well as various dependencies in injection mould design are introduced. The knowledge in cavity layout design is summarized and classified. The functionality, the overall structure and general process of ICLDS are explained. The paper also discusses such issues as knowledge representation and case-based reasoning used in the development of the system. The functionality of the system is illustrated with an example of cavity layout design problem.

Multi-station Fixture Layout Design Using Simulated Annealing

  • Kim, Pansoo;Seun, Ji Ung
    • Management Science and Financial Engineering
    • /
    • v.10 no.2
    • /
    • pp.73-87
    • /
    • 2004
  • Automotive and aircraft assembly process rely on fixtures to support and coordinate parts and subassemblies. Fixture layout in multi-station panel assemblies has a direct dimensional effect on final products and thus presents a quality problem. This paper describes a methodology for fixture layout design in multi -station assembly processes. An optimal fixture layout improves the robustness of a fixture system against environmental noises, reduces product variability, and eventually leads to manufacturing cost reduction. One of the difficulties raised by multi-station fixture layout design is the overwhelmingly large number of design alternatives. This makes it difficult to find a global optimality and, if an inefficient algorithm is used, may require prohibitive computing time. In this paper, simulated annealing is adopted and appropriate parameters are selected to find good fixture layouts. A four-station assembly process for a sport utility vehicle (SUV) side frame is used throughout the paper to illustrate the efficiency and effectiveness of this methodology.

Improvement of the Facilities Layout Using FactoryCAD in a Registry Department of Mail Center (FactoryCAD를 이용한 우편집중국 등기 작업장 설비 배치 개선)

  • Lee, Hae-Won;Jeon, In-Woo;Kim, Ki-Dong
    • Journal of Industrial Technology
    • /
    • v.25 no.A
    • /
    • pp.95-104
    • /
    • 2005
  • In the future, the sorting machines will be taken charge of the most part of the letter sorting operations. At present, in order to deliver the sorted letters by the next day, many labors are intensively committed in the letter sorting operations. This research analyzes the problem of the facilities layout in registry department of mail center. It presents an improved design of facilities layout in comparison with several alternatives including the current layout using AutoCAD and FactoryCAD. It presents the optimized facilities layout using the algorithm which is embedded in the FactoryOPT. By the result of this research, we expect that the productivity of sorting letter will be improved and the related total labor cost will be minimized.

  • PDF

A study on optimal of block facility layout using Hybrid GA (Hybrid GA를 이용한 최적의 블록단위 설비배치에 관한 연구)

  • 이용욱;석상문;이철영
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2000.11a
    • /
    • pp.131-142
    • /
    • 2000
  • Facility layout is the early stage of system design that requires a mid-term or long-term plan. Since improper facility layout might incur substantial logistics cost including material handling and re-installment costs, due consideration must be given to decisions on facility layout. Facility layout is concerned with low to arrange equipment necessary for production in a given space. Its objective is to minimize the sum of all the products of each equipment's amount of flow multiplied by distance. Facility layout also is related to the issue of NP-complete, i.e., calculated amounts exponentially increase with the increase of the number of equipment. This study discusses Hybrid GA developed, as an algorithm for facility layout, to solve the above-mentioned problems. The algorithm, which is designed to efficiently place equipment, automatically produces a horizontal passageway by the block, if a designer provides the width and length of the space to be handled. In addition, this study demonstrates the validity of the Algorithm by comparing with existing algorithms that have been developed. We present a Hybrid GA approach to the facility layout problem that improves on existing work in terms of solution quality and method. Experimental results show that the proposed algorithm is able to produce better solution quality and more practical layouts than the ones obtained by applying existing algorithms.

  • PDF

A Model and Simulated Annealing Algorithm for the Multi-factor Plant Layout Problem (다수요인을 가진 설비배치문제를 위한 모형과 simulated annealing 알고리즘)

  • 홍관수
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.20 no.1
    • /
    • pp.63-81
    • /
    • 1995
  • This paper presents a model and algorithm for solving the multi-factor plant layout problem. The model can incorporate more than two factors that may be either quantitative or qualitative. The algorithm is based on simulated annealing, which has been successfully applied for the solution of combinatorial problems. A set of problems previously used by various authors is solved to demonstrate the effectiveness of the proposed methods. The results indicate that the proposed methods can yield good quality for each of eleven test problems.

  • PDF

The Research of Optimal Plant Layout Optimization based on Particle Swarm Optimization for Ethylene Oxide Plant (PSO 최적화 기법을 이용한 Ethylene Oxide Plant 배치에 관한 연구)

  • Park, Pyung Jae;Lee, Chang Jun
    • Journal of the Korean Society of Safety
    • /
    • v.30 no.3
    • /
    • pp.32-37
    • /
    • 2015
  • In the fields of plant layout optimization, the main goal is to minimize the construction cost including pipelines as satisfying all constraints such as safety and operating issues. However, what is the lacking of considerations in previous researches is to consider proper safety and maintenance spaces for a complex plant. Based on the mathematical programming, MILP(Mixed Integer Linear Programming) problems including various constraints can be formulated to find the optimal solution which is to achieve the best economic benefits. The objective function of this problem is the sum of piping cost, pumping cost and area cost. In general, many conventional optimization solvers are used to find a MILP problem. However, it is really hard to solve this problem due to complex inequality and equality constraints, since it is impossible to use the derivatives of objective functions and constraints. To resolve this problem, the PSO (Particle Swarm Optimization), which is one of the representative sampling approaches and does not need to use derivatives of equations, is employed to find the optimal solution considering various complex constraints in this study. The EO (Ethylene Oxide) plant is tested to verify the efficacy of the proposed method.

A Layout Design Algorithm with the Importance Weight and Shape of Department (부서중요도(部署重要度)와 요구형태(要求形態)를 고려(考慮)한 배치(配置) 설계(設計) 알고리즘)

  • Lee, Sang-Seol;Gang, Hui-Jeong
    • Journal of Korean Society for Quality Management
    • /
    • v.21 no.2
    • /
    • pp.232-241
    • /
    • 1993
  • The objective of this study is to develop an algorithm in the consideration of importance Weight and desirable shape of specific department in the computerized layout planning. Quantitative relationship chart between each department was used. It is decided that the priority among the department as to variable factors and the optimum quantitative relationship chart was obtained using by the Weighting method. The algorithm presented in this study could generate more practical layout for the actual design problem.

  • PDF