Table of Contents
Fetching ...

Exponential Conic Optimization for Multi-Regime Service System Design under Congestion and Tail-Risk Control

Víctor Blanco, Miguel Martínez-Antón, Justo Puerto

TL;DR

This work addresses the design of single-facility service systems operating under multiple regimes with SLA and tail-risk considerations. It develops a mixed-integer exponential-cone optimization that exploits the hyperexponential end-to-end delay structure arising from regime-based routing among parallel $M/M/1$ queues, and supports selective SLA coverage, conflict-graph constraints, and CVaR tail control. Key contributions include explicit regime-dependent performance modeling, endogenous protected demand sets, exact conic representations, and a decomposition algorithm with a polynomial-time solution for conflict-free, uniform-confidence cases. The NYC EMS case study demonstrates substantial improvements in efficiency, congestion control, fairness, and robustness, illustrating the framework’s practical value for congestion-aware service system design.

Abstract

We study the design of single-facility service systems operating under multiple recurring regimes with service-level constraints on response times. Regime-dependent arrival and service rates induce hyperexponential response-time distributions, and the design problem selects regime-specific capacities to balance cost, congestion, fairness, and reliability. We propose a mixed-integer exponential conic optimization framework integrating SLA chance constraints, conflict-graph design restrictions, and CVaR-based tail-risk control. Although NP-hard, the problem admits an efficient decomposition scheme and tractable special cases. Computational experiments and a large-scale urban case study show substantial improvements over the current system, quantifying explicit trade-offs between efficiency, congestion control, fairness, and robustness. The framework provides a practical tool for congestion-aware and tail-control service system design.

Exponential Conic Optimization for Multi-Regime Service System Design under Congestion and Tail-Risk Control

TL;DR

This work addresses the design of single-facility service systems operating under multiple regimes with SLA and tail-risk considerations. It develops a mixed-integer exponential-cone optimization that exploits the hyperexponential end-to-end delay structure arising from regime-based routing among parallel queues, and supports selective SLA coverage, conflict-graph constraints, and CVaR tail control. Key contributions include explicit regime-dependent performance modeling, endogenous protected demand sets, exact conic representations, and a decomposition algorithm with a polynomial-time solution for conflict-free, uniform-confidence cases. The NYC EMS case study demonstrates substantial improvements in efficiency, congestion control, fairness, and robustness, illustrating the framework’s practical value for congestion-aware service system design.

Abstract

We study the design of single-facility service systems operating under multiple recurring regimes with service-level constraints on response times. Regime-dependent arrival and service rates induce hyperexponential response-time distributions, and the design problem selects regime-specific capacities to balance cost, congestion, fairness, and reliability. We propose a mixed-integer exponential conic optimization framework integrating SLA chance constraints, conflict-graph design restrictions, and CVaR-based tail-risk control. Although NP-hard, the problem admits an efficient decomposition scheme and tractable special cases. Computational experiments and a large-scale urban case study show substantial improvements over the current system, quantifying explicit trade-offs between efficiency, congestion control, fairness, and robustness. The framework provides a practical tool for congestion-aware and tail-control service system design.
Paper Structure (13 sections, 6 theorems, 26 equations, 18 figures, 4 tables, 1 algorithm)

This paper contains 13 sections, 6 theorems, 26 equations, 18 figures, 4 tables, 1 algorithm.

Key Result

Theorem 1

The total (end-to-end) response time $R_a$ of the system for a demand point $a\in \mathcal{A}$ follows a shifted hyperexponential with cumulative distribution function and expectation where mixture weights $\pi_r := \frac{\Lambda_r}{\sum_{r'\in\mathcal{R}} \Lambda_{r'}}$ for all $r\in\mathcal{R}.$

Figures (18)

  • Figure :
  • Figure :
  • Figure :
  • Figure :
  • Figure :
  • ...and 13 more figures

Theorems & Definitions (13)

  • Theorem 1
  • proof
  • Corollary 1
  • proof
  • Remark 1
  • Theorem 2
  • proof
  • Proposition 1
  • proof
  • Corollary 2
  • ...and 3 more