pith. sign in

arxiv: 2604.09218 · v1 · submitted 2026-04-10 · 🧮 math.OC

A priority-driven constructive heuristic for assigning and scheduling spontaneous volunteers in disaster response

Martina Sperling This is my paper

Pith reviewed 2026-05-10 17:13 UTC · model grok-4.3

classification 🧮 math.OC
keywords spontaneous volunteersdisaster responseconstructive heuristicworkforce assignmentschedulinglexicographic optimizationmixed-integer programmingvolunteer coordination
0
0 comments X

The pith

A priority-driven constructive heuristic solves large-scale spontaneous volunteer assignment problems in disaster response up to 28 times faster than exact solvers while closely matching optimal primary objectives.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper develops a constructive heuristic specifically tailored to the spontaneous volunteer coordination problem, which assigns and schedules volunteers with varying skills to relief activities under time pressure and dynamic arrivals. It builds solutions by prioritizing assignments according to the lexicographic objective order, scarce capabilities, and workload balance across activities. Tested on 3200 instances derived from the 2013 Halle flood with up to 10,000 volunteers and over 4,000 activity-time slots, the method delivers solutions that track optimal values for the main goals while running in minutes. This matters because exact mixed-integer solvers exceed operational time limits in more than 60 percent of cases, leaving responders without usable plans during real events. The approach therefore provides a practical way to coordinate independent volunteers at scale without sacrificing the most critical coordination criteria.

Core claim

The priority-driven constructive heuristic for the SVCP explicitly exploits the lexicographic objective hierarchy, capability scarcity among volunteers, and workload balancing across activities to generate feasible assignments and schedules rapidly, achieving close approximation of optimal primary objective values across large instances while delivering a median runtime speedup of approximately 28x compared to exact solvers.

What carries the argument

A priority-driven constructive heuristic that iteratively builds assignments by scoring volunteers against the ordered objectives, scarce skills, and activity workload targets.

If this is right

  • The heuristic produces usable solutions within minutes for instances where exact solvers exceed decision time limits in over 60% of cases.
  • It scales to problems with 10,000 volunteers and more than 4,000 activity-time combinations while preserving primary objective quality.
  • Solutions remain feasible under the heterogeneous capabilities, dynamic arrivals, and operational constraints of the SVCP model.
  • The method enables real-time decision support for coordinators managing spontaneous volunteers during large disasters.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same priority-scoring structure could be embedded inside a rolling-horizon loop to re-optimize as new volunteers arrive or activities change.
  • Similar constructive logic might transfer to other time-critical workforce problems such as emergency medical staffing or logistics surge operations.
  • Comparing the heuristic against human dispatchers on historical incident logs would test whether the automated priorities produce better or faster outcomes than current practice.

Load-bearing premise

The disaster response scenarios simulated from the 2013 Halle flood data sufficiently represent the scale, arrival patterns, and constraints of real large-scale rolling-horizon operations.

What would settle it

A field trial or additional dataset from a different major disaster in which the heuristic's solution quality for the primary objectives deviates substantially from known optima or observed assignments while runtime remains high.

Figures

Figures reproduced from arXiv: 2604.09218 by Martina Sperling.

