U.S. Postal Airmail Routing Optimization

• Published in: Transportation research record Vol. 2334; no. 1; pp. 21 - 28
• Main Authors: Li, Yihua, Miao, Qing, Wang, Bruce X.
• Format: Journal Article
• Language: English
• Published: Los Angeles, CA SAGE Publications 01.01.2013
• Subjects: Allocations; Carriers; Mail; Mathematical analysis; Mathematical models; Optimization; Shipping; Transportation
• ISBN: 9780309287074; 0309287073
• ISSN: 0361-1981; 2169-4052
• DOI: 10.3141/2334-03

An airmail routing problem at the United States Postal Service (USPS) is studied in this paper. Each day, millions of airmails of different priorities are collected and shipped between local USPS mail processing and distribution centers (P&DCs) by commercial air carriers. The carriers provide flight capacities and services according to contracts. Each available flight has a finite, maximum capacity for the airmails. In addition, the shipping between P&DCs incurs a cost that is determined by the type of mail, the volume, and the shipping distance. The research objective is to decide airmail allocation onto flights subject to the agreed-on air capacity to minimize system shipping costs while maintaining service quality. An integrated mathematical model is developed to design air routes and to allocate airmails optimally to routes for an improvement on the practice of isolated scheduling at each P&DC. A column generation method is proposed for the model. A numerical test is conducted with operational data. The test not only shows a significant increase in the total volume that can be shipped but also indicates better service in terms of on-time and early deliveries.