[논문]계단형 수송비용을 고려한 동적 로트 크기 결정

김재곤; 이동호; 최성훈; 임승길

[국내논문] 계단형 수송비용을 고려한 동적 로트 크기 결정
Dynamic Lot-Sizing with Stepwise Transportation Costs 원문보기

산업경영시스템학회지 = Journal of society of korea industrial and systems engineering, v.30 no.4, 2007년, pp.127 - 132

김재곤 (인천대학교 산업경영공학과) , 이동호 (한양대학교 산업공학과) , 최성훈 (상명대학교 산업정보시스템공학과) , 임승길 (성결대학교 e-비즈니스 IT학부)

초록
AI-Helper

본 논문에서는 운송비용과 재고유지비용의 합을 최소화하는 것을 목적으로 유한 계획기간 동안의 수요를 충족시키는 동적 랏사이징 문제를 다룬다. 운송비용을 고려하는 기존의 랏사이징 모형들과는 달리 운송 트럭의 대수에 따라 계단형으로 운송비용이 증가하는 경우를 다루고 있다. 이 문제를 선형정수모형으로 모델링하며 그리디 방식의 휴리스틱을 제안한다. 제안된 휴리스틱의 성능을 평가하기 위해 계산실험을 수행하며, 그 결과 매우 짧은 시간 안에 최적해에 가까운 해를 찾을 수 있음을 보여준다.

Keyword

AI 본문요약
AI-Helper

* AI 자동 식별 결과로 적합하지 않은 문장이 있을 수 있으니, 이용에 유의하시기 바랍니다.

문제 정의

This paper is concerned with the single-item dynamic lot-sizing problem in which the transportation costs are computed by the number of trucks, i.e., stepwise transportation costs. The objective is to minimize the sum of transportation and inventory holding costs.
, stepwise transportation costs. The objective is to minimize the sum of transportation and inventory holding costs. Unlike the previous research articles that assume the linear transportation cost, we consider the case in which the linear transportation cost is computed by the number of trucks used.
In general, companies try to fully utilize the trucks if possible to minimize the transportation costs, the associated inventory holding costs increase. These results in the basic trade-off between the transportation and inventory holding costs, and the focus of this paper is to suggest the algorithm that can give the solution that balances these cost factors.

제안 방법

The problem considered in this paper can be defined as the problem of determining the lot sizes while satisfying the given dynamic demand over a finite planning horizon for the objective of minimizing the sum of transportation and inventory holding costs. The planning horizon is divided into T periods, and demands over the planning horizon are given and deterministic.
find near optimal solutions for problem [P2]. As stated earlier, the basic idea of the algorithm is that the quantities that exceed the integer multiples of the truck capacity are reassigned while considering the associated cost changes. In general, it would be better to utilize the truck capacity as much as possible when the transportation cost is relatively higher than the holding cost while it would be better not to order more than needed in the opposite situation.
test problems. Two performance measures were used in the test. They are percentage deviations from optimal solution values and CPU seconds.

이론/모형

In this paper, the problem is formulated as an integer linear programming model, which is an extension of the classical dynamic lot-sizing formulation. Since the zero inventory property does not hold, the problem considered in this paper is more difficult than the classical dynamic lot-sizing problem.
costs. An integer linear programming formulation, which is an extension of the classical dynamic lot-sizing formulation, was suggested to model the problem mathematically, and the simple greedy algorithm was developed. The basic idea is to reassign the quantities that exceeds the integer multiples of truck capacity while considering the associated cost changes in a greedy manner.

성능/효과

For the test, 10 problems with different data were generated randomly for each of six levels of the number of periods (5, 10, 20, 30, 40, 50), and hence 60 problems were generated in total. Demands were generated from DU(1Q, 100), where DU(a, b) denotes the discrete uniform distribution with range [a, b].
In the algorithm suggested in this paper, the improvements are done in a greedy manner in such a way that the total cost is decreased in the steepest decent direction.

참고문헌 (15)

Agrawal, A. and Park, J. K.; 'Improved Algorithm for Economic Lot Size Problems,' Operations Research, 41 : 549-571, 1993

상세보기
Bertazzi, L., Speranza, M. G., and Ukovich, W.; 'Exact and Heuristic Solutions for a Shipment Problem with Given Frequencies,' Management Science, 46 : 973-988, 2000

상세보기
Federgruen, A. and Tzur, M.; 'A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in O(nlogn) or O(n),' Management Science, 37 : 909-925, 1991

