EconPapers    
Economics at your fingertips  
 

Modeling and solving a dynamic logistics network design problem with temporary capacity expansion and reduction

Isabel Correia and Teresa Melo

No 21, Technical Reports on Logistics of the Saarland Business School from Saarland University of Applied Sciences (htw saar), Saarland Business School

Abstract: This study addresses a two-echelon network design problem that determines the location and size of new warehouses, the removal of company-owned warehouses, the inventory levels of multiple products at the warehouses, and the assignment of suppliers as well as customers to warehouses over a multi-period planning horizon. A distinctive feature of our problem is that new warehouses operate with modular capacities that can be expanded or reduced over several periods, the latter not necessarily having to be consecutive. Moreover, in every period, the demand of a customer for a given product has to be satisfied by a single warehouse. This problem arises in the context of warehousing-as-a-service, a business scheme that offers flexible conditions for temporary capacity leasing. The associated fixed warehouse lease cost reflects economies of scale in the capacity size and the length of the lease contract. We develop a mixed-integer linear programming formulation and propose a matheuristic to solve this problem, which exploits the structure of the optimal solution of the linear relaxation to successively assign customers to open warehouses and fix other binary variables related to warehouse operation. Additional variable fixing rules are also developed, based on a scheme for managing inventories at warehouses and using the quantities provided by suppliers. Numerical experiments with randomly generated large-sized instances reveal that the proposed matheuristic outperforms a general-purpose solver in 74% of the instances by identifying higher quality solutions in a substantially shorter computing time.

Keywords: network design; temporary warehouse rental; capacity expansion and reduction; mixed integer programming; matheuristic (search for similar items in EconPapers)
Date: 2023
New Economics Papers: this item is included in nep-des and nep-tre
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.econstor.eu/bitstream/10419/303044/1/1902926161.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:zbw:htwlog:303044

Access Statistics for this paper

More papers in Technical Reports on Logistics of the Saarland Business School from Saarland University of Applied Sciences (htw saar), Saarland Business School Contact information at EDIRC.
Bibliographic data for series maintained by ZBW - Leibniz Information Centre for Economics ().

 
Page updated 2025-03-20
Handle: RePEc:zbw:htwlog:303044