TITLE

The Intermodal Trailer Assignment Problem

AUTHOR(S)
Feo, Thomas A.; González-Velarde, José Luis
PUB. DATE
November 1995
SOURCE
Transportation Science;Nov95, Vol. 29 Issue 4, p330
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
The problem of optimally assigning highway trailers to railcar hitches in intermodal transportation is studied. An integer-linear programming formulation is constructed. The problem is formulated using set covering. The resulting formulation is very small, and possesses in practice a tight linear programming relaxation. This allows it to be solved effectively by a general purpose branch-and-bound code. This formulation also provided the basis for the development of a Greedy Randomized Adaptive Search Procedure (GRASP). This heuristic is observed to be extremely fast. Empirically, it finds the optimal solution to all of the problem instances furnished over a two year period by Consolidated Rail Corporation.
ACCESSION #
4454279

 

Related Articles

  • On the equivalence of the max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems. Pan, Yunpeng; Shi, Leyuan // Mathematical Programming;Sep2007, Vol. 110 Issue 3, p543 

    New observations are made about two lower bound schemes for single-machine min-sum scheduling problems. We find that the strongest bound of those provided by transportation problem relaxations can be computed by solving a linear program. We show the equivalence of this strongest bound and the...

  • AN EXPERIMENTAL EVALUATION OF SOME METHODS OF SOLVING THE ASSIGNMENT PROBLEM. Florian, Michael; Klein, Morton // CORS Journal;Jul70, Vol. 8 Issue 2, p101 

    Computational experiments were conducted with three methods for solving the assignment problem: Kuhn's Hungarian method, a primal method due to Balinski and Gomory, and a negative cycle method proposed by Klein. The experimental results showed Kuhn's method to be the most efficient (i.e., the...

  • Lower Bounds for Scheduling a Single Robot in a Job-Shop Environment. Brucker, Peter; Knust, Sigrid // Annals of Operations Research;Sep2002, Vol. 115 Issue 1-4, p147 

    We consider a single-machine scheduling problem which arises as a subproblem in a job-shop environment where the jobs have to be transported between the machines by a single transport robot. The robot scheduling problem may be regarded as a generalization of the traveling salesman problem with...

  • An Algorithm for Assigning Uses to Sources in a Special Class of Transportation Problems. Srinivasan, V.; Thompson, G. L. // Operations Research;Jan/Feb73, Vol. 21 Issue 1, p284 

    This paper considers a special class of transportation problems in which the needs of each user are to be supplied entirely by one of the available sources. We first show that an optimum solution to this special transportation problem is a basic feasible solution to a slightly different standard...

  • OPTIMALITY PROPERTIES OF A SPECIAL ASSIGNMENT PROBLEM. Parikh, S. C.; Wets, Roger // Operations Research;Jan/Feb64, Vol. 12 Issue 1, p139 

    In this paper, it is shown that if the cost matrix of an assignment problem has the following property cij = ∣j-i∣ then any basic feasible solution is optimal if and only if its unit components belong to two well-defined symmetric regions. The matrix with above mentioned property is...

  • THE AUCTION ALGORITHM FOR THE TRANSPORTATION PROBLEM. Bertsekas, Dimitri P.; Castanon, David A. // Annals of Operations Research;1989, Vol. 20 Issue 1-4, p67 

    The auction algorithm is a parallel relaxation method for solving the classical assignment problem. It resembles a competitive bidding process whereby unassigned persons bid simultaneously for objects, thereby raising their prices. Once all bids arc in, objects are awarded to the highest bidder....

  • THE MECHANICAL BLACKBOARD. Machol, Robert E. // Operations Research;Jun57, Vol. 5 Issue 3, p422 

    A device has been constructed to aid in solving problems of optimum distribution (the assignment problem, the transportation problem, the traveling-salesman problem, etc ). It does not mechanize the algorithm, and therefore, is not a computer, rather, it mechanizes the tedious operations that...

  • The Constrained Bottleneck Transportation Problem. Charnsethikul, Peerayuth; Svetasreni, Saeree // Journal of Mathematics & Statistics;2007, Vol. 3 Issue 1, p24 

    Two classes of the bottleneck transportation problem with an additional budget constraint are introduced. An exact approach was proposed to solve both problem classes with proofs of correctness and complexity. Moreover, the approach was extended to solve a class of multi-commodity transportation...

  • A TARGET-ASSIGNMENT PROBLEM. Manne, Alan S. // Operations Research;May/Jun58, Vol. 6 Issue 3, p346 

    This paper is concerned with a target assignment model of a probabilistic and nonlinear nature, but nevertheless one which is closely related to the 'personnel-assignment' problem It is shown here that, despite the apparent nonlinearities, it is possible to devise a linear programming...

Share

Read the Article

Courtesy of VIRGINIA BEACH PUBLIC LIBRARY AND SYSTEM

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics