지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 저널정보
- 대한산업공학회 Industrial Engineering & Management Systems Industrial Engineering & Management Systems 제11권 제3호
- 발행연도
- 2012.9
- 수록면
- 288 - 298 (11page)
이용수
이 논문의 연구 히스토리 (2)
- 이 논문의 후속연구가 궁금하신가요?
- 연관 학술논문 또는 학술발표를 통해 보다 발전된 연구결과를 확인하실 수 있습니다.
- 이 논문의 연구 히스토리 확인하기
초록· 키워드
오류제보하기
Lot sizing and shipment scheduling are two interrelated decisions made by a manufacturing plant and a third-party logistics distribution center. This paper analyzes a dynamic inbound ordering problem and shipment problem with a freight container cost, in which the order size of multiple products and single container type are simultaneously considered. In the problem, each ordered product placed in a period is immediately shipped by some freight containers in the period, and the total freight cost is proportional to the number of containers employed. It is assumed that the load size of each product is equal and backlogging is not allowed. The objective of this study is to simultaneously determine the lot-sizes and the shipment schedule that minimize the total costs, which consist of production cost, inventory holding cost, and freight cost. Because the problem is NP-hard, we propose three meta-heuristic algorithms: a simulated annealing algorithm, a genetic algorithm, and a new population-based evolutionary meta-heuristic called selfevolution algorithm. The performance of the meta-heuristic algorithms is compared with a local search heuristic proposed by the previous paper in terms of the average deviation from the optimal solution in small size problems and the average deviation from the best one among the replications of the meta-heuristic algorithms in large size problems.
목차
ABSTRACT
1. INTRODUCTION
2. PROBLEM DESCRIPTION
3. OPTIMAL SOLUTION PROPERTIES
4. META-HEURISTIC ALGORITHMS
6. CONCLUSION
REFERENCES
참고문헌 (19)
참고문헌 신청
1. [학술지(정기간행물)] - Anily, S. / 2005 / Shipping multiple items by capacitated vehicles: an optimal dynamic programming approach / Transportation Science 39 (2) : 233 ~ 248
2. [학술지(정기간행물)] - Barbarosoglu, G. / 2000 / Analysis of solution space-dependent performance of simulated annealing: the case of the multi-level capacitated lot sizing problem / Computers and Operations Research 27 (9) : 895 ~ 903
3. [학술지(정기간행물)] - Bitran, G. R. / 1982 / Computational complexity of the capacitated lot size problem / Management Science 28 (10) : 1174 ~ 1186
4. [학술지(정기간행물)] - Florian, M. / 1980 / Deterministic production planning: algorithms and complexity / Management Science 26 (7) : 669 ~ 679
5. [학술지(정기간행물)] - Fumero, F. / 1999 / Synchronized development of production, inventory, and distribution schedules / Transportation Science 33 (3) : 330 ~ 340
2. [학술지(정기간행물)] - Barbarosoglu, G. / 2000 / Analysis of solution space-dependent performance of simulated annealing: the case of the multi-level capacitated lot sizing problem / Computers and Operations Research 27 (9) : 895 ~ 903
3. [학술지(정기간행물)] - Bitran, G. R. / 1982 / Computational complexity of the capacitated lot size problem / Management Science 28 (10) : 1174 ~ 1186
4. [학술지(정기간행물)] - Florian, M. / 1980 / Deterministic production planning: algorithms and complexity / Management Science 26 (7) : 669 ~ 679
5. [학술지(정기간행물)] - Fumero, F. / 1999 / Synchronized development of production, inventory, and distribution schedules / Transportation Science 33 (3) : 330 ~ 340
이 논문의 저자 정보
이 논문과 함께 이용한 논문
도료산업의 생산 및 수송 로트사이즈 결정 모형 연구
김형수
,
정석재
,
김경섭
대한산업공학회 추계학술대회 논문집
2013
.11
A Robust Joint Optimal Pricing and Lot-Sizing Model
Sungmook Lim
Management Science and Financial Engineering
2012
.11
최소공급량 정책을 위한 추후조달 롯사이징 문제
Ha
,
k-Chin Hwang
대한산업공학회 춘계공동학술대회 논문집
2009
.05
New formulations for Capacitated Lot-Sizing with Constrained and Linked Lot sizes
편집부
대한산업공학회 추계학술대회 논문집
2011
.11
시뮬레이션 분석을 통한 배치 공정의 Lot sizing 결정 방식 비교
조정진
,
구평회
대한산업공학회 춘계공동학술대회 논문집
2012
.05
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2014-530-001420224