• Title/Summary/Keyword: stock cutting

Search Result 90, Processing Time 0.023 seconds

An Improved Exact Algorithm for the Unconstrained Two-Dimensional Cutting Problem (개수 제한이 없는 2차원 절단문제를 위한 향상된 최적해법)

  • Gee, Young-Gun;Kang, Maing-Kyu
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.27 no.4
    • /
    • pp.424-431
    • /
    • 2001
  • This paper is concerned with the unconstrained two-dimensional cutting problem of cutting small rectangles (products), each of which has its own profit and size, from a large rectangle (material) to maximize the profit-sum of products. Since this problem is used as a sub-problem to generate a cutting pattern in the algorithms for the two-dimensional cutting stock problem, most of researches for the two-dimensional cutting stock problem have been concentrated on solving this sub-problem more efficiently. This paper improves Hifi and Zissimopoulos's recursive algorithm, which is known as the most efficient exact algorithm, by applying newly proposed upper bound and searching strategy. The experimental results show that the proposed algorithm has been improved significantly in the computational amount of time as compared with the Hifi and Zissimopulos's algorithm.

  • PDF

Composite Stock Cutting using Distributed Simulated Annealing (분산 시뮬레이티드 어닐링을 이용한 복합 재료 재단)

  • Hong, Chul-Eui
    • Journal of KIISE:Software and Applications
    • /
    • v.29 no.1_2
    • /
    • pp.20-29
    • /
    • 2002
  • The composite stock cutting problem is to allocate rectangular and/or irregular patterns onto a large composite stock sheet of finite dimensions in such a way that the resulting scrap will be minimized. In this paper, the distributed simulated annealing with the new cost error tolerant spatial decomposition is applied to the composite stock cutting problem in MPI environments. The cost error tolerant scheme relaxes synchronization and chooses small perturbations on states asynchronously in a dynamically changed stream length to keep the convergence property of the sequential annealing. This paper proposes the efficient data structures for representation of patterns and their affinity relations and also shows how to determine move generations, annealing parameters, and a cost function. The spatial decomposition method is addressed in detail. This paper identifies that the final quality is not degraded with almost linear speedup. Composite stock shapes are not constrained to convex polygons or even regular shapes, but the rotations are only allowed to 2 or 4 due to its composite nature.

A Study of Appling RIMS of Train's Wheels Management (RIMS 데이터와 도시철도차량 차륜관리에 관한 연구)

  • Jeon, Seo-Tak;Lee, Do-Sun;Kim, Dong-Min;Park, Soo-Choong;Kim, Nam-Woo
    • Proceedings of the KSR Conference
    • /
    • 2008.11b
    • /
    • pp.666-672
    • /
    • 2008
  • Train wheels are the most important part of the high-speed rail system with supporting body, running stably and safely. Wheel exchange and fix plan is computed by the worker who managing entire Train Maintenance Process based on his know-how so that this system is losing its reliability and accuracy. And predicting of the wheel's lifetime is absolutely difficult matter because of uncertainty between trains like mileage of the type of trains, condition of operation, curve section and wheel's cutting pattern. Therefore workers always used to hold many wheels. For this reason, the cost of stock is soar when the level of stock was normal. If the stock is sufficient, the cost of stock will rise. On the other hand, If the stock is deficient, we would have trouble that the plan of the train maintenance process will be failed. Thus this paper aimed at application that "Wheel Managing System" which is able to predict wheel's life-cycle and demands under the RIMS(Rolling-Stock Information Maintenance System) with analysing wheel exchanging and cutting status considering economical or stable aspects.

  • PDF

A Stock Removal Cycle with Collision Detection Function for Turning Operation (충돌회피 기능을 가진 선삭용 황정삭 싸이클)

  • 임상묵;강성균;최종률
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1995.10a
    • /
    • pp.1050-1053
    • /
    • 1995
  • A stock removal cycle is developed as a programming tool of the CNC lathe. This cycle support the easiness and swifness of a part program generation in the shopfloor. The cycle contains the function of tool path generation of rough/finish cutting, of avoidance air-cut for non-cylindrical (die-casted, forged) workpiece, and of the tool collisopn detection/aviodance. Consequently the intelligent stock removal cycle results in improving the productivity and safety of CNC lathe.

  • PDF

