Solving a Truck Dispatching Scheduling Problem Using Branch-and-Cut

Simple item page
dc.contributor.authorBixby, Robert E.
dc.contributor.authorLee, Eva K.
dc.date.accessioned2018-06-18T17:41:11Z
dc.date.available2018-06-18T17:41:11Z
dc.date.issued1993-09
dc.date.noteSeptember 1993
dc.description.abstractA branch-and-cut IP solver is developed for a class of structured 0/1 integer programs arising from a truck dispatching scheduling problem. This problem involves a special class of knapsack equality constraints. Families of facets for the polytopes associated with individual knapsack constraints are identified, and in some cases, a complete characterization of a polytope is obtained. In addition, a notion of "conflict graph" is utilized to obtain an approximating node-packing polytope for the convex hull of all 0/1 solutions. The branch-and-cut solver generates cuts based on both the knapsack equality constraints and the approximating node-packing polytope, and incorporates these cuts into a tree-search algorithm that uses problem reformulation and linear programming-based heuristics at each node in the search tree to assist in the solution process. Numerical experiments are performed on large-scale real instances supplied by Texaco Trading &Transportation, Inc. The optimal schedules correspond to cost savings for the company and greater job satisfaction for drivers due to more balanced work schedules and income distribution.
dc.format.extent32 pp
dc.identifier.citationBixby, Robert E. and Lee, Eva K.. "Solving a Truck Dispatching Scheduling Problem Using Branch-and-Cut." (1993) <a href="https://hdl.handle.net/1911/101808">https://hdl.handle.net/1911/101808</a>.
dc.identifier.digitalTR93-37
dc.identifier.urihttps://hdl.handle.net/1911/101808
dc.language.isoeng
dc.titleSolving a Truck Dispatching Scheduling Problem Using Branch-and-Cut
dc.typeTechnical report
dc.type.dcmiText
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR93-37.pdf
Size:
392.83 KB
Format:
Adobe Portable Document Format
Download
Collections
CAAM Technical Reports