{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:SWG6EGFUCFDDQQN2MYFAYHA5YF","short_pith_number":"pith:SWG6EGFU","schema_version":"1.0","canonical_sha256":"958de218b411463841ba660a0c1c1dc176e53b04e4efcf4de6d488fb905c37d0","source":{"kind":"arxiv","id":"2206.10464","version":1},"attestation_state":"computed","paper":{"title":"Hybridization of evolutionary algorithm and deep reinforcement learning for multi-objective orienteering optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Hisao Ishibuchi, Kaiwen Li, Rui Wang, Tao Zhang, Wei Liu, Wenhua Li","submitted_at":"2022-06-21T15:20:42Z","abstract_excerpt":"Multi-objective orienteering problems (MO-OPs) are classical multi-objective routing problems and have received a lot of attention in the past decades. This study seeks to solve MO-OPs through a problem-decomposition framework, that is, a MO-OP is decomposed into a multi-objective knapsack problem (MOKP) and a travelling salesman problem (TSP). The MOKP and TSP are then solved by a multi-objective evolutionary algorithm (MOEA) and a deep reinforcement learning (DRL) method, respectively. While the MOEA module is for selecting cities, the DRL module is for planning a Hamiltonian path for these "},"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":"2206.10464","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2022-06-21T15:20:42Z","cross_cats_sorted":[],"title_canon_sha256":"f6e569331a42ea40562b653f04b00984528347c774459381f9f630ef3fb41b5f","abstract_canon_sha256":"0a0b046cb5e4f5e5241c135583ec175b98e3ee3d1dac977b0e832c12c08e7959"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:33:48.005980Z","signature_b64":"WdGC2VZWg3mKhiUT5uCBSjCHq5iYoMTjVLt3xplLgCkFz9tIfD1sjj77EI6KZvoDOsDC7lwcqm+ei09UMGU1Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"958de218b411463841ba660a0c1c1dc176e53b04e4efcf4de6d488fb905c37d0","last_reissued_at":"2026-07-05T04:33:48.005591Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:33:48.005591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hybridization of evolutionary algorithm and deep reinforcement learning for multi-objective orienteering optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Hisao Ishibuchi, Kaiwen Li, Rui Wang, Tao Zhang, Wei Liu, Wenhua Li","submitted_at":"2022-06-21T15:20:42Z","abstract_excerpt":"Multi-objective orienteering problems (MO-OPs) are classical multi-objective routing problems and have received a lot of attention in the past decades. This study seeks to solve MO-OPs through a problem-decomposition framework, that is, a MO-OP is decomposed into a multi-objective knapsack problem (MOKP) and a travelling salesman problem (TSP). The MOKP and TSP are then solved by a multi-objective evolutionary algorithm (MOEA) and a deep reinforcement learning (DRL) method, respectively. While the MOEA module is for selecting cities, the DRL module is for planning a Hamiltonian path for these "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.10464","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/2206.10464/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":"2206.10464","created_at":"2026-07-05T04:33:48.005666+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.10464v1","created_at":"2026-07-05T04:33:48.005666+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.10464","created_at":"2026-07-05T04:33:48.005666+00:00"},{"alias_kind":"pith_short_12","alias_value":"SWG6EGFUCFDD","created_at":"2026-07-05T04:33:48.005666+00:00"},{"alias_kind":"pith_short_16","alias_value":"SWG6EGFUCFDDQQN2","created_at":"2026-07-05T04:33:48.005666+00:00"},{"alias_kind":"pith_short_8","alias_value":"SWG6EGFU","created_at":"2026-07-05T04:33:48.005666+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/SWG6EGFUCFDDQQN2MYFAYHA5YF","json":"https://pith.science/pith/SWG6EGFUCFDDQQN2MYFAYHA5YF.json","graph_json":"https://pith.science/api/pith-number/SWG6EGFUCFDDQQN2MYFAYHA5YF/graph.json","events_json":"https://pith.science/api/pith-number/SWG6EGFUCFDDQQN2MYFAYHA5YF/events.json","paper":"https://pith.science/paper/SWG6EGFU"},"agent_actions":{"view_html":"https://pith.science/pith/SWG6EGFUCFDDQQN2MYFAYHA5YF","download_json":"https://pith.science/pith/SWG6EGFUCFDDQQN2MYFAYHA5YF.json","view_paper":"https://pith.science/paper/SWG6EGFU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.10464&json=true","fetch_graph":"https://pith.science/api/pith-number/SWG6EGFUCFDDQQN2MYFAYHA5YF/graph.json","fetch_events":"https://pith.science/api/pith-number/SWG6EGFUCFDDQQN2MYFAYHA5YF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SWG6EGFUCFDDQQN2MYFAYHA5YF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SWG6EGFUCFDDQQN2MYFAYHA5YF/action/storage_attestation","attest_author":"https://pith.science/pith/SWG6EGFUCFDDQQN2MYFAYHA5YF/action/author_attestation","sign_citation":"https://pith.science/pith/SWG6EGFUCFDDQQN2MYFAYHA5YF/action/citation_signature","submit_replication":"https://pith.science/pith/SWG6EGFUCFDDQQN2MYFAYHA5YF/action/replication_record"}},"created_at":"2026-07-05T04:33:48.005666+00:00","updated_at":"2026-07-05T04:33:48.005666+00:00"}