The Concept Design and Structural Strength Analysis for Double-Deck Train Carbody using Alluminum Extruded Panels (알루미늄 압출재를 적용한 2층 열차 차체의 기초설계 및 구조강도해석)

  • 황원주;김형진;강부병;허현무
    • Proceedings of the KSR Conference
    • /
    • 2002.05a
    • /
    • pp.364-369
    • /
    • 2002
  • The purpose of this paper is to introduce the concept design and the structural strength of the double-deck rolling stock vehicle. Aluminum is very useful material for the carbody structure due to its characteristic of light weight. Large alumillum extrusion profiles(panels) have toe of merits such as easy production of complicated shapes, reduction of welding and cutting lines, and cutting down the labor cost. AED type is being applied to the standard EMUs and the EMUs Kwangju subway in Korea. Light material recommended the double-deck rolling stock vehicle because the center of gravity of the train is higher and its weight is heavier than those of the normal vehicle. So we applied the technology of the large aluminum extrusion profiles(panels) to the double-deck vehicle. We performed the structural strength analysis and examined its safety.

  • PDF

Feedrate Optimization using CL Surface (공구경로 곡면을 이용한 이송속도 최적화)

  • 김수진;양민양
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2003.06a
    • /
    • pp.547-552
    • /
    • 2003
  • In mold machining, there are many concave machining regions where chatter and tool deflection occur since MRR (material removal rate) increases as curvature increases even though cutting speed and depth of cut are constant. Boolean operation between stock and tool model is widely used to compute MRR in NC milling simulation. In finish cutting, the side step is reduced to about 0.3mm and tool path length is sometimes over 300m. so Boolean operation takes long computation time and includes much error if the resolution of stock and tool model is larger than the side step. In this paper, curvature of CL(cutter location) surface and side step of tool path is used to compute the feedrate for constant MRR machining. The data structure of CL surface is Z-map generated from NC tool path. The algorithm to get local curvature from discrete data was developed and applied to compute local curvature of CL surface. The side step of tool path was computed by point density map which includes cutter location point density at each grid element. The feedrate computed from curvature and side step is inserted to new tool path to regulate MRR. The resultants wire applied to feedrate optimization system which generates new tool path with feedrate from NC codes for finish cutting. The system was applied to speaker mold machining. The finishing time was reduced to 12.6%. tool wear was reduced from 2mm to 1.1mm and chatter marks and over cut on corner were removed.

  • PDF

An Approach for Stock Price Forecast using Long Short Term Memory

  • K.A.Surya Rajeswar;Pon Ramalingam;Sudalaimuthu.T
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.4
    • /
    • pp.166-171
    • /
    • 2023
  • The Stock price analysis is an increasing concern in a financial time series. The purpose of the study is to analyze the price parameters of date, high, low, and news feed about the stock exchange price. Long short term memory (LSTM) is a cutting-edge technology used for predicting the data based on time series. LSTM performs well in executing large sequence of data. This paper presents the Long Short Term Memory Model has used to analyze the stock price ranges of 10 days and 20 days by exponential moving average. The proposed approach gives better performance using technical indicators of stock price with an accuracy of 82.6% and cross entropy of 71%.

An Implementation of Cutting-Ironbar Manufacturing Software using Dynamic Programming (동적계획법을 이용한 철근가공용 소프트웨어의 구현)

  • Kim, Seong-Hoon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.4
    • /
    • pp.1-8
    • /
    • 2009
  • In this paper, we deal an implementation of the software that produces sub-optimal solution of cutting-ironbar planning problem using dynamic programming. Generally, it is required to design an optimization algorithm to accept the practical requirements of cutting ironbar manufacturing. But, this problem is a multiple-sized 1-dimensional cutting stock problem and Linear Programming approaches to get the optimal solution is difficult to be applied due to the problem of explosive computation and memory limitation. In order to overcome this problem, we reform the problem for applying Dynamic Programming and propose a cutting-ironbar planning algorithm searching the sub-optimal solution in the space of fixed amount of combinated columns by using heuristics. Then, we design a graphic user interfaces and screen displays to be operated conveniently in the industry workplace and implement the software using open-source GUI library toolkit, GTK+.

Optimal Two-Section Layouts for the Two-Dimensional Cutting Problem

  • Ji, Jun;Huang, Dun-hua;Xing, Fei-fei;Cui, Yao-dong
    • Journal of Information Processing Systems
    • /
    • v.17 no.2
    • /
    • pp.271-283
    • /
    • 2021
  • When generating layout schemes, both the material usage and practicality of the cutting process should be considered. This paper presents a two-section algorithm for generating guillotine-cutting schemes of rectangular blanks. It simplifies the cutting process by allowing only one size of blanks to appear in any rectangular block. The algorithm uses an implicit enumeration and a linear programming optimal cutting scheme to maximize the material usage. The algorithm was tested on some benchmark problems in the literature, and compared with the three types of layout scheme algorithm. The experimental results show that the algorithm is effective both in computation time and in material usage.