{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MAEFJW4UOH5EMJSJEHK3ARQI77","short_pith_number":"pith:MAEFJW4U","schema_version":"1.0","canonical_sha256":"600854db9471fa46264921d5b04608ffcacd9ba7e1c5a7c3a20deb9d65393b6a","source":{"kind":"arxiv","id":"1806.08549","version":1},"attestation_state":"computed","paper":{"title":"New Exact Algorithm and Solution Properties for the Vehicle Routing Problem with Stochastic Demands","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexandre Florio, Richard Hartl, Stefan Minner","submitted_at":"2018-06-22T08:40:24Z","abstract_excerpt":"This paper considers the vehicle routing problem with stochastic demands (VRPSD) under optimal restocking. We develop an exact algorithm that is effective for solving instances with many vehicles and few customers per route. In our experiments, we show that in these instances solving the stochastic problem is most relevant (i.e., the potential gains over the deterministic equivalent solution are highest). The proposed branch-price-and-cut algorithm relies on an efficient labeling procedure, exact and heuristic dominance rules, and completion bounds to price profitable columns. Instances with u"},"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":"1806.08549","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-22T08:40:24Z","cross_cats_sorted":[],"title_canon_sha256":"51d44b743119d8bf82dc99ead6dade4ab52dfa20668d5ce44484bec664c7b957","abstract_canon_sha256":"dda100b0cf64439b6cec45c5a2a057549087c17ac48a3fb2ee8358481f9a1a76"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:36.862131Z","signature_b64":"m5Wa4vg0c1dfEDsn5jnC41md2hyA0in1SwY+MdNsMir+52w7aBPRifm7WrouIuhubkv6XVGhJnTBL4LSj30MCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"600854db9471fa46264921d5b04608ffcacd9ba7e1c5a7c3a20deb9d65393b6a","last_reissued_at":"2026-05-18T00:12:36.861366Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:36.861366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Exact Algorithm and Solution Properties for the Vehicle Routing Problem with Stochastic Demands","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexandre Florio, Richard Hartl, Stefan Minner","submitted_at":"2018-06-22T08:40:24Z","abstract_excerpt":"This paper considers the vehicle routing problem with stochastic demands (VRPSD) under optimal restocking. We develop an exact algorithm that is effective for solving instances with many vehicles and few customers per route. In our experiments, we show that in these instances solving the stochastic problem is most relevant (i.e., the potential gains over the deterministic equivalent solution are highest). The proposed branch-price-and-cut algorithm relies on an efficient labeling procedure, exact and heuristic dominance rules, and completion bounds to price profitable columns. Instances with u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08549","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":"1806.08549","created_at":"2026-05-18T00:12:36.861493+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.08549v1","created_at":"2026-05-18T00:12:36.861493+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08549","created_at":"2026-05-18T00:12:36.861493+00:00"},{"alias_kind":"pith_short_12","alias_value":"MAEFJW4UOH5E","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"MAEFJW4UOH5EMJSJ","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"MAEFJW4U","created_at":"2026-05-18T12:32:37.024351+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/MAEFJW4UOH5EMJSJEHK3ARQI77","json":"https://pith.science/pith/MAEFJW4UOH5EMJSJEHK3ARQI77.json","graph_json":"https://pith.science/api/pith-number/MAEFJW4UOH5EMJSJEHK3ARQI77/graph.json","events_json":"https://pith.science/api/pith-number/MAEFJW4UOH5EMJSJEHK3ARQI77/events.json","paper":"https://pith.science/paper/MAEFJW4U"},"agent_actions":{"view_html":"https://pith.science/pith/MAEFJW4UOH5EMJSJEHK3ARQI77","download_json":"https://pith.science/pith/MAEFJW4UOH5EMJSJEHK3ARQI77.json","view_paper":"https://pith.science/paper/MAEFJW4U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.08549&json=true","fetch_graph":"https://pith.science/api/pith-number/MAEFJW4UOH5EMJSJEHK3ARQI77/graph.json","fetch_events":"https://pith.science/api/pith-number/MAEFJW4UOH5EMJSJEHK3ARQI77/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MAEFJW4UOH5EMJSJEHK3ARQI77/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MAEFJW4UOH5EMJSJEHK3ARQI77/action/storage_attestation","attest_author":"https://pith.science/pith/MAEFJW4UOH5EMJSJEHK3ARQI77/action/author_attestation","sign_citation":"https://pith.science/pith/MAEFJW4UOH5EMJSJEHK3ARQI77/action/citation_signature","submit_replication":"https://pith.science/pith/MAEFJW4UOH5EMJSJEHK3ARQI77/action/replication_record"}},"created_at":"2026-05-18T00:12:36.861493+00:00","updated_at":"2026-05-18T00:12:36.861493+00:00"}