우편 발송 비용 최소화를 위한 상업용 다량 우편물 선구분 적재
Presort and Loading of Commercial Bulk Mails for Minimizing Mailing Fees
0
조회
0
다운로드
3
인용
0
참고문헌
키워드
초록
We consider a problem of presort and loading of commercial bulk mails in a mailing service. Here, presort is the process by which a mailer prepares mail so that it is sorted to at least the finest extent required by the mailing service provider for the (discounted) price claimed. The problem is formulated as a special type of transportation problem. To solve industrial-sized problems, we develop an efficient heuristic algorithm and perform experimental tests on randomly generated problem instances. Results of the tests show that mailers can save mailing cost much more when they use small-sized mail trays with less frequent mailings. Also, large-sized mailers can obtain much more cost saving than small-sized mailers. In addition, cost saving effect is influenced by delivery area distribution of mails and fluctuation of mailing demand.
Abstract
We consider a problem of presort and loading of commercial bulk mails in a mailing service. Here, presort is the process by which a mailer prepares mail so that it is sorted to at least the finest extent required by the mailing service provider for the (discounted) price claimed. The problem is formulated as a special type of transportation problem. To solve industrial-sized problems, we develop an efficient heuristic algorithm and perform experimental tests on randomly generated problem instances. Results of the tests show that mailers can save mailing cost much more when they use small-sized mail trays with less frequent mailings. Also, large-sized mailers can obtain much more cost saving than small-sized mailers. In addition, cost saving effect is influenced by delivery area distribution of mails and fluctuation of mailing demand.
참고문헌 (10)
- Lim, A., "A Transportation Problem with Minimum Quantity Commitment", Transportation Science, 40(1), pp.117~129 (2006)
- Lim, A., "Bottleneck Problem with Minimum Quantity Commitments", Naval Research Logistics, 53, pp.91~100 (2006)
- Lim, A., "The Bidding Selection and Assignment Problem with Minimum Quantity Commitment", Journal of Operational Research Society, 59, pp.692~702 (2008)
- 박철순, "우편집중국 소포구분 작업장 인력계획 수립모형", 산업경영시스템학회지, 32(3), pp.1~9 (2009), 한국산업경영시스템학회
- Na, D. G., "Trends of Next Generation Online Bulk- Mail Acceptance Technology", Postal and Logistics Technology Review, 7(4), pp.67~82 (2008)
- 김은혜, "우편물류 종추적 정보 신뢰성 향상을 위한 프로세스 개선방안 연구", 산업경영시스템학회지, 34(2), pp.92~102 (2011), 한국산업경영시스템학회
- Chen, F., "Analysis of supply contracts with minimum total order quantity commitments and non-stationary demands", European Journal of Operational Research, 31, pp.309~323 (1999)
- "Mailing Standards of the United States Postal Service DMM (Domestic Mail Manual)", USPS, ~ (2009)
- Validation of Intelligent Mail Service in Korea’s Portal Service Environments, "Lim, S.-K.", ETRI, ~ (2009)
- Bassok, Y., "Analysis of Supply Contracts with Total Minimum Commitment", IIE Transactions, 29(5), pp.373~381 (1997)