Skip to content

Author

Stefan Minner

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Open access Aug 2026

Dispatch or Hold? An Inverse Optimization and Reinforcement Learning Approach for Multiobjective On-Demand Delivery

In large-scale on-demand food delivery systems, dynamic order dispatching needs to balance immediate dispatch and order holding amid competing objectives, including delivery efficiency, service timeliness, and courier utilization. Holding certain orders for future consolidation may improve delivery efficiency but impair timeliness. In such systems, real-time decisions must be made to determine both when to dispatch orders and how to dispatch orders by grouping them to share dispatch routes. We propose a hierarchical offline estimation and on-policy learning framework that integrates inverse optimization with deep reinforcement learning. First, the framework decides which orders to dispatch immediately and which to hold for future periods. Next, it consolidates the dispatched orders by solving a multiobjective weighted set partitioning problem. We estimate the tradeoff weights across multiple delivery objectives using real-world data via cutting plane–based inverse optimization that supports combinatorial decisions. The learned cost structure is then embedded in a Markov decision process, and a dispatch policy is trained with proximal policy optimization to maximize long-term performance. We validate our approach using real-world data from a major food delivery platform. Compared with the platform’s current practice and the heuristic benchmarks, the learned policy significantly improves operational performance and provides the most effective balance across all operational objectives. The evaluation results demonstrate that strategic order holding can effectively increase grouping opportunities and improve overall delivery efficiency. In periods and areas with low order arrival density, a longer holding time can yield better consolidation opportunities and improved delivery efficiency. However, orders with long travel distances are less suitable for holding due to limited potential for grouping. History: This paper has been accepted for the Transportation Science Special Issue on The First INFORMS TSL Data-Driven Research Challenge. Funding: This research was supported by the Deutsche Forschungsgemeinschaft as part of the following research group: Advanced Optimization in a Networked Economy [Grant GRK2201/277991500] and by the Cross-Disciplinary Research Fund (CDRF) from George Washington University. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2025.0149 .

Yi-Hua Wang, Long He, Zhengling Qi et al. · 0 citations
Preprint Aug 2026

Hard Constraints, Smooth Gradients: Learning Feasible Inventory Policies via Differentiable Projection

Many operational problems are constrained sequential decision processes with large, combinatorial action spaces and interdependent feasibility constraints. Mixed-integer linear programs (MILPs) handle such constraints flexibly but scale poorly in stochastic environments. Deep reinforcement learning (DRL) promises scalable decision rules, but existing methods either penalize constraints rather than enforce them, or rely on feasibility mechanisms that break down once constraints interact. We bridge this gap by embedding a differentiable convex optimization module inside the policy: a neural network proposes continuous action targets, a quadratic program projects them onto the relaxed feasible set, and a dual-informed integer mapping restores integrality while preserving feasibility. Given a differentiable simulator, the policy trains end to end from sampled trajectories using pathwise gradients, while handling hard constraints with similar flexibility to MILPs. We show that our feasibility enforcement has bounded error relative to an exact integer projection and ensures the entire feasible action space is reachable. We apply the method to multi-echelon production-inventory planning under shared resource and material constraints. Our policy attains an average optimality gap below 1% on small instances. It further outperforms state-of-the-art echelon base-stock policies by up to 9.75% and a rolling-horizon multi-stage stochastic program by at least 7.7% in larger networks. On an industry-scale case study from ASML, it reduces average cost by up to 3.22% relative to the best-known benchmark policy. The savings are largest where planning is hardest: in tightly capacitated systems with high demand variability. More broadly, our work shows that DRL can deliver economically significant savings in sequential decision problems with interdependent hard constraints, which are widespread in practice.

P. Helm, John C. Doerr, Joren Gijsbrechts et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.