상세보기
Hall, R. W.; 'On the Integration of Production and Distribution : Economic Order and Production Quantity Implications,' Transportation Research-Part B, 30 : 387-403, 1996

상세보기
Johnson, L. A. and Montgomery, D. C.; Operations Research in Production Planning, Scheduling, and Inventory Control, John Wiley and Sons, 1974
Kim, J.-U. and Kim, Y.-D.; 'A Lagrangean Relaxation Approach to Multi-Period Inventory/Distribution Planning,' Journal of the Operational Research Society, 51 : 364-370, 2000

상세보기
Lee, C.-Y., Cetinkaya, S., and Jaruphongsa, W.; 'A Dynamic Model for Inventory Lot Sizing and Outbound Shipment Scheduling at a Third-Party Warehouse,' Operations Research, 51 : 735-747, 2003

상세보기
Manne, A. S.; 'Programming of Economic Lot Sizes,' Management Science, 4 : 115-135, 1958

상세보기
Qu, W. W., Bookbinder, J. H., and Iyogun, P.; 'An Integrated Inventory-Transportation System with Modified Periodic Policy for Multiple Products,' European Journal of Operational Research, 115 : 254-269, 1999

상세보기
Swenseth, S. R. and Godfrey, M. R.; 'Incorporating Transportation Costs into Inventory Replenishment Decisions,' International Journal of Production Economics, 77 : 113-130, 2002

상세보기
van Norden, L. and van de Velde, S.; 'Multi-product Lot-Sizing with a Transportation capacity Reservation Contract,' European Journal of Operational Research, 165 : 127-138, 2005

상세보기
Vroblefski, M., Ramesh, R., and Zionts, S.; 'Efficient Lot-Sizing under a Differential Transportation Cost Structure for Serially Distributed Warehouses,' European Journal of Operational Research, 127 : 574-593, 2000

상세보기
Wagelmans, A. P. M., Van Hoesel, S. P. M., and Kolen, A.; 'Economic Lot Sizing: an O(nlogn) algorithm that Runs in Linear Time in the Wagner-Whitin Case,' Operations Research, 40 : 145-156, 1992

상세보기
Wagner, H. M., and Whitin, T.; 'Dynamic Version of the Economic Lot Size Model,' Management Science, 5 : 89-96, 1958

상세보기
Zhao, Q.-H., Wang, S.-Y., Lai, K. K., Xia, G. P.; 'Model and Algorithm of an Inventory Problem with the Consideration of Transportation Cost,' Computers and Industrial Engineering, 46 : 389-397, 2004

상세보기

저자의 다른 논문 :

LOADING...

활용도 분석정보

상세보기

다운로드

내보내기

활용도 Top5 논문

해당 논문의 주제분야에서 활용도가 높은 상위 5개 콘텐츠를 보여줍니다.
더보기 버튼을 클릭하시면 더 많은 관련자료를 살펴볼 수 있습니다.

내보내기 구분	파일저장 인쇄 메일전송
구성항목	기본정보 상세정보 관리번호, 논문명, 저널/프로시딩명, 저자 , 발행년, 권, 호, 시작페이지, 끝페이지, 발행기관 관리번호, 논문명, 대등논문명, 저자 , 저널/프로시딩명, 발행기관, 발행년, 발행언어, 권, 호, 시작페이지, 끝페이지, ISBN, ISSN, 주제분야, 키워드, 초록(한글), 초록(영문), 저자(소속기관)
저장형식	Text(ASCII format) Excel format RefWorks Direct Export RIS format (for Reference Manager, ProCite, EndNote), Scholar's Aids, Mendeley
메일정보	받는사람 (필수) @ 보내는사람 (선택) @ 제목 내용 KISTI 검색결과 이메일 서비스
안내	총 건의 자료가 검색되었습니다. 다운받으실 자료의 인덱스를 입력하세요. (1-10,000) 검색결과의 순서대로 최대 10,000건 까지 다운로드가 가능합니다. 데이타가 많을 경우 속도가 느려질 수 있습니다.(최대 2~3분 소요) 다운로드 파일은 UTF-8 형태로 저장됩니다. 파일의 내용이 제대로 보이지 않을실 때는 웹브라우저 상단의 보기 -> 인코딩 -> 자동선택 여부를 확인하십시오. ~ Text(ASCII format) Excel format

연합인증