{"paper":{"title":"Admission and Assortment Optimization for Multi-size Automated Parcel Lockers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Antoine Deza, Carlos An\\'ibal Su\\'arez, Tal Raviv","submitted_at":"2026-07-01T21:32:47Z","abstract_excerpt":"We study admission control and capacity design for automated parcel lockers with multiple parcel and locker sizes. A smaller parcel can use a larger locker, but doing so may block a future larger parcel whose rejection is more costly. We formulate the admission problem as a finite-state, infinite-horizon average-cost Markov decision process and solve small instances exactly by relative value iteration. We analyze the always-accept (AA) policy, which admits every feasible parcel into the remaining compatible capacity, and give a sufficient condition for its optimality. Across two-, three-, and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.01489","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.01489/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}