{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:EF7LZZIUCLHW43R3JYD6C5QILK","short_pith_number":"pith:EF7LZZIU","schema_version":"1.0","canonical_sha256":"217ebce51412cf6e6e3b4e07e176085a8eb1e3623c579c49d13b121a6ae76da5","source":{"kind":"arxiv","id":"1706.03097","version":1},"attestation_state":"computed","paper":{"title":"The Vehicle Routing Problem with Service Level Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Minh Ho\\`ang H\\`a, Rafael Martinelli, Teobaldo Bulh\\~oes, Thibaut Vidal","submitted_at":"2017-06-09T19:17:45Z","abstract_excerpt":"We consider a vehicle routing problem which seeks to minimize cost subject to service level constraints on several groups of deliveries. This problem captures some essential challenges faced by a logistics provider which operates transportation services for a limited number of partners and should respect contractual obligations on service levels. The problem also generalizes several important classes of vehicle routing problems with profits. To solve it, we propose a compact mathematical formulation, a branch-and-price algorithm, and a hybrid genetic algorithm with population management, which"},"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":"1706.03097","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-09T19:17:45Z","cross_cats_sorted":[],"title_canon_sha256":"288dc652d8131b907f73062f6fa3c206e53a640452fcd962c4b0e400c376bdf3","abstract_canon_sha256":"61118047a9da53252483b0d04933c080cfc6ef53ae33a353e767020ade54a7ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:38.499032Z","signature_b64":"aHbjSZskG9M6Wxdhbm7n7FRRW0aGvi+dE2JUxy5MyJaLqzmJkWdFvie4Q+8MgfuvfIfC8ZUXGN4Bge1Gdjg2AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"217ebce51412cf6e6e3b4e07e176085a8eb1e3623c579c49d13b121a6ae76da5","last_reissued_at":"2026-05-18T00:42:38.498507Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:38.498507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Vehicle Routing Problem with Service Level Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Minh Ho\\`ang H\\`a, Rafael Martinelli, Teobaldo Bulh\\~oes, Thibaut Vidal","submitted_at":"2017-06-09T19:17:45Z","abstract_excerpt":"We consider a vehicle routing problem which seeks to minimize cost subject to service level constraints on several groups of deliveries. This problem captures some essential challenges faced by a logistics provider which operates transportation services for a limited number of partners and should respect contractual obligations on service levels. The problem also generalizes several important classes of vehicle routing problems with profits. To solve it, we propose a compact mathematical formulation, a branch-and-price algorithm, and a hybrid genetic algorithm with population management, which"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03097","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":"1706.03097","created_at":"2026-05-18T00:42:38.498596+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.03097v1","created_at":"2026-05-18T00:42:38.498596+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03097","created_at":"2026-05-18T00:42:38.498596+00:00"},{"alias_kind":"pith_short_12","alias_value":"EF7LZZIUCLHW","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"EF7LZZIUCLHW43R3","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"EF7LZZIU","created_at":"2026-05-18T12:31:12.930513+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/EF7LZZIUCLHW43R3JYD6C5QILK","json":"https://pith.science/pith/EF7LZZIUCLHW43R3JYD6C5QILK.json","graph_json":"https://pith.science/api/pith-number/EF7LZZIUCLHW43R3JYD6C5QILK/graph.json","events_json":"https://pith.science/api/pith-number/EF7LZZIUCLHW43R3JYD6C5QILK/events.json","paper":"https://pith.science/paper/EF7LZZIU"},"agent_actions":{"view_html":"https://pith.science/pith/EF7LZZIUCLHW43R3JYD6C5QILK","download_json":"https://pith.science/pith/EF7LZZIUCLHW43R3JYD6C5QILK.json","view_paper":"https://pith.science/paper/EF7LZZIU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.03097&json=true","fetch_graph":"https://pith.science/api/pith-number/EF7LZZIUCLHW43R3JYD6C5QILK/graph.json","fetch_events":"https://pith.science/api/pith-number/EF7LZZIUCLHW43R3JYD6C5QILK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EF7LZZIUCLHW43R3JYD6C5QILK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EF7LZZIUCLHW43R3JYD6C5QILK/action/storage_attestation","attest_author":"https://pith.science/pith/EF7LZZIUCLHW43R3JYD6C5QILK/action/author_attestation","sign_citation":"https://pith.science/pith/EF7LZZIUCLHW43R3JYD6C5QILK/action/citation_signature","submit_replication":"https://pith.science/pith/EF7LZZIUCLHW43R3JYD6C5QILK/action/replication_record"}},"created_at":"2026-05-18T00:42:38.498596+00:00","updated_at":"2026-05-18T00:42:38.498596+00:00"}