{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:S5VUT3A3RLVG6OOWAEZJYUMQKB","short_pith_number":"pith:S5VUT3A3","schema_version":"1.0","canonical_sha256":"976b49ec1b8aea6f39d601329c519050492c9951e63b9ef215f53d81e9d0ad39","source":{"kind":"arxiv","id":"1505.08003","version":2},"attestation_state":"computed","paper":{"title":"A large neighbourhood based heuristic for two-echelon routing problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Richard F. Hartl, Thibaut Vidal, Ulrich Breunig, Verena Schmid","submitted_at":"2015-05-29T11:53:20Z","abstract_excerpt":"In this paper, we address two optimisation problems arising in the context of city logistics and two-level transportation systems. The two-echelon vehicle routing problem and the two-echelon location routing problem seek to produce vehicle itineraries to deliver goods to customers, with transits through intermediate facilities. To efficiently solve these problems, we propose a hybrid metaheuristic which combines enumerative local searches with destroy-and-repair principles, as well as some tailored operators to optimise the selections of intermediate facilities. We conduct extensive computatio"},"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":"1505.08003","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-29T11:53:20Z","cross_cats_sorted":[],"title_canon_sha256":"c114344c3be7483656c08583d75fe7dce383cb497429633c34e4e01358994a36","abstract_canon_sha256":"1d81ea4f63a2ff84a1bd5bf7429656a1865d374459a7b0fc15ae8391edb00e83"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:20.464918Z","signature_b64":"nS2W9spxRmhMFi2Rq9LQQ8PujmFj0fCRqn0TBzL+7FzQ+AYoMQmorRotQo3fkjcpvxyY5eU0iEQitxg6e3JJCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"976b49ec1b8aea6f39d601329c519050492c9951e63b9ef215f53d81e9d0ad39","last_reissued_at":"2026-05-18T01:03:20.464280Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:20.464280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A large neighbourhood based heuristic for two-echelon routing problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Richard F. Hartl, Thibaut Vidal, Ulrich Breunig, Verena Schmid","submitted_at":"2015-05-29T11:53:20Z","abstract_excerpt":"In this paper, we address two optimisation problems arising in the context of city logistics and two-level transportation systems. The two-echelon vehicle routing problem and the two-echelon location routing problem seek to produce vehicle itineraries to deliver goods to customers, with transits through intermediate facilities. To efficiently solve these problems, we propose a hybrid metaheuristic which combines enumerative local searches with destroy-and-repair principles, as well as some tailored operators to optimise the selections of intermediate facilities. We conduct extensive computatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.08003","kind":"arxiv","version":2},"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":"1505.08003","created_at":"2026-05-18T01:03:20.464416+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.08003v2","created_at":"2026-05-18T01:03:20.464416+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.08003","created_at":"2026-05-18T01:03:20.464416+00:00"},{"alias_kind":"pith_short_12","alias_value":"S5VUT3A3RLVG","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"S5VUT3A3RLVG6OOW","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"S5VUT3A3","created_at":"2026-05-18T12:29:39.896362+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/S5VUT3A3RLVG6OOWAEZJYUMQKB","json":"https://pith.science/pith/S5VUT3A3RLVG6OOWAEZJYUMQKB.json","graph_json":"https://pith.science/api/pith-number/S5VUT3A3RLVG6OOWAEZJYUMQKB/graph.json","events_json":"https://pith.science/api/pith-number/S5VUT3A3RLVG6OOWAEZJYUMQKB/events.json","paper":"https://pith.science/paper/S5VUT3A3"},"agent_actions":{"view_html":"https://pith.science/pith/S5VUT3A3RLVG6OOWAEZJYUMQKB","download_json":"https://pith.science/pith/S5VUT3A3RLVG6OOWAEZJYUMQKB.json","view_paper":"https://pith.science/paper/S5VUT3A3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.08003&json=true","fetch_graph":"https://pith.science/api/pith-number/S5VUT3A3RLVG6OOWAEZJYUMQKB/graph.json","fetch_events":"https://pith.science/api/pith-number/S5VUT3A3RLVG6OOWAEZJYUMQKB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S5VUT3A3RLVG6OOWAEZJYUMQKB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S5VUT3A3RLVG6OOWAEZJYUMQKB/action/storage_attestation","attest_author":"https://pith.science/pith/S5VUT3A3RLVG6OOWAEZJYUMQKB/action/author_attestation","sign_citation":"https://pith.science/pith/S5VUT3A3RLVG6OOWAEZJYUMQKB/action/citation_signature","submit_replication":"https://pith.science/pith/S5VUT3A3RLVG6OOWAEZJYUMQKB/action/replication_record"}},"created_at":"2026-05-18T01:03:20.464416+00:00","updated_at":"2026-05-18T01:03:20.464416+00:00"}