{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:XYNA44PIGZYYROF4PDVOA7GS4E","short_pith_number":"pith:XYNA44PI","schema_version":"1.0","canonical_sha256":"be1a0e71e8367188b8bc78eae07cd2e1377247e7c79d1ddcfa3454a5b4fe2312","source":{"kind":"arxiv","id":"1810.11134","version":1},"attestation_state":"computed","paper":{"title":"Optimizing Capacitated Vehicle Scheduling with Time Windows: A Case Study of RMC Delivery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mohamed Masoud, Saeid Belkasim","submitted_at":"2018-10-25T23:24:00Z","abstract_excerpt":"Ready Mixed Concrete Delivery Problem (RMCDP) is a multi-objective multi-constraint dynamic combinatorial optimization problem. From the operational research prospective, it is a real life logistic problem that is hard to be solved with large instances. In RMCDP, there is a need to optimize the Ready Mixed Concrete ( RMC) delivery by predetermining an optimal schedule for the sites-trips assignments that adheres to strict time, distance, and capacity constraints. This optimization process is subjected to a domain of objectives ranging from achieving maximum revenue to minimizing the operationa"},"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":"1810.11134","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-25T23:24:00Z","cross_cats_sorted":[],"title_canon_sha256":"e41ab2b9bd309ffa38e61a453125fa1f05f47050a5348dce9abea090ebc7fb88","abstract_canon_sha256":"c1767a2827fe2b77dfdcb28d781bb6c10a6ea3767969c0a4ac891e07b81c28e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:15.104630Z","signature_b64":"b7jj0QPW6agiFWxZWE81PrNObk0pMgjnjhFdkbdPlXKLWWtP71lbswtSpWl0TPUAjeVuRYXoIU5xiHArSgw8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be1a0e71e8367188b8bc78eae07cd2e1377247e7c79d1ddcfa3454a5b4fe2312","last_reissued_at":"2026-05-18T00:02:15.104023Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:15.104023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimizing Capacitated Vehicle Scheduling with Time Windows: A Case Study of RMC Delivery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mohamed Masoud, Saeid Belkasim","submitted_at":"2018-10-25T23:24:00Z","abstract_excerpt":"Ready Mixed Concrete Delivery Problem (RMCDP) is a multi-objective multi-constraint dynamic combinatorial optimization problem. From the operational research prospective, it is a real life logistic problem that is hard to be solved with large instances. In RMCDP, there is a need to optimize the Ready Mixed Concrete ( RMC) delivery by predetermining an optimal schedule for the sites-trips assignments that adheres to strict time, distance, and capacity constraints. This optimization process is subjected to a domain of objectives ranging from achieving maximum revenue to minimizing the operationa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11134","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":"1810.11134","created_at":"2026-05-18T00:02:15.104111+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.11134v1","created_at":"2026-05-18T00:02:15.104111+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11134","created_at":"2026-05-18T00:02:15.104111+00:00"},{"alias_kind":"pith_short_12","alias_value":"XYNA44PIGZYY","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"XYNA44PIGZYYROF4","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"XYNA44PI","created_at":"2026-05-18T12:33:04.347982+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/XYNA44PIGZYYROF4PDVOA7GS4E","json":"https://pith.science/pith/XYNA44PIGZYYROF4PDVOA7GS4E.json","graph_json":"https://pith.science/api/pith-number/XYNA44PIGZYYROF4PDVOA7GS4E/graph.json","events_json":"https://pith.science/api/pith-number/XYNA44PIGZYYROF4PDVOA7GS4E/events.json","paper":"https://pith.science/paper/XYNA44PI"},"agent_actions":{"view_html":"https://pith.science/pith/XYNA44PIGZYYROF4PDVOA7GS4E","download_json":"https://pith.science/pith/XYNA44PIGZYYROF4PDVOA7GS4E.json","view_paper":"https://pith.science/paper/XYNA44PI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.11134&json=true","fetch_graph":"https://pith.science/api/pith-number/XYNA44PIGZYYROF4PDVOA7GS4E/graph.json","fetch_events":"https://pith.science/api/pith-number/XYNA44PIGZYYROF4PDVOA7GS4E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XYNA44PIGZYYROF4PDVOA7GS4E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XYNA44PIGZYYROF4PDVOA7GS4E/action/storage_attestation","attest_author":"https://pith.science/pith/XYNA44PIGZYYROF4PDVOA7GS4E/action/author_attestation","sign_citation":"https://pith.science/pith/XYNA44PIGZYYROF4PDVOA7GS4E/action/citation_signature","submit_replication":"https://pith.science/pith/XYNA44PIGZYYROF4PDVOA7GS4E/action/replication_record"}},"created_at":"2026-05-18T00:02:15.104111+00:00","updated_at":"2026-05-18T00:02:15.104111+00:00"}