Figure 1
Figure 1. Figure 1: Positioning of operations research approaches for SV coordination with respect [PITH_FULL_IMAGE:figures/full_fig_p011_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Illustrative example of the spontaneous volunteer coordination problem, adapted [PITH_FULL_IMAGE:figures/full_fig_p012_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Relationship between the objective structure of the SVCP optimization model [PITH_FULL_IMAGE:figures/full_fig_p017_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Decision structure of the proposed priority-driven constructive heuristic. At each [PITH_FULL_IMAGE:figures/full_fig_p020_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Median relative gaps of the heuristic across scenarios and rolling-horizon in [PITH_FULL_IMAGE:figures/full_fig_p029_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Runtime comparison between the exact optimization and the proposed heuristic. [PITH_FULL_IMAGE:figures/full_fig_p031_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: Runtime–quality trade-off of the heuristic for Objective 3. Each point represents [PITH_FULL_IMAGE:figures/full_fig_p034_7.png] view at source ↗
read the original abstract

Large-scale disaster response operations frequently involve spontaneous volunteers who arrive independently at disaster sites and must be coordinated under severe time pressure. Assigning such volunteers to relief activities constitutes a complex workforce assignment and scheduling problem with heterogeneous capabilities, dynamic arrivals, and operational constraints. Recent work formulated the spontaneous volunteer coordination problem (SVCP) as a lexicographic multi-objective mixed-integer optimization model. However, solving this model to optimality becomes computationally challenging in large-scale and rolling-horizon disaster response settings. This paper proposes a problem-specific constructive heuristic for the SVCP that explicitly leverages the lexicographic objective hierarchy, capability scarcity among volunteers, and workload balancing across activities. A large-scale computational study based on empirically grounded disaster response scenarios derived from the 2013 flood response in Halle (Germany) evaluates the proposed approach. Across 3200 simulated instances with up to 10000 volunteers and more than 4000 activity-time combinations, the heuristic closely approximates optimal solutions for the primary objectives while achieving a median runtime speedup of approximately 28x. Whereas the exact solver exceeds operational decision time limits in more than 60% of instances, the heuristic consistently produces solutions within minutes, enabling real-time decision support for spontaneous volunteer coordination.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The manuscript proposes a priority-driven constructive heuristic for the spontaneous volunteer coordination problem (SVCP), which is formulated as a lexicographic multi-objective mixed-integer program. The heuristic exploits the objective hierarchy, volunteer capability scarcity, and workload balancing across activities. A large-scale computational study on 3200 instances derived from 2013 Halle flood response data (scaling to 10,000 volunteers and over 4,000 activity-time combinations) reports that the heuristic closely approximates optimal solutions on primary objectives while delivering a median runtime speedup of approximately 28x over an exact solver; the heuristic always produces solutions within operational time limits, whereas the solver exceeds limits in more than 60% of instances.

Significance. If the approximation quality is robustly established, the work supplies a practical real-time decision-support tool for large-scale spontaneous volunteer assignment in disaster response, where exact MIP methods are intractable. The problem-specific heuristic design and use of empirically grounded scenarios from a real event are strengths that enhance relevance to humanitarian operations research.

major comments (2)
  1. [§5] §5 (Computational Study): The headline claim that the heuristic 'closely approximates optimal solutions for the primary objectives' across all 3200 instances (including those with 10,000 volunteers) is load-bearing for the paper's contribution. Because the exact solver times out in >60% of instances, the manuscript must explicitly define and justify how approximation quality (e.g., optimality gaps) is measured or bounded for unsolvable cases—via LP relaxations, extrapolation from smaller instances, or other proxies—and demonstrate that gap behavior scales uniformly rather than relying on an unstated assumption.
  2. [§4] §4 (Heuristic): The description of how the priority-driven construction respects the full lexicographic objective hierarchy and all operational constraints should be expanded with a formal argument or pseudocode step that guarantees no unintended violation of lower-priority objectives when primary objectives are approximated.
minor comments (2)
  1. The abstract would benefit from replacing the qualitative phrase 'closely approximates' with a quantitative summary (e.g., average or median gap percentages on primary objectives) to improve precision.
  2. Ensure all tables and figures in the computational results section include explicit captions, legends, and units so that speedup factors and approximation metrics are immediately interpretable without cross-referencing text.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive and detailed feedback. The comments highlight important aspects of clarity and rigor that we will address in the revision. We respond to each major comment below.

read point-by-point responses

  1. Referee: [§5] §5 (Computational Study): The headline claim that the heuristic 'closely approximates optimal solutions for the primary objectives' across all 3200 instances (including those with 10,000 volunteers) is load-bearing for the paper's contribution. Because the exact solver times out in >60% of instances, the manuscript must explicitly define and justify how approximation quality (e.g., optimality gaps) is measured or bounded for unsolvable cases—via LP relaxations, extrapolation from smaller instances, or other proxies—and demonstrate that gap behavior scales uniformly rather than relying on an unstated assumption.

    Authors: We agree that explicit justification is required for measuring approximation quality on instances where the MIP solver reaches the time limit without proving optimality. In the revised manuscript, we will expand §5 with a new subsection that defines the metrics as follows: for instances solved to optimality, we report the true optimality gap on primary objectives; for unsolved instances, we report the gap relative to the best feasible solution found by the solver at termination, supplemented by LP relaxation bounds where computable. We will also add an analysis (including supplementary figures) demonstrating consistent gap scaling by comparing behavior on the solvable subset and extrapolating trends to larger instances. This addresses the concern without altering the reported results. revision: yes

  2. Referee: [§4] §4 (Heuristic): The description of how the priority-driven construction respects the full lexicographic objective hierarchy and all operational constraints should be expanded with a formal argument or pseudocode step that guarantees no unintended violation of lower-priority objectives when primary objectives are approximated.

    Authors: We thank the referee for this suggestion. While §4 outlines the priority-driven logic, we acknowledge that a more rigorous guarantee would strengthen the presentation. In the revision, we will augment §4 with (i) detailed pseudocode of the construction procedure, highlighting the sequential priority queue and assignment steps, and (ii) a short formal argument (as a proposition) proving that the heuristic first optimizes the primary objectives to the extent possible under the capability and constraint sets before considering lower-priority terms, with no hard constraints violated at any step. This ensures the lexicographic structure is respected even when primary objectives are approximated. revision: yes

Circularity Check

0 steps flagged

No circularity: performance claims rest on external solver comparisons on independent instances

full rationale

The paper presents a constructive heuristic for the SVCP and evaluates it empirically against an external exact MIP solver on 3200 simulated instances generated from 2013 Halle flood data. No equations, parameters, or self-citations reduce the reported approximation ratios or speedups to fitted inputs or tautological definitions; the heuristic design leverages problem structure (lexicographic objectives, capability scarcity) but the quality metrics are measured directly against solver outputs where solvable and via proxies where not. This is a standard empirical validation setup with no load-bearing self-referential steps.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on the prior formulation of SVCP as a lexicographic multi-objective MIP and on the assumption that the 2013 Halle flood scenarios generate representative test instances; no free parameters or invented entities are introduced in the abstract.

axioms (1)
  • domain assumption The spontaneous volunteer coordination problem can be modeled as a lexicographic multi-objective mixed-integer optimization problem.
    Invoked as the starting point from recent prior work.

pith-pipeline@v0.9.0 · 5503 in / 1355 out tokens · 45584 ms · 2026-05-10T17:13:38.602352+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

4 extracted references · 4 canonical work pages

  1. [1]

    \@@@lbr \@tempdima\@@@rbr\@@@lbr\@@@pcr

    + is cited as + ESG96 +. In connection with cross-referencing and possible future hyperlinking it is not a good idea to collect more that one literature item in one + +. The so-called Harvard or author-year style of referencing is enabled by the package natbib . With this package the literature can be cited as follows: enumerate [ ] Parenthetical: + WB96 ...

    work page doi:10.1016/j.ijpe.2019.05.018 1996

  2. [2]

    write newline

    " write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 global.max substring 't := if while FUNCTION word.in bbl.in ":" * " " * FUNCTION f...

    work page

  3. [3]

    write newline

    " write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 global.max substring 't := if while FUNCTION word.in bbl.in ":" * " " * FUNCTION f...

    work page

  4. [4]

    write newline

    " write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 global.max substring 't := if while FUNCTION word.in bbl.in ":" * " " * FUNCTION f...

    work page