Traffic scheduling via Benders decomposition

This paper presents a mathematical formulation and a solution technique for a class of traffic scheduling problems. Each problem in this class is characterized by a company-owned fleet of tractors and trailers, a calendar of shipments to be made during a specified scheduling period, and an option to contract any shipment to an independent hauler.

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

[2]  Darwin Klingman,et al.  Solving Constrained Transportation Problems , 1972, Oper. Res..

[3]  H. Kuhn.  The Hungarian method for the assignment problem , 1955 .

[4]  J. F. Benders.  Partitioning procedures for solving mixed-variables programming problems , 1962 .

[5]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[6]  A. M. Geoffrion,et al.  Integer Programming Algorithms: A Framework and State-of-the-Art Survey , 1972 .

[7]  Fred Glover,et al.  A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems , 1974 .

[8]  S. Vajda,et al.  Integer Programming and Network Flows , 1970 .

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

[10]  Gerald L. Thompson,et al.  Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm , 1973, JACM.

[11]  D. R. Fulkerson,et al.  MINIMIZING THE NUMBER OF CARRIERS TO MEET A FIXED SCHEDULE , 1954 .

[12]  P. Camion.  Characterization of totally unimodular matrices , 1965 .

[13]  Gerald G. Brown,et al.  Design and Implementation of Large-Scale Primal Transshipment Algorithms , 1976 .

[14]  A. M. Geoffrion,et al.  Multicommodity Distribution System Design by Benders Decomposition , 1974 .

[15]  George B. Dantzig,et al.  Decomposition Principle for Linear Programs , 1960 .

[16]  John M. Mulvey,et al.  Testing of a large-scale network optimization program , 1978, Math. Program..