{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XURXWSDRIGB5BEAWLL6CIBVLIW","short_pith_number":"pith:XURXWSDR","schema_version":"1.0","canonical_sha256":"bd237b48714183d090165afc2406ab459fe67e5ef0f0ca65303b9085f2b93912","source":{"kind":"arxiv","id":"1607.01728","version":1},"attestation_state":"computed","paper":{"title":"Embedding Assignment Routing Constraints through Multi Dimensional Network Construction for Solving the Multi Vehicle Routing Problem with Pickup and Delivery with Time Windows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Junhua Chen, Monirehalsadat Mahmoudi, Xuesong Zhou","submitted_at":"2016-07-06T18:02:32Z","abstract_excerpt":"The multi Vehicle Routing Problem with Pickup and Delivery with Time Windows is a challenging version of the Vehicle Routing Problem. In this paper, by embedding many complex assignment routing constraints through constructing a multi dimensional network, we intend to reach optimality for local clusters derived from a reasonably large set of passengers on real world transportation networks. More specifically, we introduce a multi vehicle state space time network representation in which only the non dominated assignment based hyper paths are examined. In addition, by the aid of passengers cumul"},"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":"1607.01728","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-06T18:02:32Z","cross_cats_sorted":[],"title_canon_sha256":"b4ad39e59a873aed02dfec7da35e42717c43ee0cc1be2e3645801819a05783f2","abstract_canon_sha256":"5488921dbe2691b8562880753525569a752bf75f3dcbd841080a463fdc21b8be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:25.611930Z","signature_b64":"j9U+uWBFZB0fw6fM6C8EXDLGwZROVmx8eujuXWGaII1rBTu200sERNIUwDmVKTaqQvp55YJuiFgRRlAUc3+bCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd237b48714183d090165afc2406ab459fe67e5ef0f0ca65303b9085f2b93912","last_reissued_at":"2026-05-18T01:11:25.611394Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:25.611394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Embedding Assignment Routing Constraints through Multi Dimensional Network Construction for Solving the Multi Vehicle Routing Problem with Pickup and Delivery with Time Windows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Junhua Chen, Monirehalsadat Mahmoudi, Xuesong Zhou","submitted_at":"2016-07-06T18:02:32Z","abstract_excerpt":"The multi Vehicle Routing Problem with Pickup and Delivery with Time Windows is a challenging version of the Vehicle Routing Problem. In this paper, by embedding many complex assignment routing constraints through constructing a multi dimensional network, we intend to reach optimality for local clusters derived from a reasonably large set of passengers on real world transportation networks. More specifically, we introduce a multi vehicle state space time network representation in which only the non dominated assignment based hyper paths are examined. In addition, by the aid of passengers cumul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.01728","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":"1607.01728","created_at":"2026-05-18T01:11:25.611506+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.01728v1","created_at":"2026-05-18T01:11:25.611506+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01728","created_at":"2026-05-18T01:11:25.611506+00:00"},{"alias_kind":"pith_short_12","alias_value":"XURXWSDRIGB5","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XURXWSDRIGB5BEAW","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XURXWSDR","created_at":"2026-05-18T12:30:51.357362+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/XURXWSDRIGB5BEAWLL6CIBVLIW","json":"https://pith.science/pith/XURXWSDRIGB5BEAWLL6CIBVLIW.json","graph_json":"https://pith.science/api/pith-number/XURXWSDRIGB5BEAWLL6CIBVLIW/graph.json","events_json":"https://pith.science/api/pith-number/XURXWSDRIGB5BEAWLL6CIBVLIW/events.json","paper":"https://pith.science/paper/XURXWSDR"},"agent_actions":{"view_html":"https://pith.science/pith/XURXWSDRIGB5BEAWLL6CIBVLIW","download_json":"https://pith.science/pith/XURXWSDRIGB5BEAWLL6CIBVLIW.json","view_paper":"https://pith.science/paper/XURXWSDR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.01728&json=true","fetch_graph":"https://pith.science/api/pith-number/XURXWSDRIGB5BEAWLL6CIBVLIW/graph.json","fetch_events":"https://pith.science/api/pith-number/XURXWSDRIGB5BEAWLL6CIBVLIW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XURXWSDRIGB5BEAWLL6CIBVLIW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XURXWSDRIGB5BEAWLL6CIBVLIW/action/storage_attestation","attest_author":"https://pith.science/pith/XURXWSDRIGB5BEAWLL6CIBVLIW/action/author_attestation","sign_citation":"https://pith.science/pith/XURXWSDRIGB5BEAWLL6CIBVLIW/action/citation_signature","submit_replication":"https://pith.science/pith/XURXWSDRIGB5BEAWLL6CIBVLIW/action/replication_record"}},"created_at":"2026-05-18T01:11:25.611506+00:00","updated_at":"2026-05-18T01:11:25.611506+00:00"}