지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
이용수
초록· 키워드
오류제보하기
In this paper, we develop an improved branch and bound algorithm for the (un)weighted unconstrained two-dimensional cutting problem. In the proposed algorithm, we improve the branching strategies of the existing exact algorithm and reduce the size of problem by removing the dominated pieces from the problem. We apply the newly proposed definition of dominated cutting pattern and it can reduce the number of nodes that must be searched during the algorithm procedure. The efficiency of the proposed algorithm is presented through comparison with the exact algorithm known as the most efficient.
목차
Abstract
1. 서론
2. 최적-우선 분지한계법
3. 분지전략
4. 열등패턴 재정의
5. 열등부품 제거
6. 개선된 분지전략
7. 실험결과
8. 결론
참고문헌
참고문헌 (11)
참고문헌 신청
[학술지(정기간행물)] - / 1985 / Algorithms for Unconstrained Two-dimensional Guillotine Cutting 36 : 297 ~ 306
[학술지(정기간행물)] - / 1977 / An Algorithm for Two-dimensional Cutting Problems 26 : 30 ~ 44
[학술지(정기간행물)] - / 2000 / Constrained Two-dimensional Cutting Stock Problems a Best-first Branch-and-bound Algorithm 7 : 185 ~ 210
[학술지(정기간행물)] - / 2003 / A Best-first Branch and Bound Algorithm for Unconstrained Two-dimensional Cutting Problems 31 : 301 ~ 307
[학술지(정기간행물)] - / 1961 / A Linear Programming approach to the Cutting-stock Problem 9 : 849 ~ 859
[학술지(정기간행물)] - / 1977 / An Algorithm for Two-dimensional Cutting Problems 26 : 30 ~ 44
[학술지(정기간행물)] - / 2000 / Constrained Two-dimensional Cutting Stock Problems a Best-first Branch-and-bound Algorithm 7 : 185 ~ 210
[학술지(정기간행물)] - / 2003 / A Best-first Branch and Bound Algorithm for Unconstrained Two-dimensional Cutting Problems 31 : 301 ~ 307
[학술지(정기간행물)] - / 1961 / A Linear Programming approach to the Cutting-stock Problem 9 : 849 ~ 859
함께 읽어보면 좋을 논문
논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!
-
[A1 최적화] 혼합정수계획법을 위한 분지한계법의 효율적인 구현
한국경영과학회 학술대회논문집
2002 .06
-
Branch and Bound Algorithm for the Facility Layout Problem Without Shape Distortion
한국경영과학회지
1996 .08
-
3차원 적재문제의 최적 해법 ( An Algorithm on Three-Dimensional Loading Problem )
한국경영과학회지
1998 .06
-
A Branch and Cut Algorithm for the Steiner Ring Star Problem
Management Science and Financial Engineering
1998 .05
-
재투입이 존재하는 2단계 순열흐름공정에서 총 작업 흐름시간을 최소화하는 분지한게방법
한국경영과학회 학술대회논문집
2010 .06
-
Computational Study of Cutting Planes for a Lot-Sizing Problem in Branch-and-Cut Algorithm
한국경영과학회지
2015 .08
-
Transductive SVM을 위한 분지-한계 알고리즘
한국경영과학회지
2006 .06
-
A Branch and Cut Algorithm for Solving an Intra-Ring Design Problem of Synchronous Optical Networks
한국경영과학회 학술대회논문집
1998 .01
-
네트워크 문제를 위한 새로운 진화 알고리즘에 대하여
한국경영과학회지
2007 .06
-
Implementing a Branch-and-bound Algorithm for Transductive Support Vector Machines
Management Science and Financial Engineering
2010 .05
-
정수 일반 네트워크문제를 위한 분지 한계법의 개선 ( Improvements of Branch and Bound Algorithm for the Integer Generalized network Problem )
한국경영과학회지
1994 .08
-
An Algorithm for the Graph Disconnection Problem
Management Science and Financial Engineering
2005 .05
-
평면 절단 문제를 위한 유전자 알고리즘 ( Genetic Algorithm for Plane cutting )
한국경영과학회 학술대회논문집
1997 .01
-
Scheduling of Three-Operation Jobs in a Two-Machine Flow Shop with mean flow time measure
한국경영과학회 학술대회논문집
2006 .11
-
유방향네트워크에서 계층수송망 설계문제에 대한 분지한계법 ( A Branch and Bound Algorithm for the Hierarchical Transportation Network Design Problem in Directed Networks )
한국경영과학회지
1991 .12
-
U라인 라인밸런싱을 위한 분지한계법 ( A Branch-and-Bound Algorithm for U-line Balancing )
한국경영과학회지
1998 .06
-
2 계층 공생 진화알고리듬을 이용한 다목적 최적화
한국경영과학회 학술대회논문집
2006 .11
이 논문의 저자 정보
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2009-325-015146882