Lotsize optimization leading to a p-median problem with cardinalities

2008/04/09 by Constantin Gaul, Gaul, Constantin, Sascha Kurz +2
Business, Management and Accounting · Engineering · #90B80 #90C10 #90C59 #Advanced Manufacturing and Logistics Optimization #FOS: Mathematics #Facility Location and Emergency Management #Optimization and Control (math.OC) #Urban and Freight Transport Logistics

paper · pdf · doi:10.48550/arxiv.0804.1408

openalex publication_date 2008/04/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We consider the problem of approximating the branch and size dependent demand of a fashion discounter with many branches by a distributing process being based on the branch delivery restricted to integral multiples of lots from a small set of available lot-types. We propose a formalized model which arises from a practical cooperation with an industry partner. Besides an integer linear programming formulation and a primal heuristic for this problem we also consider a more abstract version which we relate to several other classical optimization problems like the p-median problem, the facility location problem or the matching problem.

Citations

• Local Search Heuristics for k-Median and Facility Location Problems

Related

• The Combinatorics of (S,M,L,XL) or the best fitting delivery of T-shirts
• An exact column-generation approach for the lot-type design problem -- extended abstract
• Two-level lot-sizing with inventory bounds
• An extended version of a Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
• Determining Optimal Selling Price and Lot Size When the Supplier Offers All‐Unit Quantity Discounts*