دانلود رایگان مقاله انگلیسی یک روش تجزیه دقیق برای صرفه جویی در پیکاپ تعاونی و تحویل بر اساس توزیع سود - الزویر 2017

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).

7. Conclusion

Our contributions in this study can be summarized as following. First, a mathematical model minimizing trips of cooperation based on trip scheduled results is proposed. By defining cooperative trip set, we prove that cooperation can save trips only when cooperative trip set exists. Second, for the two-trip cooperative trip set, we obtain the optimal solution of saved trips by enumerating all feasible cooperative cases. Subsequently we propose a novel decomposition method to obtain the optimal solution of K-trip cooperative trip set by decomposing it to at most K − 1 two-trip cooperative trip sets. Third, we develop a based-on-decomposition algorithm to accurately calculate saved trips by cooperation. Computational complexity of the exact algorithm is O(N), where N is the total number of trips. Using the exact algorithm, we calculate the exact Shapley value for a real cooperative pickup and delivery case, i.e., PDCA. Using the proposed decomposition algorithm, we can further investigate the other classical profit distribution method based on cooperative game theory, such as the kernel, the bargaining set, the stable set, the core and the nucleolus.