What people are saying - Write a review
We haven't found any reviews in the usual places.
Description of the Problem
Description of the Model
Description of the Heuristic
3 other sections not shown
aod HDV3 approach ARC T(IARCS assigned capacitated network flow company distribution problem computed CONNECT CONTINUE CP(IARCS CP(IXR CREATE AN ARC deficit of supply DEFINITION OF FUNCTION demand node food company distribution FORMAT(1H FORTRAN GIVES INDEX GNET HANDLED HANDLING CAPACITIES handling capacities constraints heuristic high cost arcs HNDLED HNDREF HNDREF(m IARCS IF(IPRINT EQ infeasible INODES integer inventory node IPRINT ISUP joint constraints joint handling capacities large food company LISTS DIMENSION APPLIES Master Problem maximum number mode of transportation Multicommodity Shipment Planning NARCS NAVAL POSTGRADUATE SCHOOL NCSTMP NETSMD network flow problem NIWN NMODES NMP1 nominal handling capacity NSIN NTIMEP NUMBER OF ARCS number of nodes number of pallets NUNDEM C(IARCS OFCAIIFO pair location,time PALLETS HANDLED HANDLING planning horizon PRODUCT NUMBER SHIPPED shipment planning problem SNSD solver starting solution subproblem SUBROUTINE sum of demands SUP-DEM DIFFERENCE SUPPLY NODE T(IXR TCTAL thesis UCLA X(INODES zero cost arcs