{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:JU7KIMSRSUK4WPK2IHEIIKWYDJ","short_pith_number":"pith:JU7KIMSR","schema_version":"1.0","canonical_sha256":"4d3ea432519515cb3d5a41c8842ad81a7bf518ed57528d815c01a7e1abceab66","source":{"kind":"arxiv","id":"2509.06157","version":1},"attestation_state":"computed","paper":{"title":"Box Allocation Optimization in Meal Kit Delivery","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alain Zemkoho, Loic Genest, Thi Minh Thu Nguyen","submitted_at":"2025-09-07T17:57:17Z","abstract_excerpt":"This study introduces the Box Allocation Problem (BAP), a novel optimization challenge in the $1.4 billion UK meal kit delivery market. BAP involves assigning orders across multiple production facilities to minimize daily recipe variations while adhering to capacity and eligibility constraints over a 15-day planning horizon. We formulate BAP as a mixed-integer linear programming (MILP) problem and systematically compare the performance of the COIN-OR Branch and Cut (CBC) solver with heuristic methods, including Tabu Search and Iterative Targeted Pairwise Swap. Scalability experiment on instanc"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2509.06157","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-09-07T17:57:17Z","cross_cats_sorted":[],"title_canon_sha256":"1d36d84ba54e0760f8d2a537635bef48df56733d479ed3b02d3d9902ad95a76b","abstract_canon_sha256":"8f5be7dd7751864a711c693cbfe693a111aa2765fcb6ad4ca18a457d3e82ed26"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:06:30.756528Z","signature_b64":"CzVWKEhaX4JOnY3ZK9OFGMKOeHWzN1Qj8MI1WdidXqpQP/Itq6aDmprXFXjQYkR/yWOfMP11mDfUHQVfRrunBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d3ea432519515cb3d5a41c8842ad81a7bf518ed57528d815c01a7e1abceab66","last_reissued_at":"2026-07-05T12:06:30.756118Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:06:30.756118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Box Allocation Optimization in Meal Kit Delivery","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alain Zemkoho, Loic Genest, Thi Minh Thu Nguyen","submitted_at":"2025-09-07T17:57:17Z","abstract_excerpt":"This study introduces the Box Allocation Problem (BAP), a novel optimization challenge in the $1.4 billion UK meal kit delivery market. BAP involves assigning orders across multiple production facilities to minimize daily recipe variations while adhering to capacity and eligibility constraints over a 15-day planning horizon. We formulate BAP as a mixed-integer linear programming (MILP) problem and systematically compare the performance of the COIN-OR Branch and Cut (CBC) solver with heuristic methods, including Tabu Search and Iterative Targeted Pairwise Swap. Scalability experiment on instanc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.06157","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/2509.06157/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2509.06157","created_at":"2026-07-05T12:06:30.756171+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.06157v1","created_at":"2026-07-05T12:06:30.756171+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.06157","created_at":"2026-07-05T12:06:30.756171+00:00"},{"alias_kind":"pith_short_12","alias_value":"JU7KIMSRSUK4","created_at":"2026-07-05T12:06:30.756171+00:00"},{"alias_kind":"pith_short_16","alias_value":"JU7KIMSRSUK4WPK2","created_at":"2026-07-05T12:06:30.756171+00:00"},{"alias_kind":"pith_short_8","alias_value":"JU7KIMSR","created_at":"2026-07-05T12:06:30.756171+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JU7KIMSRSUK4WPK2IHEIIKWYDJ","json":"https://pith.science/pith/JU7KIMSRSUK4WPK2IHEIIKWYDJ.json","graph_json":"https://pith.science/api/pith-number/JU7KIMSRSUK4WPK2IHEIIKWYDJ/graph.json","events_json":"https://pith.science/api/pith-number/JU7KIMSRSUK4WPK2IHEIIKWYDJ/events.json","paper":"https://pith.science/paper/JU7KIMSR"},"agent_actions":{"view_html":"https://pith.science/pith/JU7KIMSRSUK4WPK2IHEIIKWYDJ","download_json":"https://pith.science/pith/JU7KIMSRSUK4WPK2IHEIIKWYDJ.json","view_paper":"https://pith.science/paper/JU7KIMSR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.06157&json=true","fetch_graph":"https://pith.science/api/pith-number/JU7KIMSRSUK4WPK2IHEIIKWYDJ/graph.json","fetch_events":"https://pith.science/api/pith-number/JU7KIMSRSUK4WPK2IHEIIKWYDJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JU7KIMSRSUK4WPK2IHEIIKWYDJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JU7KIMSRSUK4WPK2IHEIIKWYDJ/action/storage_attestation","attest_author":"https://pith.science/pith/JU7KIMSRSUK4WPK2IHEIIKWYDJ/action/author_attestation","sign_citation":"https://pith.science/pith/JU7KIMSRSUK4WPK2IHEIIKWYDJ/action/citation_signature","submit_replication":"https://pith.science/pith/JU7KIMSRSUK4WPK2IHEIIKWYDJ/action/replication_record"}},"created_at":"2026-07-05T12:06:30.756171+00:00","updated_at":"2026-07-05T12:06:30.756171+00:00"}