IDEAS home Printed from https://ideas.repec.org/a/inm/orinte/v37y2007i6p515-525.html
   My bibliography  Save this article

Optimizing Highway Transportation at the United States Postal Service

Author

Listed:
  • Anthony Pajunas

    (United States Postal Service, Washington, DC 20260)

  • Edward J. Matto

    (IBM Global Business Services, Fairfax, Virginia 22033)

  • Michael Trick

    (Tepper School of Business, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213)

  • Luis F. Zuluaga

    (Faculty of Business Administration, University of New Brunswick, Fredericton, New Brunswick, Canada E3B 5A3)

Abstract

The United States Postal Service (USPS) delivers more than 200 billion items per year. Transporting these items in a timely and cost-efficient manner is critical if USPS is to meet its service and financial goals. The Highway Corridor Analytic Program (HCAP) is a tool that aids USPS transportation analysts in identifying cost-savings opportunities in the surface-transportation network. By using HCAP, USPS has saved millions of dollars annually.

Suggested Citation

  • Anthony Pajunas & Edward J. Matto & Michael Trick & Luis F. Zuluaga, 2007. "Optimizing Highway Transportation at the United States Postal Service," Interfaces, INFORMS, vol. 37(6), pages 515-525, December.
    • Handle: RePEc:inm:orinte:v:37:y:2007:i:6:p:515-525
    DOI: 10.1287/inte.1070.0322
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/inte.1070.0322
    Download Restriction: no
    File URL: https://libkey.io/10.1287/inte.1070.0322?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Hanif D. Sherali & J. Cole Smith, 2001. "Improving Discrete Model Representations via Symmetry Considerations," Management Science, INFORMS, vol. 47(10), pages 1396-1407, October.
    2. Karen Aardal, 1998. "Reformulation of capacitated facility location problems:How redundant information can help," Annals of Operations Research, Springer, vol. 82(0), pages 289-308, August.
    3. Martin Desrochers & Jacques Desrosiers & Marius Solomon, 1992. "A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows," Operations Research, INFORMS, vol. 40(2), pages 342-354, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jianjun Zhang & Ou Tang & Jin Zhao & Jiazhen Huo & Yonggang Xia, 2013. "CPEL Redesigns Its Land Express Network," Interfaces, INFORMS, vol. 43(3), pages 221-231, May-June.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ghoniem, Ahmed & Farhadi, Farbod & Reihaneh, Mohammad, 2015. "An accelerated branch-and-price algorithm for multiple-runway aircraft sequencing problems," European Journal of Operational Research, Elsevier, vol. 246(1), pages 34-43.
    2. Niu, Huimin & Zhou, Xuesong & Tian, Xiaopeng, 2018. "Coordinating assignment and routing decisions in transit vehicle schedules: A variable-splitting Lagrangian decomposition approach for solution symmetry breaking," Transportation Research Part B: Methodological, Elsevier, vol. 107(C), pages 70-101.
    3. Valerio de Carvalho, J. M., 2002. "LP models for bin packing and cutting stock problems," European Journal of Operational Research, Elsevier, vol. 141(2), pages 253-273, September.
    4. Wang, Xiubin & Regan, Amelia C., 2002. "Local truckload pickup and delivery with hard time window constraints," Transportation Research Part B: Methodological, Elsevier, vol. 36(2), pages 97-112, February.
    5. Veaceslav Ghilas & Jean-François Cordeau & Emrah Demir & Tom Van Woensel, 2018. "Branch-and-Price for the Pickup and Delivery Problem with Time Windows and Scheduled Lines," Transportation Science, INFORMS, vol. 52(5), pages 1191-1210, October.
    6. Filippo Focacci & Andrea Lodi & Michela Milano, 2002. "A Hybrid Exact Algorithm for the TSPTW," INFORMS Journal on Computing, INFORMS, vol. 14(4), pages 403-417, November.
    7. Raf Jans, 2009. "Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints," INFORMS Journal on Computing, INFORMS, vol. 21(1), pages 123-136, February.
    8. Esmaeilbeigi, Rasul & Mak-Hau, Vicky & Yearwood, John & Nguyen, Vivian, 2022. "The multiphase course timetabling problem," European Journal of Operational Research, Elsevier, vol. 300(3), pages 1098-1119.
    9. Edirisinghe, N.C.P. & James, R.J.W., 2014. "Fleet routing position-based model for inventory pickup under production shutdown," European Journal of Operational Research, Elsevier, vol. 236(2), pages 736-747.
    10. Du, Jianhui & Zhang, Zhiqin & Wang, Xu & Lau, Hoong Chuin, 2023. "A hierarchical optimization approach for dynamic pickup and delivery problem with LIFO constraints," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 175(C).
    11. Weijun Xie & Yanfeng Ouyang & Sze Chun Wong, 2016. "Reliable Location-Routing Design Under Probabilistic Facility Disruptions," Transportation Science, INFORMS, vol. 50(3), pages 1128-1138, August.
    12. de Lima, Vinícius L. & Alves, Cláudio & Clautiaux, François & Iori, Manuel & Valério de Carvalho, José M., 2022. "Arc flow formulations based on dynamic programming: Theoretical foundations and applications," European Journal of Operational Research, Elsevier, vol. 296(1), pages 3-21.
    13. Leo Liberti & James Ostrowski, 2014. "Stabilizer-based symmetry breaking constraints for mathematical programs," Journal of Global Optimization, Springer, vol. 60(2), pages 183-194, October.
    14. Omid Shahvari & Rasaratnam Logendran & Madjid Tavana, 2022. "An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems," Journal of Scheduling, Springer, vol. 25(5), pages 589-621, October.
    15. Jans, Raf & Degraeve, Zeger, 2008. "A note on a symmetrical set covering problem: The lottery problem," European Journal of Operational Research, Elsevier, vol. 186(1), pages 104-110, April.
    16. Chardy, Matthieu & Klopfenstein, Olivier, 2012. "Handling uncertainties in vehicle routing problems through data preprocessing," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(3), pages 667-683.
    17. Ortiz-Astorquiza, Camilo & Contreras, Ivan & Laporte, Gilbert, 2018. "Multi-level facility location problems," European Journal of Operational Research, Elsevier, vol. 267(3), pages 791-805.
    18. Djamal Habet & Michel Vasquez & Yannick Vimont, 2010. "Bounding the optimum for the problem of scheduling the photographs of an Agile Earth Observing Satellite," Computational Optimization and Applications, Springer, vol. 47(2), pages 307-333, October.
    19. Hernandez, Florent & Feillet, Dominique & Giroudeau, Rodolphe & Naud, Olivier, 2016. "Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 249(2), pages 551-559.
    20. Emilio Zamorano & Annika Becker & Raik Stolletz, 2018. "Task assignment with start time-dependent processing times for personnel at check-in counters," Journal of Scheduling, Springer, vol. 21(1), pages 93-109, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:orinte:v:37:y:2007:i:6:p:515-525. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.