One-to-many stable logistics matching in the fourth party logistics

In this paper we propose an approach that can efficiently address one-to-many multi-attributes logistics matching problem in the fourth party logistics. During the whole matching process, the fourth party logistics as the mediator collects the value and finds the final solution. To deal with the proposed problem, we adopt bilateral negotiation approach to evaluate the degree of satisfaction and get the preference order of both sides. Then, according to the preference order obtained, stable matching is performed to find the stable solution. The stable matching model's objective is minimizing the overall preference under the stability constraint, and the CPLEX is used to solve the problem. Finally, a numerical experiment is performed to compare the performance in the stable matching and the traditional matching. The result demonstrates that compared with the traditional matching, the stable matching has a better performance in aspect of stability and overall fairness.