A Transportation Problem with Minimum Quantity Commitment

We study a transportation problem with the minimum quantity commitment (MQC), which is faced by a famous international company. The company has a large number of cargos for carriers to ship to the United States. However, the U.S. Marine Federal Commission stipulates that when shipping cargos to the United States, shippers must engage their carriers with an MQC. With such a constraint of MQC, the transportation problem becomes intractable. To solve it practically, we provide a mixed-integer programming model defined by a number of strong facets. Based on this model, a branch-and-cut search scheme is applied to solve small-size instances and a linear programming rounding heuristic for large ones. We also devise a greedy approximation method, whose solution quality depends on the scale of the minimum quantity if the transportation cost forms a distance metric. Extensive experiments have been conducted to measure the performance of the formulations and the algorithms and have shown that the linear rounding heuristic behaves best.

[1]  Dorit S. Hochbaum,et al.  Heuristics for the fixed cost median problem , 1982, Math. Program..

[2]  Éva Tardos,et al.  Approximation algorithms for facility location problems (extended abstract) , 1997, STOC '97.

[3]  Alexandra M. Newman,et al.  Optimizing Military Capital Planning , 2004, Interfaces.

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

[5]  Ravi Anupindi,et al.  Analysis of supply contracts with total minimum commitment , 1997 .

[6]  Amin Saberi,et al.  A new greedy approach for facility location problems , 2002, STOC '02.

[7]  Mohammad Abdulrahman Al-Fawzan,et al.  A tabu search approach to the uncapacitated facility location problem , 1999, Ann. Oper. Res..

[8]  J. Current,et al.  An efficient tabu search procedure for the p-Median Problem , 1997 .

[9]  Sudipto Guha,et al.  Hierarchical placement and network design problems , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[10]  Karen Aardal,et al.  Polyhedral Techniques in Combinatorial Optimization , 1995 .

[11]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[12]  S. David Wu,et al.  Procurement Planning to Maintain Both Short-Term Adaptiveness and Long-Term Perspective , 2001, Manag. Sci..

[13]  David R. Karger,et al.  Building Steiner trees with incomplete global knowledge , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[14]  Mohammad Mahdian,et al.  Improved Approximation Algorithms for Metric Facility Location Problems , 2002, APPROX.

[15]  G. Nemhauser,et al.  Integer Programming , 2020 .

[16]  Hoesel van Cpm,et al.  Polyhedral techniques in combinatorial optimization I: theory , 1996 .

[17]  Nicholas J. Radcliffe,et al.  Genetic Set Recombination , 1992, FOGA.

[18]  Dmitry Krass,et al.  Analysis of supply contracts with minimum total order quantity commitments and non-stationary demands , 2001, Eur. J. Oper. Res..

[19]  George L. Nemhauser,et al.  The uncapacitated facility location problem , 1990 .

[20]  E. Correa,et al.  A genetic algorithm for the P-median problem , 2001 .

[21]  K. Aardal,et al.  Polyhedral techniques in combinatorial optimization II: applications and computations , 1999 .