{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BDYLTHFUZGQXZ6OT6IRIUZLDQM","short_pith_number":"pith:BDYLTHFU","schema_version":"1.0","canonical_sha256":"08f0b99cb4c9a17cf9d3f2228a65638315416f75373611d94a2e2bd0e9bc853a","source":{"kind":"arxiv","id":"1912.13157","version":1},"attestation_state":"computed","paper":{"title":"C. H. Robinson Uses Heuristics to Solve Rich Vehicle Routing Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.AI","authors_text":"Cody Wanless, Ehsan Khodabandeh, John Dennis, Joshua Hammond, Lawrence V. Snyder","submitted_at":"2019-12-31T03:24:46Z","abstract_excerpt":"We consider a wide family of vehicle routing problem variants with many complex and practical constraints, known as rich vehicle routing problems, which are faced on a daily basis by C.H. Robinson (CHR). Since CHR has many customers, each with distinct requirements, various routing problems with different objectives and constraints should be solved. We propose a set partitioning framework with a number of route generation algorithms, which have shown to be effective in solving a variety of different problems. The proposed algorithms have outperformed the existing technologies at CHR on 10 benc"},"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":"1912.13157","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-12-31T03:24:46Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"776356770ad9697f1e918de27c1908b65735647a21ff70eb9cecb1155a55de3f","abstract_canon_sha256":"24dcc2cd14ce7d165baae12e78e24be6739b5efd8ca869fee04baa8abb0b0774"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:29:06.543063Z","signature_b64":"WNc49qk1lPTAeljT5qlgvr0K3KAtpbA4r8hLr7eBxqDAU4qp05hjAJWDtvemhCiEerGNoDdjsbPf/ThrRsxEDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08f0b99cb4c9a17cf9d3f2228a65638315416f75373611d94a2e2bd0e9bc853a","last_reissued_at":"2026-07-05T00:29:06.542550Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:29:06.542550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"C. H. Robinson Uses Heuristics to Solve Rich Vehicle Routing Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.AI","authors_text":"Cody Wanless, Ehsan Khodabandeh, John Dennis, Joshua Hammond, Lawrence V. Snyder","submitted_at":"2019-12-31T03:24:46Z","abstract_excerpt":"We consider a wide family of vehicle routing problem variants with many complex and practical constraints, known as rich vehicle routing problems, which are faced on a daily basis by C.H. Robinson (CHR). Since CHR has many customers, each with distinct requirements, various routing problems with different objectives and constraints should be solved. We propose a set partitioning framework with a number of route generation algorithms, which have shown to be effective in solving a variety of different problems. The proposed algorithms have outperformed the existing technologies at CHR on 10 benc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.13157","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/1912.13157/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":"1912.13157","created_at":"2026-07-05T00:29:06.542632+00:00"},{"alias_kind":"arxiv_version","alias_value":"1912.13157v1","created_at":"2026-07-05T00:29:06.542632+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.13157","created_at":"2026-07-05T00:29:06.542632+00:00"},{"alias_kind":"pith_short_12","alias_value":"BDYLTHFUZGQX","created_at":"2026-07-05T00:29:06.542632+00:00"},{"alias_kind":"pith_short_16","alias_value":"BDYLTHFUZGQXZ6OT","created_at":"2026-07-05T00:29:06.542632+00:00"},{"alias_kind":"pith_short_8","alias_value":"BDYLTHFU","created_at":"2026-07-05T00:29:06.542632+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/BDYLTHFUZGQXZ6OT6IRIUZLDQM","json":"https://pith.science/pith/BDYLTHFUZGQXZ6OT6IRIUZLDQM.json","graph_json":"https://pith.science/api/pith-number/BDYLTHFUZGQXZ6OT6IRIUZLDQM/graph.json","events_json":"https://pith.science/api/pith-number/BDYLTHFUZGQXZ6OT6IRIUZLDQM/events.json","paper":"https://pith.science/paper/BDYLTHFU"},"agent_actions":{"view_html":"https://pith.science/pith/BDYLTHFUZGQXZ6OT6IRIUZLDQM","download_json":"https://pith.science/pith/BDYLTHFUZGQXZ6OT6IRIUZLDQM.json","view_paper":"https://pith.science/paper/BDYLTHFU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1912.13157&json=true","fetch_graph":"https://pith.science/api/pith-number/BDYLTHFUZGQXZ6OT6IRIUZLDQM/graph.json","fetch_events":"https://pith.science/api/pith-number/BDYLTHFUZGQXZ6OT6IRIUZLDQM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BDYLTHFUZGQXZ6OT6IRIUZLDQM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BDYLTHFUZGQXZ6OT6IRIUZLDQM/action/storage_attestation","attest_author":"https://pith.science/pith/BDYLTHFUZGQXZ6OT6IRIUZLDQM/action/author_attestation","sign_citation":"https://pith.science/pith/BDYLTHFUZGQXZ6OT6IRIUZLDQM/action/citation_signature","submit_replication":"https://pith.science/pith/BDYLTHFUZGQXZ6OT6IRIUZLDQM/action/replication_record"}},"created_at":"2026-07-05T00:29:06.542632+00:00","updated_at":"2026-07-05T00:29:06.542632+00:00"}