{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:A2SFQ4CWP3HFD5D72P6EAPGHK7","short_pith_number":"pith:A2SFQ4CW","schema_version":"1.0","canonical_sha256":"06a45870567ece51f47fd3fc403cc757f3f615d7d9c82c87c17bab08ee1f55eb","source":{"kind":"arxiv","id":"1803.01930","version":1},"attestation_state":"computed","paper":{"title":"A Hybrid Heuristic for a Broad Class of Vehicle Routing Problems with Heterogeneous Fleet","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anand Subramanian, Christian Prins, Luiz Satoru Ochi, Puca Huachi Vaz Penna, Thibaut Vidal","submitted_at":"2018-03-05T21:20:06Z","abstract_excerpt":"We consider a family of Rich Vehicle Routing Problems (RVRP) which have the particularity to combine a heterogeneous fleet with other attributes, such as backhauls, multiple depots, split deliveries, site dependency, open routes, duration limits, and time windows. To efficiently solve these problems, we propose a hybrid metaheuristic which combines an iterated local search with variable neighborhood descent, for solution improvement, and a set partitioning formulation, to exploit the memory of the past search. Moreover, we investigate a class of combined neighborhoods which jointly modify the "},"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.01930","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-05T21:20:06Z","cross_cats_sorted":[],"title_canon_sha256":"22ce9bd54bf2ab57738c73535f900e4008101f94ce33597afe85f567502a1d5d","abstract_canon_sha256":"87db953abc9056c2e9a68a714433ee31a0aa4c6c09939be63c37f31a883a3742"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:56.289291Z","signature_b64":"NHesLQe9iIWdU1qCI4jhGzE1GIP0mIG97zX3fDgxc1nS3EojnssKpeGVkfDkAIey2O5SyKflTOlA5mHQ5W7WBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06a45870567ece51f47fd3fc403cc757f3f615d7d9c82c87c17bab08ee1f55eb","last_reissued_at":"2026-05-18T00:21:56.288722Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:56.288722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Hybrid Heuristic for a Broad Class of Vehicle Routing Problems with Heterogeneous Fleet","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anand Subramanian, Christian Prins, Luiz Satoru Ochi, Puca Huachi Vaz Penna, Thibaut Vidal","submitted_at":"2018-03-05T21:20:06Z","abstract_excerpt":"We consider a family of Rich Vehicle Routing Problems (RVRP) which have the particularity to combine a heterogeneous fleet with other attributes, such as backhauls, multiple depots, split deliveries, site dependency, open routes, duration limits, and time windows. To efficiently solve these problems, we propose a hybrid metaheuristic which combines an iterated local search with variable neighborhood descent, for solution improvement, and a set partitioning formulation, to exploit the memory of the past search. Moreover, we investigate a class of combined neighborhoods which jointly modify the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.01930","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.01930","created_at":"2026-05-18T00:21:56.288799+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.01930v1","created_at":"2026-05-18T00:21:56.288799+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.01930","created_at":"2026-05-18T00:21:56.288799+00:00"},{"alias_kind":"pith_short_12","alias_value":"A2SFQ4CWP3HF","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"A2SFQ4CWP3HFD5D7","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"A2SFQ4CW","created_at":"2026-05-18T12:32:13.499390+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/A2SFQ4CWP3HFD5D72P6EAPGHK7","json":"https://pith.science/pith/A2SFQ4CWP3HFD5D72P6EAPGHK7.json","graph_json":"https://pith.science/api/pith-number/A2SFQ4CWP3HFD5D72P6EAPGHK7/graph.json","events_json":"https://pith.science/api/pith-number/A2SFQ4CWP3HFD5D72P6EAPGHK7/events.json","paper":"https://pith.science/paper/A2SFQ4CW"},"agent_actions":{"view_html":"https://pith.science/pith/A2SFQ4CWP3HFD5D72P6EAPGHK7","download_json":"https://pith.science/pith/A2SFQ4CWP3HFD5D72P6EAPGHK7.json","view_paper":"https://pith.science/paper/A2SFQ4CW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.01930&json=true","fetch_graph":"https://pith.science/api/pith-number/A2SFQ4CWP3HFD5D72P6EAPGHK7/graph.json","fetch_events":"https://pith.science/api/pith-number/A2SFQ4CWP3HFD5D72P6EAPGHK7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A2SFQ4CWP3HFD5D72P6EAPGHK7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A2SFQ4CWP3HFD5D72P6EAPGHK7/action/storage_attestation","attest_author":"https://pith.science/pith/A2SFQ4CWP3HFD5D72P6EAPGHK7/action/author_attestation","sign_citation":"https://pith.science/pith/A2SFQ4CWP3HFD5D72P6EAPGHK7/action/citation_signature","submit_replication":"https://pith.science/pith/A2SFQ4CWP3HFD5D72P6EAPGHK7/action/replication_record"}},"created_at":"2026-05-18T00:21:56.288799+00:00","updated_at":"2026-05-18T00:21:56.288799+00:00"}