Decision Support for Collaboration of Carriers Based on Clustering, Swarm Intelligence and Shapley Value

Transportation costs constitute an important part in providing services and goods to customers. How to reduce transportation costs has a significant influence on competitive advantage of carriers. Although a lot of vehicle routing problems (VRP) and their variants have been extensively studied to reduce transportation costs via optimization of vehicle routes, little research focuses on how to achieve lower transportation costs through cooperation of carriers while fulfilling customer requests. This article aims to develop a decision support framework to facilitate cooperation of carriers to reduce transportation costs further based on information sharing, clustering requests, swarm intelligence, and the Shapley value cost allocation scheme. Two decision models for two carriers are compared: one reflecting the scenario without cooperation between the two carriers and the other one reflecting the scenario with cooperation between the two carriers. The simulation results indicate that the swarm intelligence and Shapley value based cooperative decision model outperforms that of the independent decision model.

[1]  Jean-Yves Potvin,et al.  Heuristic approaches to vehicle routing with backhauls and time windows , 1996, Comput. Oper. Res..

[2]  Ulrich Derigs,et al.  Cooperative planning in express carrier networks - An empirical study on the effectiveness of a real-time Decision Support System , 2011, Decis. Support Syst..

[3]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[4]  Billy E. Gillett,et al.  A Heuristic Algorithm for the Vehicle-Dispatch Problem , 1974, Oper. Res..

[5]  Hazem M. El-Bakry,et al.  Construction of Liver Fibrosis Diagnosis Ontology From Fuzzy Extended ER Modeling: Construction of FibrOnto From an EER Model , 2020, Int. J. Decis. Support Syst. Technol..

[6]  James P. Kelly,et al.  The Impact of Metaheuristics on Solving the Vehicle Routing Problem: Algorithms, Problem Sets, and Computational Results , 1998 .

[7]  Angel A. Juan,et al.  Horizontal Cooperation in Vehicle Routing Problems with Backhauling and Environmental Criteria , 2014 .

[8]  Ismail Karaoglan,et al.  A hybrid discrete particle swarm optimization for vehicle routing problem with simultaneous pickup and delivery , 2013, Comput. Ind. Eng..

[9]  E. Kalai Proportional Solutions to Bargaining Situations: Interpersonal Utility Comparisons , 1977 .

[10]  R. H. Mole,et al.  A Sequential Route-building Algorithm Employing a Generalised Savings Criterion , 1976 .

[11]  George B. Dantzig,et al.  The Truck Dispatching Problem , 1959 .

[12]  Michel Gendreau,et al.  METAHEURISTICS FOR THE VEHICLE ROUTING PROBLEM. , 1994 .

[13]  Aderemi Oluyinka Adewumi,et al.  A survey of recent advances in vehicle routing problems , 2018, Int. J. Syst. Assur. Eng. Manag..

[14]  Said Salhi,et al.  A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling , 1999, J. Oper. Res. Soc..

[15]  Pin Luarn,et al.  A discrete version of particle swarm optimization for flowshop scheduling problems , 2007, Comput. Oper. Res..

[16]  Richard F. Hartl,et al.  A survey on dynamic and stochastic vehicle routing problems , 2016 .

[17]  Gilbert Laporte,et al.  Classical and modern heuristics for the vehicle routing problem , 2000 .

[18]  Mikael Rönnqvist,et al.  Cost Allocation in Collaborative Forest Transportation , 2006, Eur. J. Oper. Res..

[19]  Fu-Shiung Hsieh,et al.  Decision support for vehicle routing problem with arbitrary pickup/delivery points , 2015, 2015 IEEE 12th International Conference on Networking, Sensing and Control.

[20]  J-F Chen,et al.  Vehicle routing problem with simultaneous deliveries and pickups , 2006, J. Oper. Res. Soc..

[21]  Michel Gendreau,et al.  The Traveling Salesman Problem with Backhauls , 1996, Comput. Oper. Res..

[22]  Mikael Rönnqvist,et al.  A review on cost allocation methods in collaborative transportation , 2016, Int. Trans. Oper. Res..

[23]  Abdelhay A. Sallam,et al.  Swarming of intelligent particles for solving the nonlinear constrained optimization problem , 2001 .

[24]  W. Dullaert,et al.  Horizontal Cooperation in Transport and Logistics: A Literature Review , 2007, Transportation Journal.

[25]  Paolo Toth,et al.  Exact Solution of the Vehicle Routing Problem , 1998 .

[26]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[27]  Arthur V. Hill,et al.  An algorithm for the traveling salesman problem with pickup and delivery customers , 1985 .

[28]  Herbert Kopfer,et al.  Collaborating freight forwarding enterprises , 2006, OR Spectr..

[29]  Angel A. Juan,et al.  Horizontal cooperation in road transportation: a case illustrating savings in distances and greenhouse gas emissions , 2015, Int. Trans. Oper. Res..

[30]  Martin W. P. Savelsbergh,et al.  Local search in routing problems with time windows , 1984 .

[31]  Christian Prins,et al.  A simple and effective evolutionary algorithm for the vehicle routing problem , 2004, Comput. Oper. Res..

[32]  Mehmet Fatih Tasgetiren,et al.  A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem , 2008, Comput. Oper. Res..

[33]  L. Shapley A Value for n-person Games , 1988 .

[34]  M. Goetschalckx,et al.  The vehicle routing problem with backhauls , 1989 .

[35]  Gilbert Laporte,et al.  Horizontal cooperation among freight carriers: request allocation and profit sharing , 2008, J. Oper. Res. Soc..

[36]  Paolo Toth,et al.  An Exact Algorithm for the Vehicle Routing Problem with Backhauls , 1997, Transp. Sci..

[37]  Fu-Shiung Hsieh,et al.  Decision support for cooperative carriers based on clustering requests and discrete particle swarm optimization , 2016, 2016 IEEE Congress on Evolutionary Computation (CEC).