{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:5EMO7EK5NVGJYLDFSBXCSUWWV2","short_pith_number":"pith:5EMO7EK5","schema_version":"1.0","canonical_sha256":"e918ef915d6d4c9c2c65906e2952d6aea123974d6908236287e1e6440691e2e0","source":{"kind":"arxiv","id":"1903.04643","version":1},"attestation_state":"computed","paper":{"title":"The Multi-objective Dynamic Traveling Salesman Problem: Last Mile Delivery with Unmanned Aerial Vehicles Assistance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andreas A. Malikopoulos, Ben Remer","submitted_at":"2019-03-11T22:57:33Z","abstract_excerpt":"In this paper, we present an approach to optimizing the last-mile delivery route of a truck using coordination with unmanned aerial vehicles (UAVs). First, a traveling salesman problem is formulated to determine the truck's route. Then, a scheduling problem is formulated to determined the routes for the UAVs. A genetic algorithm is used to solve these problems, and simulated results are presented."},"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":"1903.04643","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-11T22:57:33Z","cross_cats_sorted":[],"title_canon_sha256":"d203e46eee972bae08db4a594586e8af2f471b2a7e11d86bfe20115393ca1da7","abstract_canon_sha256":"e6f6a3f77f9d499607efd7d9fd9ad935ac75a2c9e0e73def9b7dcad2c1368f73"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:29.059095Z","signature_b64":"GdgKDNZmXsSfUaawsFD91WV6DCkHJX7U/MCsdzw3qNvk0mOEj0W3Le3ctLvK37U+ruzModEAA2vF14rs8gK+Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e918ef915d6d4c9c2c65906e2952d6aea123974d6908236287e1e6440691e2e0","last_reissued_at":"2026-05-17T23:51:29.058705Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:29.058705Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Multi-objective Dynamic Traveling Salesman Problem: Last Mile Delivery with Unmanned Aerial Vehicles Assistance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andreas A. Malikopoulos, Ben Remer","submitted_at":"2019-03-11T22:57:33Z","abstract_excerpt":"In this paper, we present an approach to optimizing the last-mile delivery route of a truck using coordination with unmanned aerial vehicles (UAVs). First, a traveling salesman problem is formulated to determine the truck's route. Then, a scheduling problem is formulated to determined the routes for the UAVs. A genetic algorithm is used to solve these problems, and simulated results are presented."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.04643","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":"1903.04643","created_at":"2026-05-17T23:51:29.058759+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.04643v1","created_at":"2026-05-17T23:51:29.058759+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.04643","created_at":"2026-05-17T23:51:29.058759+00:00"},{"alias_kind":"pith_short_12","alias_value":"5EMO7EK5NVGJ","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"5EMO7EK5NVGJYLDF","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"5EMO7EK5","created_at":"2026-05-18T12:33:10.108867+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/5EMO7EK5NVGJYLDFSBXCSUWWV2","json":"https://pith.science/pith/5EMO7EK5NVGJYLDFSBXCSUWWV2.json","graph_json":"https://pith.science/api/pith-number/5EMO7EK5NVGJYLDFSBXCSUWWV2/graph.json","events_json":"https://pith.science/api/pith-number/5EMO7EK5NVGJYLDFSBXCSUWWV2/events.json","paper":"https://pith.science/paper/5EMO7EK5"},"agent_actions":{"view_html":"https://pith.science/pith/5EMO7EK5NVGJYLDFSBXCSUWWV2","download_json":"https://pith.science/pith/5EMO7EK5NVGJYLDFSBXCSUWWV2.json","view_paper":"https://pith.science/paper/5EMO7EK5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.04643&json=true","fetch_graph":"https://pith.science/api/pith-number/5EMO7EK5NVGJYLDFSBXCSUWWV2/graph.json","fetch_events":"https://pith.science/api/pith-number/5EMO7EK5NVGJYLDFSBXCSUWWV2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5EMO7EK5NVGJYLDFSBXCSUWWV2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5EMO7EK5NVGJYLDFSBXCSUWWV2/action/storage_attestation","attest_author":"https://pith.science/pith/5EMO7EK5NVGJYLDFSBXCSUWWV2/action/author_attestation","sign_citation":"https://pith.science/pith/5EMO7EK5NVGJYLDFSBXCSUWWV2/action/citation_signature","submit_replication":"https://pith.science/pith/5EMO7EK5NVGJYLDFSBXCSUWWV2/action/replication_record"}},"created_at":"2026-05-17T23:51:29.058759+00:00","updated_at":"2026-05-17T23:51:29.058759+00:00"}