SearcharxivSearch

arXiv subjects

Uta Mohring

Publications and source records attributed to Uta Mohring.

2 recordsLinked to original sources

Context-Aware Synthesis of Optimization Pipelines for Warehouse Optimization

Order fulfillment in manual picker-to-goods warehouses involves interconnected decisions such as item assignment, order batching, and picker routing. While integrated models capture interactions between these decisions, practical warehouse systems often require decomposed approaches due to organizational boundaries, differing responsibilities, or limited data availability. Existing studies primarily evaluate algorithms for isolated subproblems or fixed subproblem combinations for specific warehouse settings, but lack a general mechanism to determine applicable algorithm configurations, compose them into valid solution pipelines, and assess their performance. With Context-Aware Synthesis of Optimization Pipelines (CASOP), we propose a framework for constructing and evaluating context-specific optimization pipelines and apply these to order fulfillment. The framework comprises: (1) a modular repository of algorithms for common order fulfillment problems; (2) semantic data and algorithm cards to describe warehouse context and algorithm requirements; (3) a taxonomy that structures order fulfillment problems into relevant subproblems; (4) a pipeline synthesizer that identifies applicable algorithms for a given warehouse context and composes all valid optimization pipelines; and (5) a pipeline evaluator that assesses all resulting pipelines. We demonstrate the framework on 7 benchmark instance sets covering four problem classes, resulting in 1,063,044 valid pipelines. The framework supports researchers and practitioners in designing, automatically synthesizing, and selecting valid, high-performing algorithmic pipelines for warehouse operations. The software is open-source and available at https://github.com/kit-dsm/ware_ops_pipes and https://github.com/kit-dsm/ware_ops_algos. Keywords: Warehouse optimization, Algorithm selection, Pipeline synthesis, Order fulfillment

cs.AI

Same-day or next-day? Transparent time-dependent shipment pricing for e-fulfillment

We develop a parsimonious model of an e-commerce fulfillment center that offers time-dependent shipment options and corresponding fees to utility-maximizing customers arriving according to a Poisson process. For any such policy, we provide an exact steady-state analysis using the underlying periodic Markov chain to characterize system performance. Because shipment fees shape both the volume and timing of same-day demand, direct optimization over the price domain is analytically intractable. To enable structural and computational insights, we introduce a transformation that maps each shipment-fee policy to its induced cumulative demand profile. This reformulation reveals that the optimal policy features a cutoff time and monotonically increasing fees, and it yields a supermodular profit function that can be optimized in polynomial time. We also propose a simple two-level time-dependent fee structure that is intuitive for customers and achieves near-optimal performance. Numerical experiments show that introducing a cutoff time substantially improves profits under static fees, and that using time-dependent fees produces further significant gains. Overall, transparent time-dependent shipment policies help firms align same-day demand with fulfillment capacity while maintaining transparency and fairness for customers.

math.OC