Abstract
Compared to the non-cooperative mode, the cooperative mode is a powerful way to reduce operational cost in pickup and delivery service. In order to protect business sensitive information, sometimes participants are unwilling to open the customer's detailed information. Thus, we utilize the publishable trip scheduled results to compute the saved trips brought by cooperation. A mathematical model minimizing trips of cooperation is proposed. To obtain the exact solution, we define the cooperative trip set. We prove that only when cooperative trip set exists it is possible to save trips by cooperation. For a two-trip cooperative trip set, we exactly obtain the saved trips by enumerating all feasible cooperative cases. For a K-trip cooperative trip set, we propose an exact method to obtain the saved trips by decomposing it to at most K-1 two-trip cooperative trip sets. Computational complexity of the based-on-decomposition exact algorithm is O(N), where N is the total number of trips. Using the based-on-decomposition algorithm, we calculate the exact Shapley value to distribute profit. To empirically verify the exact method, we perform the extensive experiment cases of the real cooperative pickup and delivery service, i.e., “picking up and delivering customers to airport service” (PDCA).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.