{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:SCCCHOKFBANTN4YU754QQS2VUB","short_pith_number":"pith:SCCCHOKF","schema_version":"1.0","canonical_sha256":"908423b945081b36f314ff79084b55a04bbfe6e27c4eafa01fa1b76c6f811ece","source":{"kind":"arxiv","id":"1803.06062","version":1},"attestation_state":"computed","paper":{"title":"Heuristics for vehicle routing problems: Sequence or set optimization?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"math.OC","authors_text":"Thibaut Vidal, Tony Wauters, T\\'ulio A. M. Toffolo","submitted_at":"2018-03-16T03:00:18Z","abstract_excerpt":"We investigate a structural decomposition for the capacitated vehicle routing problem (CVRP) based on vehicle-to-customer \"assignment\" and visits \"sequencing\" decision variables. We show that an heuristic search focused on assignment decisions with a systematic optimal choice of sequences (using Concorde TSP solver) during each move evaluation is promising but requires a prohibitive computational effort. We therefore introduce an intermediate search space, based on the dynamic programming procedure of Balas & Simonetti, which finds a good compromise between intensification and computational ef"},"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":"1803.06062","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-16T03:00:18Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"1e4a2cb7e3a4c3c10b4d2017b9ae930ae559e1fea556000aca4beb72a5b57cf9","abstract_canon_sha256":"8986aaa289bb0efe103d9da05431f78da1f4adb07b86844f316e71ceda83cdf2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:50.817781Z","signature_b64":"ZIeXEMUhEFuJCD2hIVaoZ8Q8gpzt0OIET/15VJjV5e+Yibf4Z8JYqI9Z7gVrHXB598zCjfNT/KNg+PkOHZKuDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"908423b945081b36f314ff79084b55a04bbfe6e27c4eafa01fa1b76c6f811ece","last_reissued_at":"2026-05-18T00:20:50.816996Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:50.816996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Heuristics for vehicle routing problems: Sequence or set optimization?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"math.OC","authors_text":"Thibaut Vidal, Tony Wauters, T\\'ulio A. M. Toffolo","submitted_at":"2018-03-16T03:00:18Z","abstract_excerpt":"We investigate a structural decomposition for the capacitated vehicle routing problem (CVRP) based on vehicle-to-customer \"assignment\" and visits \"sequencing\" decision variables. We show that an heuristic search focused on assignment decisions with a systematic optimal choice of sequences (using Concorde TSP solver) during each move evaluation is promising but requires a prohibitive computational effort. We therefore introduce an intermediate search space, based on the dynamic programming procedure of Balas & Simonetti, which finds a good compromise between intensification and computational ef"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06062","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":"1803.06062","created_at":"2026-05-18T00:20:50.817127+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.06062v1","created_at":"2026-05-18T00:20:50.817127+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06062","created_at":"2026-05-18T00:20:50.817127+00:00"},{"alias_kind":"pith_short_12","alias_value":"SCCCHOKFBANT","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"SCCCHOKFBANTN4YU","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"SCCCHOKF","created_at":"2026-05-18T12:32:50.500415+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/SCCCHOKFBANTN4YU754QQS2VUB","json":"https://pith.science/pith/SCCCHOKFBANTN4YU754QQS2VUB.json","graph_json":"https://pith.science/api/pith-number/SCCCHOKFBANTN4YU754QQS2VUB/graph.json","events_json":"https://pith.science/api/pith-number/SCCCHOKFBANTN4YU754QQS2VUB/events.json","paper":"https://pith.science/paper/SCCCHOKF"},"agent_actions":{"view_html":"https://pith.science/pith/SCCCHOKFBANTN4YU754QQS2VUB","download_json":"https://pith.science/pith/SCCCHOKFBANTN4YU754QQS2VUB.json","view_paper":"https://pith.science/paper/SCCCHOKF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.06062&json=true","fetch_graph":"https://pith.science/api/pith-number/SCCCHOKFBANTN4YU754QQS2VUB/graph.json","fetch_events":"https://pith.science/api/pith-number/SCCCHOKFBANTN4YU754QQS2VUB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SCCCHOKFBANTN4YU754QQS2VUB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SCCCHOKFBANTN4YU754QQS2VUB/action/storage_attestation","attest_author":"https://pith.science/pith/SCCCHOKFBANTN4YU754QQS2VUB/action/author_attestation","sign_citation":"https://pith.science/pith/SCCCHOKFBANTN4YU754QQS2VUB/action/citation_signature","submit_replication":"https://pith.science/pith/SCCCHOKFBANTN4YU754QQS2VUB/action/replication_record"}},"created_at":"2026-05-18T00:20:50.817127+00:00","updated_at":"2026-05-18T00:20:50.817127+00:00"}