THE MULTICOMMODITY NETWORK FLOW MODEL REVISED TO INCLUDE VEHICLE PER TIME PERIOD AND NODE CONSTRAINTS

THE MINIMUM-COST FORMULATION OF THE PROBLEM OF DETERMINING MULTICOMMODITY FLOWS OVER A CAPACITATED NETWORK SUBJECT TO RESOURCE CONSTRAINTS HAS BEEN TREATED IN PREVIOUS PAPERS. IN THOSE TREATMENTS ONLY CAPACITATED ARCS WERE ASSUMED, AND A UNIFORM UNIT OF MEASURE LIKE SHORT TONS WAS USED FOR ALL COMMODITIES. THIS PAPER TREATS THE EFFECT OF CONSTRAINTS ON THE NODES OF THE NETWORK, ALLOWS THE COMMODITIES TO BE MEASUREED IN THEIR "NATURAL" UNITS, AND ALLOWS THE NETWORK CAPACITIES TO BE EXPRESSED IN VEHICLES PER TIME PERIOD - IN SOME CASES GIVING A MORE ACCURATE REPRESENTATION OF THE CAPACITIES OF THE NETWORK. THIS PAPER DESCRIBES THE SOLUTION PROCEDURE WHICH USES THE COLUMN GENERATION TECHNIQUE; IT ALSO DISCUSSES COMPUTATIONAL EXPERIENCE. /AUTHOR/

  • Corporate Authors:

    N/A

    ,   United States 
  • Authors:
    • Weigel, H S
    • Cremeans, J E
  • Publication Date: 1972-3

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00202243
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Jun 12 2003 12:00AM