IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v195y2025ics1366554524005155.html
   My bibliography  Save this article

Optimizing warehouse space allocation to maximize profit in the postal industry

Author

Listed:
  • Hyder, Jawad
  • Hassini, Elkafi

Abstract

This study develops a model to optimize warehouse space allocation to maximize throughput based on the capabilities of the delivery company. A bounded knapsack model is suggested for strategic customer selection. It integrates the customer’s inputs and the delivery company’s capabilities to determine a subset of customers and the respective volume amounts that need to be selected from each customer to maximize the company’s profit. The aim is to enhance profit by choosing customers with high profitability, considering penalties, and ensuring the total processed volume does not exceed the facility’s capacity. A heuristic method is suggested and tested. This method enables postal organizations to leverage their current assets and procedures to gain an edge in the expanding e-commerce sector. Numerical analyses indicate that the proposed greedy heuristic results in penalty values that are comparable to or lower than those of traditional methods, and it enhances the overall profitability of the postal organization.

Suggested Citation

  • Hyder, Jawad & Hassini, Elkafi, 2025. "Optimizing warehouse space allocation to maximize profit in the postal industry," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 195(C).
    • Handle: RePEc:eee:transe:v:195:y:2025:i:c:s1366554524005155
    DOI: 10.1016/j.tre.2024.103924
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554524005155
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2024.103924?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:eee:transe:v:195:y:2025:i:c:s1366554524005155. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description .

    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.