메뉴 건너뛰기
.. 내서재 .. 알림
소속 기관/학교 인증
인증하면 논문, 학술자료 등을  무료로 열람할 수 있어요.
한국대학교, 누리자동차, 시립도서관 등 나의 기관을 확인해보세요
(국내 대학 90% 이상 구독 중)
로그인 회원가입 고객센터 ENG
주제분류

추천
검색
질문

논문 기본 정보

자료유형
학술대회자료
저자정보
Yoshiyuki Karuno (Kyoto Institute of Technology) Oki Nakahama (Kyoto Institute of Technology)
저널정보
제어로봇시스템학회 제어로봇시스템학회 국제학술대회 논문집 ICCAS 2018
발행연도
2018.10
수록면
1,397 - 1,402 (6page)

이용수

표지
📌
연구주제
📖
연구배경
🔬
연구방법
🏆
연구결과
AI에게 요청하기
추천
검색
질문

초록· 키워드

오류제보하기
A subset selection problem from a finite set of items is considered, which arises in automated packaging systems, so-called multi-head weighers. Given a finite set of items with their integral weights, the problem asks to find a subset of the items so that the total weight of chosen items is no less than an integral target weight, and it is also made as close to the target weight as possible. When discrete items (e.g., green peppers) are given, the packaging quality may depend on the cardinality of a selected subset, i.e., the number of chosen items in a package, as well as the total weight of them. A cardinality constraint is imposed on the subset selection problem to be discussed in this paper, where the cardinality of a selected subset is allowed to be either a prescribed positive integer or it plus one at most. In this paper, a pseudo-polynomial time algorithm is designed to solve the problem under an assumption on the range of item weights. Numerical experiments are also conducted to demonstrate the performance of the proposed algorithm on the cardinality of a selected subset, and the results are reported.

목차

Abstract
1. INTRODUCTION
2. PROBLEM DESCRIPTION
3. PROPOSED ALGORITHM
4. NUMERICAL RESULTS
5. CONCLUDING REMARKS
REFERENCES

참고문헌 (0)

참고문헌 신청

함께 읽어보면 좋을 논문

논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!

이 논문의 저자 정보

최근 본 자료

전체보기

댓글(0)

0

UCI(KEPA) : I410-ECN-0101-2018-003-003540034