{"id":"870cb998-380f-469a-b66f-ce6ea0df1ccd","arxiv_id":"2607.01489","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":4.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":2,"one_line_summary":"Formulates multi-size parcel locker admission as an MDP, proves sufficient conditions for optimality of the always-accept policy, and gives algorithms for optimal locker assortment.","lead":"The paper models admission decisions for multi-size parcel lockers as a Markov decision process and identifies conditions where a simple always-accept policy performs optimally or near-optimally. A generalist might read it to see how optimization methods can reduce wasted capacity and rejected deliveries in shared logistics resources.","discovery_kind":"new_application","skeptic_critique":{"model":"grok-4.3","headline":"No significant objection identified","rationale":"Reader correctly isolates the core modeling assumption; within that model the theoretical and computational claims appear self-contained and directly supported by the exact solver and exhaustive checks on tractable instances. No additional load-bearing gap is apparent.","tokens_in":1740,"tokens_out":282,"duration_ms":21488,"concrete_test":"Extract the precise sufficient condition for AA optimality (likely a threshold comparison on the relative values or rejection-cost ratios) and substitute the numerical parameters from the two-, three-, and four-size experiment sections; verify whether the condition is satisfied exactly in the fast-pickup regimes and violated (yet gaps remain small) in the longer-holding-time regimes.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The modeling choice identified by the reader (finite-state MDP with state = occupancy vector by size class, linear rejection costs) is the standard reduction for nested-size admission control under Poisson arrivals and exponential holding times; the Markov property holds directly from memorylessness. The paper supplies both a sufficient condition for AA optimality (derived from the average-cost Bellman operator) and an exact bound-and-enumerate solver for the assortment problem, plus exhaustive enumeration on all tractable instances to certify local-search performance. No internal inconsistency, hidden assumption in the optimality-gap claims, or unsupported extrapolation from the reported experiments is visible.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.3","summary":"The paper formulates admission control for multi-size automated parcel lockers as a finite-state infinite-horizon average-cost MDP whose state is the occupancy vector by size class. It derives a sufficient condition for optimality of the always-accept (AA) policy from the average-cost Bellman operator, reports that AA is optimal or near-optimal (with negligible gaps) in two-, three-, and four-size numerical experiments under fast-pickup and longer holding-time regimes, and studies the locker-assortment problem of minimizing facility cost plus optimal expected rejection cost. An exact bound-and-enumerate algorithm is given for moderate instances; although the objective is not discrete convex, exchange-neighborhood local search recovers the certified optimum on all tractable instances.","tokens_in":1854,"tokens_out":433,"duration_ms":11134,"significance":"If the modeling and algorithmic claims hold, the work supplies both a practical policy (AA) with a verifiable optimality condition and certified solution methods for the joint admission-assortment design problem in parcel logistics. The exhaustive certification of local search on all solvable instances and the explicit sufficient condition for AA optimality are concrete strengths that support the reported performance claims.","major_comments":[],"minor_comments":[{"comment":"§3 (MDP formulation): clarify whether the linear rejection-cost assumption is without loss of generality or requires justification for the specific application; the current statement leaves the modeling choice implicit.","section":"§3"},{"comment":"Table 1–3 (numerical results): report the exact number of instances solved to optimality by bound-and-enumerate versus those solved only by local search, and state the largest instance size for which exact certification remains tractable.","section":"Tables 1-3"},{"comment":"§4.2 (assortment algorithm): the description of the bound-and-enumerate procedure would benefit from a short pseudocode block or explicit enumeration order to make the implementation reproducible.","section":"§4.2"}],"recommendation":"minor_revision","confidential_remarks":null},"author_rebuttal":{"model":"grok-4.3","summary":"We thank the referee for the positive summary, significance assessment, and recommendation of minor revision. No major comments were provided in the report, so we interpret the request as pertaining to minor improvements in presentation or clarity, which we will incorporate in the revised version.","responses":[],"tokens_in":1236,"tokens_out":70,"duration_ms":9641,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"This paper formulates admission control for automated parcel lockers where smaller items can use larger lockers but may block costlier larger ones later. It models the problem as a finite-state average-cost MDP with state given by occupancy counts per size class, solves small cases by relative value iteration, and supplies a sufficient condition (derived from the Bellman operator) under which the always-accept policy is optimal. Experiments across two-, three-, and four-size instances show the policy is optimal in fast-pickup regimes and nearly optimal otherwise, with negligible gaps. For the assortment design problem they give an exact bound-and-enumerate algorithm for moderate instances and demonstrate that exchange-neighborhood local search recovers the certified optimum in every case where exact verification is feasible.\n\nThe modeling choices are the usual ones for nested-size admission under Poisson arrivals and exponential holding times, so the Markov property holds directly. The sufficient condition is a modest but concrete incremental result, and the local-search certification is useful because it rests on exhaustive checks rather than unverified claims. The work stays within its scope and reports the limitations of the always-accept policy honestly.\n\nThe main soft spot is narrowness: everything depends on the memoryless assumptions, the experiments use synthetic parameters, and there are no broader theoretical advances or real-world data tests. This is standard applied operations research rather than a foundational contribution.\n\nIt is aimed at researchers working on logistics optimization or revenue-management style admission problems. The claims are grounded in the model and the algorithms are exact where asserted, so the paper deserves a serious referee to check the derivations and perhaps push for sensitivity analysis on the arrival and holding-time assumptions.","headline":"The paper applies standard MDP admission control to multi-size parcel lockers, derives a sufficient condition for always-accept optimality, and shows local search certifiably solves the assortment problem on tractable instances.","tokens_in":2337,"tokens_out":410,"would_cite":false,"duration_ms":18044,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.3","headline":"The always-accept policy is optimal or nearly optimal for admitting parcels into multi-size automated lockers.","keywords":["parcel lockers","admission control","assortment optimization","Markov decision process","always-accept policy","local search","capacity design"],"falsifier":"An instance in which the always-accept policy incurs a non-negligible optimality gap relative to the value function obtained by relative value iteration, or an assortment instance in which exchange-neighborhood local search returns a design whose cost exceeds the certified optimum.","tokens_in":2641,"feed_emoji":"📦","tokens_out":730,"duration_ms":17454,"temperature":0.7,"pith_summary":"The paper models admission decisions for parcels of varying sizes into compatible lockers as a Markov decision process that tracks occupancy by size class. It establishes that the simple always-accept policy, which takes any feasible parcel, is exactly optimal when parcels are picked up quickly and has only negligible gaps from optimality when holding times are longer. For the related problem of choosing how many lockers of each size to install, the work supplies an exact algorithm for moderate instances and demonstrates that a basic local-search heuristic recovers the optimal design in all cases where the optimum can be certified exactly. These results matter because they show that complex optimal policies can often be replaced by a rule that requires no computation at decision time while still controlling rejection costs effectively.","feed_headline":"Always-accept policy is optimal for fast-pickup parcel lockers","feed_subtitle":"It matches or nearly matches the optimal rejection cost and lets local search solve the locker-size mix problem exactly on moderate instance","key_machinery":"The finite-state infinite-horizon average-cost Markov decision process whose state is the vector of occupied lockers by size class; the always-accept policy that admits every feasible parcel; and the bound-and-enumerate algorithm together with exchange-neighborhood local search for the assortment design problem.","core_discovery":"The always-accept policy is optimal in fast-pickup regimes and nearly optimal when holding times are longer across two-, three-, and four-size experiments, with observed optimality gaps negligible even when it is not optimal. For the locker-assortment problem the objective is not discrete convex, yet an exchange-neighborhood local search finds the certified optimum in every instance for which exact certification is computationally tractable.","pith_inferences":["Real-time control systems for parcel lockers could be simplified to a stateless rule without material loss of performance.","The same always-accept logic may apply to other substitutable-capacity problems such as multi-size vehicle loading or hotel-room assignment.","Because the assortment objective is not discrete convex, similar non-convex design problems may also be solvable by neighborhood search rather than requiring specialized convex methods.","The approach could be tested on real locker occupancy traces to check whether the modeled Markovian assumptions hold under actual arrival and pickup patterns."],"forward_implications":["AA is optimal when pickup rates are high.","AA remains near-optimal when holding times increase.","Optimality gaps stay negligible across tested size counts.","Exchange-neighborhood local search recovers the exact optimum whenever certification is feasible.","The same local search scales as a heuristic to larger locker systems."],"fun_headline_variants":["Always-accept optimal for fast-pickup parcel lockers","AA nearly optimal with longer locker holding times","Local search certifies locker assortment optima","Always-accept enables exact solutions for locker assortment"],"cache_read_input_tokens":64,"weakest_assumption_plain":"The admission problem can be accurately captured by a finite-state infinite-horizon average-cost Markov decision process whose state tracks only the current occupancy by size class and whose costs are linear in rejections.","fun_headline_variants_meta":{"raw":{"variants":["Always-accept optimal for fast-pickup parcel lockers","AA nearly optimal with longer locker holding times","Local search certifies locker assortment optima","Always-accept enables exact solutions for locker assortment"]},"model":"grok-4.3","cost_usd":0.008222,"raw_usage":{"total_tokens":3717,"prompt_tokens":641,"num_sources_used":0,"completion_tokens":47,"cost_in_usd_ticks":82224500,"prompt_tokens_details":{"text_tokens":641,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":3029,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":641,"tokens_out":47,"duration_ms":24137,"temperature":1.0,"reasoning_tokens":3029,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-07-03T19:11:40.469352+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"An instance in which the always-accept policy incurs a non-negligible optimality gap relative to the value function obtained by relative value iteration, or an assortment instance in which exchange-neighborhood local search returns a design whose cost exceeds the certified optimum.","supporting_citations":[],"review_version":1}