Efficient distributed maximum matching for solving the container exchange problem in the maritime industry

To reduce container management costs, ocean carrier companies rent containers from container leasing companies. Two carrier companies can exchange their empty containers between each other at various ports to eliminate the transportation cost of empty containers. To minimize costs, a container leasing company has to find the maximum number of pairs of carrier companies that can exchange containers. We formulate this problem as maximum matching in a large general graph, and propose a distributed matching algorithm to solve this problem. We also propose several optimization techniques to improve the efficiency of our algorithm.

[1]  Zhi-Zhong Chen,et al.  Parallel approximation algorithms for maximum weighted matching in general graphs , 2000, Inf. Process. Lett..

[2]  M. Patwary,et al.  Parallel greedy graph matching using an edge partitioning approach , 2010, HLPP '10.

[3]  Michael C. Loui,et al.  An efficient distributed algorithm for maximum matching in general graphs , 2005, Algorithmica.

[4]  Aart J. C. Bik,et al.  Pregel: a system for large-scale graph processing , 2010, SIGMOD Conference.

[5]  Roger Wattenhofer,et al.  Distributed Weighted Matching , 2004, DISC.

[6]  B. Slack,et al.  The Geography of Transport Systems , 2006 .

[7]  Norbert Blum,et al.  A New Approach to Maximum Matching in General Graphs , 1990, ICALP.

[8]  Sivasankaran Rajamanickam,et al.  Multithreaded Algorithms for Maximum Matching in Bipartite Graphs , 2012, 2012 IEEE 26th International Parallel and Distributed Processing Symposium.

[9]  Baruch Schieber,et al.  Slowing sequential algorithms for obtaining fast distributed and parallel algorithms: maximum matchings , 1986, PODC '86.

[10]  Rob H. Bisseling,et al.  A Parallel Approximation Algorithm for the Weighted Maximum Matching Problem , 2007, PPAM.

[11]  Pangfeng Liu,et al.  Kylin: An efficient and scalable graph data processing system , 2013, 2013 IEEE International Conference on Big Data.

[12]  M. Sipser,et al.  Maximum matching in sparse random graphs , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[13]  Jaikumar Radhakrishnan,et al.  Greed is good: Approximating independent sets in sparse and bounded-degree graphs , 1997, Algorithmica.

[14]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[15]  Vipin Kumar,et al.  Multilevel Algorithms for Multi-Constraint Graph Partitioning , 1998, Proceedings of the IEEE/ACM SC98 Conference.

[16]  Albert Chan,et al.  Coarse grained parallel algorithms for graph matching , 2008, Parallel Comput..

[17]  C Berge,et al.  TWO THEOREMS IN GRAPH THEORY. , 1957, Proceedings of the National Academy of Sciences of the United States of America.

[18]  Yon Dohn Chung,et al.  A Parallel Maximal Matching Algorithm for Large Graphs Using Pregel , 2014, IEICE Trans. Inf. Syst..

[19]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.