{"id":"62e7df11-cd54-454d-9310-ddc2f7c0dd9f","arxiv_id":"2505.05717","paper_version":1,"verdict":"REJECT","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"high","formal_verification":"none","parameter_count":5,"one_line_summary":"A chance-constrained optimization model for recommending passenger arrival slots at airport security cuts simulated waiting time by 85% compared to no control, and by roughly 30% more than a deterministic full-compliance schedule, on one day of Barcelona flight data.","lead":"This paper uses chance-constrained optimization to assign airport passengers to recommended arrival time slots while accounting for the fact that not all passengers follow the advice. In a simulation based on one day at Barcelona airport, the robust schedule cuts simulated security waiting time by 85% versus no control and by about a third more than a deterministic schedule that assumes full compliance.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Algorithm 1's non-compliance term contradicts Eq. (8), so the simulated TTS values behind the 85% and 30% claims are not generated by the stated model.","rationale":"Good-faith reading: the paper's central claim is the quantitative TTS comparison in Section IV. That comparison is generated by Algorithm 1, so the algorithm's correctness is load-bearing. The pseudocode uses α̂ for the non-compliance contribution even though the model defines α as compliance and Eq. (8) uses (1−α). As printed, p_i has total mass about 2Σ x_it α̂_it rather than 1, so either an unshown normalization or a semantic correction is needed; neither is provided. This is not a stylistic issue: it changes the simulated arrival concentration at recommended slots and therefore the waiting-time differences that support the abstract. I therefore do not need to rely on the SOC reformulation error, though that error (Eqs. 17–18 contain dimensionally invalid `\\tilde D μ^T` expressions) would independently prevent accepting the reliability guarantee. The recommendation is to keep the reader's rejection: this version lacks support for the headline numerical claim, and the result could be reconsidered if the authors supply code and a corrected simulation whose numbers survive.","tokens_in":9570,"tokens_out":9479,"duration_ms":103665,"concrete_test":"Recompute the Section IV simulation exactly as Algorithm 1, but change the non-compliance update to `p_i[s] += x_it (1−α̂_it) β_is`, normalize p_i to sum to 1, and keep the same optimized recommendation patterns from the two policies. If the robust/deterministic TTS comparison does not reproduce the 8,161/6,009 split, or changes by more than a few percent, the headline claim fails. A quick invariant check on the printed pseudocode is that Σ_s p_i[s] must equal 1 for each flight; the printed version gives ≈2Σ_t x_it α̂_it instead.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Algorithm 1, the simulation that produces the headline TTS figures, does not implement Eq. (8). Eq. (8) says a passenger who ignores the recommendation to slot τ arrives according to the lead-time distribution with probability (1−α_iτ). Algorithm 1 instead computes, for each recommended slot t, `p_i[s] += x_it α̂_it β_is` for all s∈Q_i; it uses α̂ where Eq. (8) requires `1−α̂`, and the pseudocode never renormalizes p_i, so its total mass is about 2·Σ_t x_it α̂_it. With α=0.7, the sampled arrival distribution is roughly twice as concentrated on recommended slots as the stated model. The reported TTS values (8,161 and 6,009 passenger-hours, an 85% and 65% reduction) and the 30% robust-vs-deterministic comparison are computed from this process. Even if the ambiguous notation in Eq. (9) is resolved favorably, the numerical claim is unsupported because the simulation and model disagree; the absence of code means the mismatch cannot be checked ex post.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes a chance-constrained second-order cone program to assign passengers to recommended arrival time slots at airport security, explicitly modeling uncertain passenger non-compliance. The model is tested on a sample day of Barcelona airport flights, and the authors report an 85% reduction in total security waiting time relative to no control, and a 30% larger reduction than a deterministic full-compliance policy. A sensitivity analysis over the reliability factor and compliance parameters is also presented.","tokens_in":9814,"tokens_out":5949,"duration_ms":62425,"significance":"If the model were correctly formulated and the numerical results were reproducible, the paper would make a useful contribution to airport queue management by integrating compliance variability into an optimization framework. The use of a real flight schedule and the parametric sensitivity analysis are strengths. However, the chance-constraint reformulation contains a serious mathematical error, and the simulation algorithm used to generate the headline TTS figures is inconsistent with the stated model. In addition, the compliance parameters are assumed, not calibrated, so the paper's central numerical claims are not currently supported. The contribution therefore cannot be assessed until these issues are addressed.","major_comments":[{"comment":"The reformulation of the chance constraint is algebraically incorrect. For ξ_t ~ N(μ_t, Σ_t), the standardized quantity is (C_t - μ_t^T \\tilde{D} A_t x_t) / sqrt(x_t^T A_t^T \\tilde{D} Σ_t \\tilde{D} A_t x_t), which follows a standard normal distribution. The denominator in Eq. (17) and the norm in Eq. (18) should be the square root of the quadratic form, not the norm of the quadratic form itself. As written, the SOCP does not enforce the intended probability bound, so the reliability guarantee claimed for the robust policy is not established.","section":"Section III-C, Eqs. (17)-(18)"},{"comment":"The simulation of non-compliant passengers uses x_it \\hat{α}_it β_is, whereas Eq. (8) requires x_it (1−\\hat{α}_it) β_is. Since \\hat{α}_it ≈ 0.7 in the base case, the total probability mass assigned by the algorithm is approximately 2 Σ_t x_it \\hat{α}_it, which exceeds 1 and is not normalized. Consequently, the realized arrival distributions—and the reported TTS values of 8,161 and 6,009 passenger-hours (an 85% and 65% reduction)—are not generated by the model described in Eq. (8). This invalidates the paper's headline numerical claims.","section":"Section IV, Algorithm 1"},{"comment":"The compliance parameters μ_it and σ_it are set to arbitrary values (α=0.7, σ=0.2 in the base case) without calibration or a demonstrably realistic range. Because the TTS is computed from simulation and the optimization objective is passenger cost rather than waiting time, the reported 85% reduction is an empirical claim dependent on these assumed parameters. The paper does not show that the 30% improvement relative to the deterministic policy is robust to reasonable variations in compliance behavior, so this central comparison is not substantiated.","section":"Section IV and Figure 2"}],"minor_comments":[{"comment":"The summation index t is used both for the arrival slot and for the recommendation slot; using t′ for the recommendation slot would avoid ambiguity.","section":"Eq. (8)"},{"comment":"The term 'multinomial normal distribution' should be 'multivariate normal distribution'.","section":"Eq. (11)"},{"comment":"The expression \\tilde{D} ξ_t^T A_t x_t has a dimension mismatch; the matrix \\tilde{D} appears to be applied to the row vector ξ_t^T. It should presumably be ξ_t^T \\tilde{D} A_t x_t.","section":"Eq. (17)"},{"comment":"The right-hand side uses D instead of \\tilde{D}; this appears to be a typo.","section":"Eq. (20)"},{"comment":"The phrase '30% increase in the reduction' should be clarified as a relative increase (85% versus 65% reduction) to avoid confusion with a 30-percentage-point change.","section":"Section IV"},{"comment":"The pseudocode does not specify normalization of \\hat{p}_i; if the total mass is not 1, the sampling step is undefined.","section":"Algorithm 1"}],"recommendation":"major_revision","confidential_remarks":"The paper is an early-stage conference submission. The two technical errors—the chance-constraint reformulation and the Algorithm 1 inconsistency—are serious and invalidate the current numerical results. If the authors correct these errors, recalibrate or justify the compliance parameters, and rerun the experiments, the paper may be salvageable. In its current form, it should not be accepted as is."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Two things to know about arXiv:2505.05717. The operational question is real: can you cut airport security queue wait times by recommending passenger arrival slots, and does modeling compliance uncertainty help? The qualitative answer the paper gives—robust scheduling spreads passengers and reduces waiting time—is plausible. But the numbers behind that answer are not supported by the paper's own model. Algorithm 1, which produces the passenger arrivals used for the TTS calculations, computes the non-compliance contribution with α̂_it where Eq. (8) requires (1−α̂_it), and it never renormalizes the resulting mass. With α around 0.7, the simulated arrival distribution is roughly twice as concentrated on the recommended slots as the stated model. So the 85% and 30% TTS figures are generated by a process that contradicts Eq. (8). That's a load-bearing flaw.\n\nThe SOC reformulation in Eqs. (17)-(18) is also off. The denominator in the standardization should be the standard deviation of the linear form, sqrt(x^T A^T D Σ D A x); the paper writes the 2-norm of the quadratic form itself, which is just a scalar. The resulting inequality isn't a valid second-order cone. Since the reliability guarantee hinges on that step, this is more than a typo.\n\nWhat's genuinely useful: the paper frames a practical problem well, the lead-time distribution from the ACRP report is a reasonable input, and the sensitivity analysis (Fig. 4) gives some intuition for how γ, μ, and σ shift the recommendation pattern. Modeling compliance as random per flight and slot is a legitimate extension of the standard deterministic assignment.\n\nThe soft spots beyond the math: compliance means and standard deviations are assumed, not estimated or calibrated; there's no code or data, and the single sample day at BCN comes without error bars. The assumption that non-compliant passengers still arrive according to the ACRP lead-time distribution independent of the recommendation is strong; a recommendation might shift behavior even among those who don't follow it. The headline TTS is a simulation output under those assumed parameters, so the 85% and 30% are conditional on them.\n\nWho's this for? Airport operations researchers who want to see the modeling approach. It reads like an early symposium draft. I'd send it to peer review rather than desk-reject, because the idea is salvageable and a referee could force the authors to fix the simulation, correct the SOC, and supply code and data. But the current version's quantitative claims should not be taken at face value.","headline":"Plausible operational idea let down by a simulation that contradicts its own equation and a chance-constraint reformulation missing a square root—the headline TTS numbers should not be trusted as written.","tokens_in":10329,"tokens_out":7549,"would_cite":false,"duration_ms":77289,"reading_group":"maybe","serious_thinker":"no","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"A chance-constrained arrival-slot policy cuts airport security waiting time by 85 percent versus no control, and its reduction is 30 percent larger than a full-compliance policy's.","keywords":["airport security queues","chance-constrained optimization","passenger non-compliance","arrival time slot recommendation","second-order cone program","total time savings","Barcelona-El Prat airport","queuing model"],"falsifier":"Compare Algorithm 1's simulated arrival curve for the Barcelona sample day with observed security-checkpoint arrival times on that day: if the realized distribution of non-compliant passengers departs materially from the 2013 lead-time distribution, or if measured total waiting time reduction does not approach 85 percent, the central claim fails. A less costly check is to re-estimate the lead-time distribution from Barcelona checkpoint data and rerun the same optimization and simulation.","tokens_in":9343,"feed_emoji":"🛂","tokens_out":8718,"duration_ms":88119,"temperature":0.7,"pith_summary":"The paper proposes to manage airport security queues by recommending each passenger an arrival time slot, and argues that the recommendation should be computed under uncertainty about whether passengers will follow it. It formulates the assignment as a chance-constrained optimization problem: with probability at least $1-\\gamma$, the number of passengers arriving in each 15-minute slot must stay below the security checkpoint's capacity. On a sample day of 260 departing flights and 49,034 seats at Barcelona-El Prat Terminal 1, the resulting policy cuts total security waiting time by about 85 percent relative to no control, while a deterministic policy that assumes full compliance cuts it by 65 percent. The paper takes the gap as evidence that ignoring compliance variability understates the value of arrival-slot scheduling.","feed_headline":"Accounting for non-compliance in arrival slots cuts security waits 85%","feed_subtitle":"A Barcelona sample day shows an 85% waiting-time cut, 30% more than a full-compliance plan.","key_machinery":"The load-bearing object is a second-order cone program with chance constraints. For each flight $i$ and time slot $t$, the decision variable $x_{it}$ is the fraction of the flight's passengers recommended to arrive in slot $t$, and a random compliance rate $\\alpha_{it} \\sim N(\\mu_{it}, \\sigma_{it})$ determines how many actually follow the recommendation. Passengers who do not comply are assumed to arrive according to a fixed lead-time distribution from a 2013 airport operations study. The realized number of passengers arriving in each slot is written through matrices that aggregate compliant and non-compliant arrivals, and the capacity constraint is imposed as $P(\\text{arrivals} \\le C_t) \\ge 1-\\gamma$, which is reformulated into a second-order cone inequality. A simulation algorithm samples compliance rates, generates realized arrival times, and computes total time savings in passenger-hours from the resulting queuing curves.","core_discovery":"The central claim is that a chance-constrained reformulation of arrival-slot assignment yields a security queue policy that beats both first-come-first-served queuing and deterministic full-compliance scheduling. On the Barcelona sample day, the chance-constrained policy produces 8,161 passenger-hours of total time savings, an 85 percent decrease in total waiting time, compared with 6,009 passenger-hours and a 65 percent decrease for the deterministic policy. The chance-constrained solution spreads passengers from the same flight across several neighboring slots, especially during morning and midday peaks, while the deterministic solution assigns most flights a single slot. The paper also reports that, in the no-control baseline, some passengers miss their flights, whereas neither optimized policy causes missed flights. It identifies the mechanism as the spreading of arrivals induced by modeling compliance variance: queues do not build up even though the objective, which penalizes deviation from passengers' preferred arrival time, is higher than in the deterministic case.","pith_inferences":["An editorial extension: the simulation treats non-compliant passengers as arriving exactly according to the fixed lead-time distribution, as if the recommendation had not been made; a more realistic model would let the recommendation itself shift non-compliant arrivals, and that could change the 85 percent figure.","Another extension: the 85 percent figure measures security-queue waiting only; a complete welfare comparison would subtract the added airport time passengers spend because recommendations move them earlier, which the objective already penalizes but the headline metric does not.","The assumption of one passenger per seat (100 percent load factor) means real flights with empty seats and no-shows would produce lower realized arrivals, so the policy's safety margins could perhaps be relaxed.","The same chance-constrained assignment logic could be transferred to other appointment systems with uncertain adherence, such as baggage drop, border control, or vaccination queues."],"forward_implications":["If an airport adopted the chance-constrained arrival-slot policy, security waiting time on a day shaped like the Barcelona sample would drop by about 85 percent, and no passengers would miss flights in the simulation.","The 30-percent-larger reduction over deterministic full-compliance scheduling implies that planning as though passengers will follow recommendations leaves real queue reductions on the table.","The policy spreads each flight's passengers over neighboring slots in peak periods, which keeps slot arrivals under capacity without forcing everyone to arrive much earlier.","Sensitivity analysis shows the reliability factor $\\gamma$, the mean compliance rate, and the compliance standard deviation can be tuned: stricter robustness or higher variance pushes recommendations earlier, while higher compliance reduces the need for early arrival.","The same chance-constrained model can be rerun with re-estimated compliance parameters to adapt recommendations over time."],"supporting_citations":[{"why":"Supplies the skew-normal lead-time distribution (mean 64 minutes, standard deviation 30, skewness 3) used to generate no-control arrivals and the arrivals of non-compliant passengers.","marker":"[9]"},{"why":"Provides the queuing-theory foundation for the FCFS security-checkpoint model from which arrival and departure curves and total time savings are computed.","marker":"[5]"},{"why":"Supplies the chance-constrained optimization formulation for transportation under uncertainty that the paper adapts to passenger arrival-slot assignment.","marker":"[7]"},{"why":"Provides the second-order cone reformulation of chance constraints that makes the capacity-violation probability computationally tractable.","marker":"[20]"},{"why":"Establishes the virtual-queuing precedent that managing arrival rates can reduce security waiting time, motivating the arrival-slot control approach.","marker":"[10]"}],"fun_headline_variants":["Chance-constrained arrival slots cut security waits 85%","Modeling passenger non-compliance cuts airport security waits 85%","Chance constraints increase wait reduction from 65% to 85% at airport security","Spreading arrivals via chance constraints cuts security waits 85%","Non-compliance-aware scheduling reduces airport security waits by 85%"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The model assumes that passengers who ignore a recommended arrival slot arrive exactly according to a fixed 2013 lead-time distribution, independent of what they were told; if receiving a recommendation changes their timing, or if Barcelona passengers in 2023 have a different lead-time pattern, the simulated arrival curves and the 85 percent savings would change materially.","fun_headline_variants_meta":{"raw":{"variants":["Chance-constrained arrival slots cut security waits 85%","Modeling passenger non-compliance cuts airport security waits 85%","Chance constraints increase wait reduction from 65% to 85% at airport security","Spreading arrivals via chance constraints cuts security waits 85%","Non-compliance-aware scheduling reduces airport security waits by 85%"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001429,"raw_usage":{"total_tokens":5765,"prompt_tokens":944,"completion_tokens":4821,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":560,"completion_tokens_details":{"reasoning_tokens":4730}},"tokens_in":560,"tokens_out":4821,"duration_ms":36062,"temperature":1.0,"reasoning_tokens":4730,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-15T22:59:10.043636+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Compare Algorithm 1's simulated arrival curve for the Barcelona sample day with observed security-checkpoint arrival times on that day: if the realized distribution of non-compliant passengers departs materially from the 2013 lead-time distribution, or if measured total waiting time reduction does not approach 85 percent, the central claim fails. A less costly check is to re-estimate the lead-time distribution from Barcelona checkpoint data and rerun the same optimization and simulation.","supporting_citations":[{"cited_title":"Patrick, H","cited_arxiv_id":null,"evidence_quote":"Supplies the skew-normal lead-time distribution (mean 64 minutes, standard deviation 30, skewness 3) used to generate no-control arrivals and the arrivals of non-compliant passengers."},{"cited_title":"Ronald, ”An application of queuing theory to airport pas- senger security”, Interfaces, vol","cited_arxiv_id":null,"evidence_quote":"Provides the queuing-theory foundation for the FCFS security-checkpoint model from which arrival and departure curves and total time savings are computed."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the chance-constrained optimization formulation for transportation under uncertainty that the paper adapts to passenger arrival-slot assignment."},{"cited_title":"Ruiting, K","cited_arxiv_id":null,"evidence_quote":"Provides the second-order cone reformulation of chance constraints that makes the capacity-violation probability computationally tractable."},{"cited_title":"Robert, S","cited_arxiv_id":null,"evidence_quote":"Establishes the virtual-queuing precedent that managing arrival rates can reduce security waiting time, motivating the arrival-slot control approach."}],"review_version":1}