Abstract
This study focuses on the presort loading of commercial bulk mail. Here, presort is the process by which a mailer prepares mail such that it is sorted to at least the finest extent required by the postal service provider for a claimed (discounted) price. We formulated this presort loading problem (PLP) as a special case of transportation problem with minimum quantity commitment (MQC) constraints. In addition, we developed a polynomial time optimal solution algorithm for the PLP and performed computational experiments on randomly generated problem instances under various discount structures. Results of the computational experiments show that mailers can potentially reduce their costs by sending mail less frequently, using small-sized mail trays; however, the discount structure does not affect the main results. There is some evidence that smaller cost reductions on mailing fees occur as the variation in the discount rate increases; however, the effects of discount structure are nominal compared with the gains from changing the mailing frequency. Mailing fee savings are more heavily influenced by the discount structure when MQC constraints become tighter.
Similar content being viewed by others
References
Bassok Y (1997). Design of component-supply contract with commitment-revision flexibility. IBM Journal of Research and Development 41 (6): 693–703.
Bassok Y and Anupindi R (1997). Analysis of supply contracts with total minimum commitment. IIE Transactions 29 (5): 373–381.
Bassok Y and Anupindi R (2008). Analysis of supply contracts with commitments and flexibility. Naval Research Logistics 55 (5): 459–477.
Bloss R (2013). Automation pushes the envelope of postal mail handling efficiency. Assembly Automation 33 (1): 3–7.
Cebry M, DeSilva AH and DiLisio FJ (1992). Management science in automating postal operations: Facility and equipment planning in the United States Postal Service. Interface 22 (1): 110–130.
Chen FY and Krass D (2001). Analysis of supply contracts with minimum total order quantity commitments and non-stationary demands. European Journal of Operational Research 131 (2): 309–323.
Chen FY, Xue W and Yang J (2013). Optimal inventory policy in the presence of a long-term supplier and a spot market. Operations Research 61 (1): 88–97.
Cohen RH, Robinson MH, Waller JD and Xenakis SS (2006). Worksharing: How much productive efficiency, at what cost and at what price? In: Crew MA and Kleindorfer PR (eds). Progress toward Liberalization of the Postal and Delivery. Springer, New York, pp 141–152.
Crew MA and Brennan TJ (2014). The Role of the Postal and Delivery Sector in a Digital Age. Edward Elgar: Northampton.
Duhaime R, Riopel D and Langevin A (2001). Value analysis and optimization of reusable containers at Canada Post. Interface 31 (3): 3–15.
Durango-Cohen E and Yano C (2006). Supplier commitment and production decisions under a forecast-commitment contract. Management Science 52 (1): 54–67.
Hsu H-M and Chen Z-Y (2011). Two-stage ordering policy under buyer’s minimum-commitment quantity contract. American Journal of Operations Research 1 (3): 84–99.
Hsu H-M and Chen Z-Y (2012). A material purchase model under a buyer’s minimum-commitment quantity contract. Journal of Information and Optimization Sciences 33 (4–5): 575–600.
Korea Post (2012). Annual Report (in Korean).
Kostamis D and Duenyas I (2009). Quantity commitment, production and subcontracting with bargaining. IIE Transactions 41 (8): 677–686.
Lim A and Xu Z (2006). The bottleneck problem with minimum quantity commitments. Naval Research Logistics 53 (1): 91–100.
Lim A, Wang F and Xu Z (2006). A transportation problem with minimum quantity commitment. Transportation Science 40 (1): 117–129.
Lim A, Xu Z and Wang F (2008). The bidding selection and assignment problem with minimum quantity commitment. Journal of the Operational Research Society 59 (5): 692–702.
Lim A, Qin H and Xu Z (2012). The freight allocation problem with lane cost balancing constraint. European Journal of Operational Research 217 (1): 26–35.
Qin H, Luo M, Gao X and Lim A (2012). The freight allocation problem with all-units quantity-based discount: A heuristic algorithm. Omega 40 (4): 415–423.
Robinson A (2011). Why the postal service exists. Courier Express and Postal Observer: http://cepobserver.com/2011/10/why-the-postal-service-exists/.
USPS (2011). Domestic Mail Manual.
Zhang W, Chen Y, Hua Z and Xue W (2011). Optimal policy with a total order quantity commitment contract in the presence of a spot market. Journal of Systems and Systems Engineering 20 (1): 25–42.
Acknowledgements
This work was supported by the Incheon National University (International Cooperative) Research Grant in 2012.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Lim, SK., Kim, JG. & Shin, YH. Optimal three-level presort loading of commercial bulk mail in the postal service industry. J Oper Res Soc 66, 1007–1022 (2015). https://doi.org/10.1057/jors.2014.68
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1057/jors.2014.68