{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:CALJGN55NQDWPQHBDLTAU5KHKA","short_pith_number":"pith:CALJGN55","schema_version":"1.0","canonical_sha256":"10169337bd6c0767c0e11ae60a7547501aa81afb78a2241271cbda0c8d630c87","source":{"kind":"arxiv","id":"2201.09424","version":2},"attestation_state":"computed","paper":{"title":"An Effective Iterated Two-stage Heuristic Algorithm for the Multiple Traveling Salesmen Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Jiongzhi Zheng, Wenchang Xu, Wentao Li, Yawei Hong, Yongfu Chen","submitted_at":"2022-01-24T02:43:08Z","abstract_excerpt":"The multiple Traveling Salesmen Problem (mTSP) is a general extension of the famous NP-hard Traveling Salesmen Problem (TSP), that there are m (m > 1) salesmen to visit the cities. In this paper, we address the mTSP with both the minsum objective and minmax objective, which aims at minimizing the total length of the $m$ tours and the length of the longest tour among all the m tours, respectively. We propose an iterated two-stage heuristic algorithm called ITSHA for the mTSP. Each iteration of ITSHA consists of an initialization stage and an improvement stage. The initialization stage aims to g"},"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":"2201.09424","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2022-01-24T02:43:08Z","cross_cats_sorted":[],"title_canon_sha256":"e317834458b4b228a4df6bc4d6ad09789495f27fe36019b12382bc8b5da8bc96","abstract_canon_sha256":"c916ce5ea6e186cf5841b9894558315b0c2df2a694a369d2e396d058b6b7c2e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:00:22.001229Z","signature_b64":"fLJpfGqiM8QJVIe7zafnHwEn5a11xn4vgPsvlSuNeFZCZEOsjmE0be/LWTtU+t4X+2B6f1+r8hP13IrbI/XhBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10169337bd6c0767c0e11ae60a7547501aa81afb78a2241271cbda0c8d630c87","last_reissued_at":"2026-07-05T04:00:22.000754Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:00:22.000754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Effective Iterated Two-stage Heuristic Algorithm for the Multiple Traveling Salesmen Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Jiongzhi Zheng, Wenchang Xu, Wentao Li, Yawei Hong, Yongfu Chen","submitted_at":"2022-01-24T02:43:08Z","abstract_excerpt":"The multiple Traveling Salesmen Problem (mTSP) is a general extension of the famous NP-hard Traveling Salesmen Problem (TSP), that there are m (m > 1) salesmen to visit the cities. In this paper, we address the mTSP with both the minsum objective and minmax objective, which aims at minimizing the total length of the $m$ tours and the length of the longest tour among all the m tours, respectively. We propose an iterated two-stage heuristic algorithm called ITSHA for the mTSP. Each iteration of ITSHA consists of an initialization stage and an improvement stage. The initialization stage aims to g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.09424","kind":"arxiv","version":2},"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/2201.09424/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":"2201.09424","created_at":"2026-07-05T04:00:22.000819+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.09424v2","created_at":"2026-07-05T04:00:22.000819+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.09424","created_at":"2026-07-05T04:00:22.000819+00:00"},{"alias_kind":"pith_short_12","alias_value":"CALJGN55NQDW","created_at":"2026-07-05T04:00:22.000819+00:00"},{"alias_kind":"pith_short_16","alias_value":"CALJGN55NQDWPQHB","created_at":"2026-07-05T04:00:22.000819+00:00"},{"alias_kind":"pith_short_8","alias_value":"CALJGN55","created_at":"2026-07-05T04:00:22.000819+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/CALJGN55NQDWPQHBDLTAU5KHKA","json":"https://pith.science/pith/CALJGN55NQDWPQHBDLTAU5KHKA.json","graph_json":"https://pith.science/api/pith-number/CALJGN55NQDWPQHBDLTAU5KHKA/graph.json","events_json":"https://pith.science/api/pith-number/CALJGN55NQDWPQHBDLTAU5KHKA/events.json","paper":"https://pith.science/paper/CALJGN55"},"agent_actions":{"view_html":"https://pith.science/pith/CALJGN55NQDWPQHBDLTAU5KHKA","download_json":"https://pith.science/pith/CALJGN55NQDWPQHBDLTAU5KHKA.json","view_paper":"https://pith.science/paper/CALJGN55","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.09424&json=true","fetch_graph":"https://pith.science/api/pith-number/CALJGN55NQDWPQHBDLTAU5KHKA/graph.json","fetch_events":"https://pith.science/api/pith-number/CALJGN55NQDWPQHBDLTAU5KHKA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CALJGN55NQDWPQHBDLTAU5KHKA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CALJGN55NQDWPQHBDLTAU5KHKA/action/storage_attestation","attest_author":"https://pith.science/pith/CALJGN55NQDWPQHBDLTAU5KHKA/action/author_attestation","sign_citation":"https://pith.science/pith/CALJGN55NQDWPQHBDLTAU5KHKA/action/citation_signature","submit_replication":"https://pith.science/pith/CALJGN55NQDWPQHBDLTAU5KHKA/action/replication_record"}},"created_at":"2026-07-05T04:00:22.000819+00:00","updated_at":"2026-07-05T04:00:22.000819+00:00"}