{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TBQHCNEVRY6X6QUJPCDTLBGY4T","short_pith_number":"pith:TBQHCNEV","schema_version":"1.0","canonical_sha256":"98607134958e3d7f428978873584d8e4dc4d75ce8c644e1154bf0ed0d1ab9a35","source":{"kind":"arxiv","id":"1805.04965","version":1},"attestation_state":"computed","paper":{"title":"A Matrix Representation of the Multiple Vehicle Routing Problem for Pickup and Delivery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hyongju Park, Jinsun Liu, Matthew Johnson-Roberson, Ram Vasudevan","submitted_at":"2018-05-13T22:20:26Z","abstract_excerpt":"This paper develops a computationally efficient algorithm for the Multiple Vehicle Pickup and Delivery Problem (MVPDP) with the objective of minimizing the tour cost incurred while completing the task of pickup and delivery of customers. To this end, this paper constructs a novel 0-1 Integer Quadratic Programming (IQP) problem to exactly solve the MVPDP. Compared to the state-of-the-art Mixed Integer Linear Programming (MILP) formulation of the problem, the one presented here requires fewer constraints and decision variables. To ensure that this IQP formulation of the MVPDP can be solved in a "},"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":"1805.04965","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-13T22:20:26Z","cross_cats_sorted":[],"title_canon_sha256":"fb99790bfe9a784217213dac21521631c6a6e65561926431dc060f0b73ce57e2","abstract_canon_sha256":"ba29af0b2d60d9dfe51160d7d5ebbaa3af3b1f49f1e921c75a226773fcb878bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:04.212420Z","signature_b64":"BEcDWmQSd2LUgRekSUFEkv+8E83NRbEBxnS150gD2HEFB8Bf2MWAobGuxnRRSI56KamkU1uKgpe0TSbWwwddBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98607134958e3d7f428978873584d8e4dc4d75ce8c644e1154bf0ed0d1ab9a35","last_reissued_at":"2026-05-18T00:16:04.212064Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:04.212064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Matrix Representation of the Multiple Vehicle Routing Problem for Pickup and Delivery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hyongju Park, Jinsun Liu, Matthew Johnson-Roberson, Ram Vasudevan","submitted_at":"2018-05-13T22:20:26Z","abstract_excerpt":"This paper develops a computationally efficient algorithm for the Multiple Vehicle Pickup and Delivery Problem (MVPDP) with the objective of minimizing the tour cost incurred while completing the task of pickup and delivery of customers. To this end, this paper constructs a novel 0-1 Integer Quadratic Programming (IQP) problem to exactly solve the MVPDP. Compared to the state-of-the-art Mixed Integer Linear Programming (MILP) formulation of the problem, the one presented here requires fewer constraints and decision variables. To ensure that this IQP formulation of the MVPDP can be solved in a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04965","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":"1805.04965","created_at":"2026-05-18T00:16:04.212117+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.04965v1","created_at":"2026-05-18T00:16:04.212117+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04965","created_at":"2026-05-18T00:16:04.212117+00:00"},{"alias_kind":"pith_short_12","alias_value":"TBQHCNEVRY6X","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"TBQHCNEVRY6X6QUJ","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"TBQHCNEV","created_at":"2026-05-18T12:32:53.628368+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/TBQHCNEVRY6X6QUJPCDTLBGY4T","json":"https://pith.science/pith/TBQHCNEVRY6X6QUJPCDTLBGY4T.json","graph_json":"https://pith.science/api/pith-number/TBQHCNEVRY6X6QUJPCDTLBGY4T/graph.json","events_json":"https://pith.science/api/pith-number/TBQHCNEVRY6X6QUJPCDTLBGY4T/events.json","paper":"https://pith.science/paper/TBQHCNEV"},"agent_actions":{"view_html":"https://pith.science/pith/TBQHCNEVRY6X6QUJPCDTLBGY4T","download_json":"https://pith.science/pith/TBQHCNEVRY6X6QUJPCDTLBGY4T.json","view_paper":"https://pith.science/paper/TBQHCNEV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.04965&json=true","fetch_graph":"https://pith.science/api/pith-number/TBQHCNEVRY6X6QUJPCDTLBGY4T/graph.json","fetch_events":"https://pith.science/api/pith-number/TBQHCNEVRY6X6QUJPCDTLBGY4T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TBQHCNEVRY6X6QUJPCDTLBGY4T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TBQHCNEVRY6X6QUJPCDTLBGY4T/action/storage_attestation","attest_author":"https://pith.science/pith/TBQHCNEVRY6X6QUJPCDTLBGY4T/action/author_attestation","sign_citation":"https://pith.science/pith/TBQHCNEVRY6X6QUJPCDTLBGY4T/action/citation_signature","submit_replication":"https://pith.science/pith/TBQHCNEVRY6X6QUJPCDTLBGY4T/action/replication_record"}},"created_at":"2026-05-18T00:16:04.212117+00:00","updated_at":"2026-05-18T00:16:04.212117+00:00"}