{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:OEFYYED3KHIZCT4UIQFAFTRO7N","short_pith_number":"pith:OEFYYED3","schema_version":"1.0","canonical_sha256":"710b8c107b51d1914f94440a02ce2efb4674efcb49bebb32e13efcc855193f78","source":{"kind":"arxiv","id":"1612.01691","version":1},"attestation_state":"computed","paper":{"title":"Fleet Size and Mix Split-Delivery Vehicle Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Arthur Mah\\'eo, Philip Kilby, Tommaso Urli","submitted_at":"2016-12-06T07:46:41Z","abstract_excerpt":"In the classic Vehicle Routing Problem (VRP) a fleet of of vehicles has to visit a set of customers while minimising the operations' costs. We study a rich variant of the VRP featuring split deliveries, an heterogeneous fleet, and vehicle-commodity incompatibility constraints. Our goal is twofold: define the cheapest routing and the most adequate fleet.\n  To do so, we split the problem into two interdependent components: a fleet design component and a routing component. First, we define two Mixed Integer Programming (MIP) formulations for each component. Then we discuss several improvements in"},"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":"1612.01691","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-12-06T07:46:41Z","cross_cats_sorted":[],"title_canon_sha256":"f3de298d9fb9f29a7d33eb1c31f46385852e4ac8c649abca51d12fa5413f0f35","abstract_canon_sha256":"0d852a362af23b5a6069a14cf9c1045f1c62a302e09a0aa54c2a83ad4ce1da5c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:47.820706Z","signature_b64":"/+0ynfvK7YVPQSnjrhOlloJSz17hyS+9/XeFNDfsZYZRx3QkaSACsocyM5c6uTJOK/KXq+k5ekLG+IMsBU2yAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"710b8c107b51d1914f94440a02ce2efb4674efcb49bebb32e13efcc855193f78","last_reissued_at":"2026-05-18T00:55:47.820186Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:47.820186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fleet Size and Mix Split-Delivery Vehicle Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Arthur Mah\\'eo, Philip Kilby, Tommaso Urli","submitted_at":"2016-12-06T07:46:41Z","abstract_excerpt":"In the classic Vehicle Routing Problem (VRP) a fleet of of vehicles has to visit a set of customers while minimising the operations' costs. We study a rich variant of the VRP featuring split deliveries, an heterogeneous fleet, and vehicle-commodity incompatibility constraints. Our goal is twofold: define the cheapest routing and the most adequate fleet.\n  To do so, we split the problem into two interdependent components: a fleet design component and a routing component. First, we define two Mixed Integer Programming (MIP) formulations for each component. Then we discuss several improvements in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01691","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":""},"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":"1612.01691","created_at":"2026-05-18T00:55:47.820253+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.01691v1","created_at":"2026-05-18T00:55:47.820253+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01691","created_at":"2026-05-18T00:55:47.820253+00:00"},{"alias_kind":"pith_short_12","alias_value":"OEFYYED3KHIZ","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"OEFYYED3KHIZCT4U","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"OEFYYED3","created_at":"2026-05-18T12:30:36.002864+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/OEFYYED3KHIZCT4UIQFAFTRO7N","json":"https://pith.science/pith/OEFYYED3KHIZCT4UIQFAFTRO7N.json","graph_json":"https://pith.science/api/pith-number/OEFYYED3KHIZCT4UIQFAFTRO7N/graph.json","events_json":"https://pith.science/api/pith-number/OEFYYED3KHIZCT4UIQFAFTRO7N/events.json","paper":"https://pith.science/paper/OEFYYED3"},"agent_actions":{"view_html":"https://pith.science/pith/OEFYYED3KHIZCT4UIQFAFTRO7N","download_json":"https://pith.science/pith/OEFYYED3KHIZCT4UIQFAFTRO7N.json","view_paper":"https://pith.science/paper/OEFYYED3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.01691&json=true","fetch_graph":"https://pith.science/api/pith-number/OEFYYED3KHIZCT4UIQFAFTRO7N/graph.json","fetch_events":"https://pith.science/api/pith-number/OEFYYED3KHIZCT4UIQFAFTRO7N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OEFYYED3KHIZCT4UIQFAFTRO7N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OEFYYED3KHIZCT4UIQFAFTRO7N/action/storage_attestation","attest_author":"https://pith.science/pith/OEFYYED3KHIZCT4UIQFAFTRO7N/action/author_attestation","sign_citation":"https://pith.science/pith/OEFYYED3KHIZCT4UIQFAFTRO7N/action/citation_signature","submit_replication":"https://pith.science/pith/OEFYYED3KHIZCT4UIQFAFTRO7N/action/replication_record"}},"created_at":"2026-05-18T00:55:47.820253+00:00","updated_at":"2026-05-18T00:55:47.820253+00:00"}