지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 발행연도
- 2020.3
- 수록면
- 67 - 76 (10page)
- DOI
- 10.7315/CDE.2020.067
이용수
초록· 키워드
오류제보하기
One-dimensional cutting stock problem (1DCSP) is a problem mainly applied in the pipes, cables, and paper rolls industries, and it is a problem of minimizing the trim loss of the stock while satisfying the demand of orders. 1DCSP can be solved by the integer linear programming to get an optimal solution. However, the computation time is exponentially increased depending on the number of types of orders and its quantity demanded. Although many heuristic methods have been proposed to solve the problem, it is difficult to develop a heuristic method that always provides a good solution to various problems due to the performance that is highly dependent on problem domain. In this paper, we propose a method to generate observations by producing various 1DCSPs, and then use the artificial neural network (ANN) algorithm to select the heuristic method that provides a good near-optimal solution for any 1DCSP. ANN models were implemented using the Sequential module of TensorFlow 2.0 Keras. According to the experimental results, the minimum value of root mean square error (RMSE), mean absolute error (MAE), accuracy, precision and recall are found with specific combination of parameters of batch size, epoch number and optimizer.
목차
ABSTRACT
1. Introduction
2. Heuristics for 1DCSP
3. Developing ANN Models for 1DCSP
4. Performance Evaluation
5. Conclusions
References
참고문헌 (17)
참고문헌 신청
Suliman, S.M., 2001, Pattern Generating Procedure for the Cutting Stock Problem, International Journal of Production Economics, 74(1-3), pp.293- 301.
Delorme, M., Iori, M. and Martello, S., 2016, Bin Packing and Cutting Stock Problems: Mathematical Models and Exact Algorithms, European Journal of Operational Research, 255, pp.1-20.
Wascher, G. and Gau, T., 1996, Heuristics for the Integer One-dimensional Cutting Stock Problem: A Computational Study, Operations- Research-Spektrum, 18(3), pp.131-144.
Poldi, K.C. and Arenales, M.N., 2009, Heuristics for the One-dimensional Cutting Stock Problem with Limited Multiple Stock Lengths, Computers & Operations Research, 36(6), pp.2074-2081.
Belov, G. and Scheithauer, G., 2002, A Cutting Plane Algorithm for the One-dimensional Cutting Stock Problem with Multiple Stock Lengths. European Journal of Operational Research, 141(2), pp.274-294.
Delorme, M., Iori, M. and Martello, S., 2016, Bin Packing and Cutting Stock Problems: Mathematical Models and Exact Algorithms, European Journal of Operational Research, 255, pp.1-20.
Wascher, G. and Gau, T., 1996, Heuristics for the Integer One-dimensional Cutting Stock Problem: A Computational Study, Operations- Research-Spektrum, 18(3), pp.131-144.
Poldi, K.C. and Arenales, M.N., 2009, Heuristics for the One-dimensional Cutting Stock Problem with Limited Multiple Stock Lengths, Computers & Operations Research, 36(6), pp.2074-2081.
Belov, G. and Scheithauer, G., 2002, A Cutting Plane Algorithm for the One-dimensional Cutting Stock Problem with Multiple Stock Lengths. European Journal of Operational Research, 141(2), pp.274-294.
함께 읽어보면 좋을 논문
논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!
-
Integrity Heuristic as Tie-Breaking for Classical Task Planning
제어로봇시스템학회 국제학술대회 논문집
2023 .10
-
General equations for free vibrations of thick doubly curved sandwich panels with compressible and incompressible core using higher order shear deformation theory
Steel and Composite Structures, An International Journal
2017 .01
-
휴리스틱 평가를 이용한 의료기기 디자인 사용적합성 평가연구
대한인간공학회 학술대회논문집
2019 .05
-
단일 호이스트 생산시스템에서 다양한 주문을 처리하기 위한 분지한계 기반의 휴리스틱 일정계획
대한산업공학회지
2016 .06
-
A High Quality Solution Constructive Heuristic for No-Wait Flow Shop Scheduling Problem
Industrial Engineering & Management Systems
2016 .09
-
최적 계획생성을 위한 동작비용 기반의 휴리스틱
디지털산업정보학회논문지
2017 .01
-
Hybrid-heuristic 알고리즘을 이용한 상수관망 최적설계 기법 개발
대한토목학회 학술대회
2019 .10
-
개척자 기반 새로운 최적화 알고리즘: POA (Pioneer-inspired Optimization Algorithm)
한국지능시스템학회 논문지
2021 .12
-
효율적인 계획 수립을 위한 동작-기반의 휴리스틱
한국산학기술학회 논문지
2015 .09
-
An Energy-Efficient Heuristic for Virtual Network Functions Placement
한국통신학회 학술대회논문집
2019 .01
-
Hyper Parameter Tuning Method based on Sampling for Optimal LSTM Model
한국컴퓨터정보학회논문지
2019 .01
-
전력계통의 저주파진동 억제를 위한 ANN(Artificial Neural Network) 제어기에 관한 연구
대한전기학회 학술대회 논문집
2018 .07
-
A Heuristic Approach for Viral Marketing Cost Optimization in Social Networks
한국정보과학회 학술발표논문집
2018 .12
-
이변수 다항식 문제에 대한 새로운 메타 휴리스틱 개발
산업경영시스템학회지
2021 .01
-
Production Planning Method Using the Push-back Heuristic Algorithm: Implementation in a Micro Filter Manufacturer in South Korea
Industrial Engineering & Management Systems
2015 .12
-
ANN을 이용한 실시간 플라즈마 절단품질 예측모델개발에 대한 연구
대한용접학회 특별강연 및 학술발표대회 개요집
2020 .11
-
영흥 풍력발전단지의 풍력발전량 예측을 위한 입력변수 선정 및 인공신경망과 1차원 합성곱 신경망 비교
대한환경공학회지
2021 .04
-
A Heuristic Method for Solving Bi-Objective Two-Stage Hybrid Flow Shop Scheduling Problem
Industrial Engineering & Management Systems
2017 .06
-
Breathing Pattern Forecasting using Deep Learning in Smart Factory Environment
한국통신학회 학술대회논문집
2021 .06
-
Development of Prediction Model for Root Industry Production Process Using Artificial Neural Network
Journal of the Korean Society for Precision Engineering
2017 .01
이 논문의 저자 정보
이 논문과 함께 이용한 논문
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2020-530-000453539