{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:XFHP5NRECCZZNMLR2QCAI3FBEJ","short_pith_number":"pith:XFHP5NRE","schema_version":"1.0","canonical_sha256":"b94efeb62410b396b171d404046ca12242ebf4330aa062addacf6a330a9ce5d7","source":{"kind":"arxiv","id":"2506.01065","version":1},"attestation_state":"computed","paper":{"title":"Trilevel Memetic Algorithm for the Electric Vehicle Routing Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.NE","authors_text":"Ivan Milinovi\\'c, Leon Stjepan Uroi\\'c, Marko {\\DJ}urasevi\\'c","submitted_at":"2025-06-01T16:08:43Z","abstract_excerpt":"The Electric Vehicle Routing Problem (EVRP) extends the capacitated vehicle routing problem by incorporating battery constraints and charging stations, posing significant optimization challenges. This paper introduces a Trilevel Memetic Algorithm (TMA) that hierarchically optimizes customer sequences, route assignments, and charging station insertions. The method combines genetic algorithms with dynamic programming, ensuring efficient and high-quality solutions. Benchmark tests on WCCI2020 instances show competitive performance, matching best-known results for small-scale cases. While computat"},"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":"2506.01065","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2025-06-01T16:08:43Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"935f20cfd91392ca661d4a141df248060fd05e691d633236901f15f0b60a8dd9","abstract_canon_sha256":"a0c00fc6837661f056197c367323f6fb72b2f3a9e3fea65ccac1fb9132571ebf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:13:45.373039Z","signature_b64":"gCBa7mL1jQUMmltaQvmA+b5Ea80Y+/4oF51I9l8AsR9sM7Z5oLZ23SZ34HdJjXwcHS4OR67Ad5xljCLxU72tCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b94efeb62410b396b171d404046ca12242ebf4330aa062addacf6a330a9ce5d7","last_reissued_at":"2026-07-05T11:13:45.372612Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:13:45.372612Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Trilevel Memetic Algorithm for the Electric Vehicle Routing Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.NE","authors_text":"Ivan Milinovi\\'c, Leon Stjepan Uroi\\'c, Marko {\\DJ}urasevi\\'c","submitted_at":"2025-06-01T16:08:43Z","abstract_excerpt":"The Electric Vehicle Routing Problem (EVRP) extends the capacitated vehicle routing problem by incorporating battery constraints and charging stations, posing significant optimization challenges. This paper introduces a Trilevel Memetic Algorithm (TMA) that hierarchically optimizes customer sequences, route assignments, and charging station insertions. The method combines genetic algorithms with dynamic programming, ensuring efficient and high-quality solutions. Benchmark tests on WCCI2020 instances show competitive performance, matching best-known results for small-scale cases. While computat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.01065","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.01065/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2506.01065","created_at":"2026-07-05T11:13:45.372667+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.01065v1","created_at":"2026-07-05T11:13:45.372667+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.01065","created_at":"2026-07-05T11:13:45.372667+00:00"},{"alias_kind":"pith_short_12","alias_value":"XFHP5NRECCZZ","created_at":"2026-07-05T11:13:45.372667+00:00"},{"alias_kind":"pith_short_16","alias_value":"XFHP5NRECCZZNMLR","created_at":"2026-07-05T11:13:45.372667+00:00"},{"alias_kind":"pith_short_8","alias_value":"XFHP5NRE","created_at":"2026-07-05T11:13:45.372667+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/XFHP5NRECCZZNMLR2QCAI3FBEJ","json":"https://pith.science/pith/XFHP5NRECCZZNMLR2QCAI3FBEJ.json","graph_json":"https://pith.science/api/pith-number/XFHP5NRECCZZNMLR2QCAI3FBEJ/graph.json","events_json":"https://pith.science/api/pith-number/XFHP5NRECCZZNMLR2QCAI3FBEJ/events.json","paper":"https://pith.science/paper/XFHP5NRE"},"agent_actions":{"view_html":"https://pith.science/pith/XFHP5NRECCZZNMLR2QCAI3FBEJ","download_json":"https://pith.science/pith/XFHP5NRECCZZNMLR2QCAI3FBEJ.json","view_paper":"https://pith.science/paper/XFHP5NRE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.01065&json=true","fetch_graph":"https://pith.science/api/pith-number/XFHP5NRECCZZNMLR2QCAI3FBEJ/graph.json","fetch_events":"https://pith.science/api/pith-number/XFHP5NRECCZZNMLR2QCAI3FBEJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XFHP5NRECCZZNMLR2QCAI3FBEJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XFHP5NRECCZZNMLR2QCAI3FBEJ/action/storage_attestation","attest_author":"https://pith.science/pith/XFHP5NRECCZZNMLR2QCAI3FBEJ/action/author_attestation","sign_citation":"https://pith.science/pith/XFHP5NRECCZZNMLR2QCAI3FBEJ/action/citation_signature","submit_replication":"https://pith.science/pith/XFHP5NRECCZZNMLR2QCAI3FBEJ/action/replication_record"}},"created_at":"2026-07-05T11:13:45.372667+00:00","updated_at":"2026-07-05T11:13:45.372667+00:00"}