Computational experience with exterior point algorithms for the transportation problem

An experimental computational study to compare the classical primal simplex algorithm and the exterior point algorithms for the transportation problem (TP) is presented. Totally, four algorithms are compared on uniformly randomly generated test problems. The results are very encouraging for one of the competitive algorithms. In particular, a dual forest exterior point algorithm is on average up to 4.5 times faster than network simplex algorithm on TPs of size 300x300 and for all classes. This result leads into corresponding savings in computational time. From the computational performance we conclude that as the problem size increases, exterior point algorithm get relatively faster.

[1]  T. Koopmans.  Optimum Utilization of the Transportation System , 1949 .

[2]  H. Arsham,et al.  A Simplex-Type Algorithm for General Transportation Problems: An Alternative to Stepping-Stone , 1989 .

[3]  P. Pardalos,et al.  Combinatorial and Global Optimization , 2002 .

[4]  L. Goddard,et al.  Operations Research (OR) , 2007 .

[5]  Abraham Charnes,et al.  The Stepping Stone Method of Explaining Linear Programming Calculations in Transportation Problems , 1954 .

[6]  Konstantinos Paparrizos,et al.  An infeasible (exterior point) simplex algorithm for assignment problems , 1991, Math. Program..

[7]  Darwin Klingman,et al.  The alternating basis algorithm for assignment problems , 1977, Math. Program..

[8]  Konstantinos Paparrizos,et al.  A Forest Exterior Point Algorithm for Assignment Problems , 2002 .

[9]  Éva Tardos,et al.  Polynomial dual network simplex algorithms , 2011, Math. Program..

[10]  Thomas J. Cova,et al.  A network flow model for lane-based evacuation routing , 2003 .

[11]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[12]  Joaquim Júdice,et al.  An Investigation of Interior-Point Algorithms for the Linear Transportation Problem , 1996, SIAM J. Sci. Comput..

[13]  William H. Cunningham,et al.  A network simplex method , 1976, Math. Program..

[14]  Richard J. Linn,et al.  Storage space allocation in container terminals , 2003 .

[15]  Konstantinos Paparrizos,et al.  A Dual Forest Algorithm for the Assignment Problem , 1990, Applied Geometry And Discrete Mathematics.

[16]  Shiang-Tai Liu,et al.  The total cost bounds of the transportation problem with varying demand and supply , 2003 .

[17]  Eric R. Zieyel.  Operations research : applications and algorithms , 1988 .

[18]  Konstantinos Paparrizos.  An exterior point simplex algorithm for (general) linear programming problems , 1993, Ann. Oper. Res..

[19]  Rubén Ruiz,et al.  A decision support system for a real vehicle routing problem , 2004, Eur. J. Oper. Res..