A Transportation Problem with Minimum Quantity Commitment

Authors:
Andrew Lim;Fan Wang;Zhou Xu
Affiliations:
Department of Industrial Engineering and Engineering Management, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong;Department of Industrial Engineering and Engineering Management, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong;Department of Industrial Engineering and Engineering Management, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong
Venue:
Transportation Science
Year:
2006

Citing 8
Cited 4

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Approximation algorithms for facility location problems (extended abstract)

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A new greedy approach for facility location problems

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Improved Approximation Algorithms for Metric Facility Location Problems

APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Building Steiner trees with incomplete global knowledge

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Hierarchical placement and network design problems

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Procurement Planning to Maintain Both Short-Term Adaptiveness and Long-Term Perspective

Management Science
Optimizing Military Capital Planning

Interfaces

Lower-bounded facility location

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
TPBOSCourier: a transportation procurement system (for the procurement of courier services)

IAAI'06 Proceedings of the 18th conference on Innovative applications of artificial intelligence - Volume 2
Lower-bounded facility location

ACM Transactions on Algorithms (TALG)
An algorithm for the freight allocation problem with all-units quantity-based discount

IEA/AIE'11 Proceedings of the 24th international conference on Industrial engineering and other applications of applied intelligent systems conference on Modern approaches in applied intelligence - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.