{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:K57JW6EGPLLJNJ3WPD3A6IFADJ","short_pith_number":"pith:K57JW6EG","schema_version":"1.0","canonical_sha256":"577e9b78867ad696a77678f60f20a01a5a25a269e569e9e00857080eb23cd0a9","source":{"kind":"arxiv","id":"1501.05354","version":2},"attestation_state":"computed","paper":{"title":"A speed and departure time optimization algorithm for the Pollution-Routing Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anand Subramanian, Nelson Maculan, Raphael Kramer, Thibaut Vidal","submitted_at":"2015-01-21T23:59:38Z","abstract_excerpt":"We propose a new speed and departure time optimization algorithm for the Pollution-Routing Problem (PRP), which runs in quadratic time and returns a certified optimal schedule. This algorithm is embedded into an iterated local search-based metaheuristic to achieve a combined speed, scheduling and routing optimization. The start of the working day is set as a decision variable for individual routes, thus enabling a better assignment of human resources to required demands. Some routes that were evaluated as unprofitable can now appear as viable candidates later in the day, leading to a larger se"},"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":"1501.05354","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-21T23:59:38Z","cross_cats_sorted":[],"title_canon_sha256":"8e69d24328404604c914d244c76a68ba2e9045118a7ec0ae57afc788a13a61cb","abstract_canon_sha256":"25593d3e9fd01ecebef1477c34d58cabea25bf101abc5c1189751611bf6be22b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:43.052008Z","signature_b64":"Ytc/WeVcpoU7GZwrTgSOkdg6bKhEts6YnVrYIZYU8Nx4aMyOfSthqxAdlFAmtvmZ3F3Vg3hKYWIbUnuu2pWkAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"577e9b78867ad696a77678f60f20a01a5a25a269e569e9e00857080eb23cd0a9","last_reissued_at":"2026-05-18T00:19:43.051306Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:43.051306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A speed and departure time optimization algorithm for the Pollution-Routing Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anand Subramanian, Nelson Maculan, Raphael Kramer, Thibaut Vidal","submitted_at":"2015-01-21T23:59:38Z","abstract_excerpt":"We propose a new speed and departure time optimization algorithm for the Pollution-Routing Problem (PRP), which runs in quadratic time and returns a certified optimal schedule. This algorithm is embedded into an iterated local search-based metaheuristic to achieve a combined speed, scheduling and routing optimization. The start of the working day is set as a decision variable for individual routes, thus enabling a better assignment of human resources to required demands. Some routes that were evaluated as unprofitable can now appear as viable candidates later in the day, leading to a larger se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.05354","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":""},"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":"1501.05354","created_at":"2026-05-18T00:19:43.051435+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.05354v2","created_at":"2026-05-18T00:19:43.051435+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05354","created_at":"2026-05-18T00:19:43.051435+00:00"},{"alias_kind":"pith_short_12","alias_value":"K57JW6EGPLLJ","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"K57JW6EGPLLJNJ3W","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"K57JW6EG","created_at":"2026-05-18T12:29:27.538025+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/K57JW6EGPLLJNJ3WPD3A6IFADJ","json":"https://pith.science/pith/K57JW6EGPLLJNJ3WPD3A6IFADJ.json","graph_json":"https://pith.science/api/pith-number/K57JW6EGPLLJNJ3WPD3A6IFADJ/graph.json","events_json":"https://pith.science/api/pith-number/K57JW6EGPLLJNJ3WPD3A6IFADJ/events.json","paper":"https://pith.science/paper/K57JW6EG"},"agent_actions":{"view_html":"https://pith.science/pith/K57JW6EGPLLJNJ3WPD3A6IFADJ","download_json":"https://pith.science/pith/K57JW6EGPLLJNJ3WPD3A6IFADJ.json","view_paper":"https://pith.science/paper/K57JW6EG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.05354&json=true","fetch_graph":"https://pith.science/api/pith-number/K57JW6EGPLLJNJ3WPD3A6IFADJ/graph.json","fetch_events":"https://pith.science/api/pith-number/K57JW6EGPLLJNJ3WPD3A6IFADJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K57JW6EGPLLJNJ3WPD3A6IFADJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K57JW6EGPLLJNJ3WPD3A6IFADJ/action/storage_attestation","attest_author":"https://pith.science/pith/K57JW6EGPLLJNJ3WPD3A6IFADJ/action/author_attestation","sign_citation":"https://pith.science/pith/K57JW6EGPLLJNJ3WPD3A6IFADJ/action/citation_signature","submit_replication":"https://pith.science/pith/K57JW6EGPLLJNJ3WPD3A6IFADJ/action/replication_record"}},"created_at":"2026-05-18T00:19:43.051435+00:00","updated_at":"2026-05-18T00:19:43.051435+00:00"}