What people are saying - Write a review
We haven't found any reviews in the usual places.
Contents Volume 29 Number 1 February 1995
EDITORIAL BOARD OF TRANSPORTATION SCIENCE
3 other sections not shown
Other editions - View all
additional algorithm allocation applied approach arrival assignment assumed average bound capacity choice component computational consider constraints construction corresponding cost customers cycle decision defined delivery demand described destination determine developed discussed distance distribution dynamic effect equal example existing facility feasible Figure fleet flow formulation function given heuristic improvement increase initial integer interval lane legs length load lower Management matrix method minimize node Note objective obtained Operations Research optimal optimal solution origin path period points possible present prob probability problem procedure production programming proposed represents requests route satisfied schedule Science sequence solution solved Step stochastic Table tion tour traffic Trans transition transportation unit University variables Vehicle Routing weight