In the journal in 1967, Szwarc presented an algorithm for the optimal routing of a common vehicle fleet between m sources and n sinks with p different types of commodities. The main premise of the formulation is that a truck may carry only one commodity at a time and must deliver the entire load to one demand area. This elminates the problem of routing vehicles between sources or between sinks and limits the problem to the routing of loaded trucks between sources and sinks and empty trucks making the return trip. Szwarc considered only the transportation aspect of the problem (i.e., no intermediate points) and presented a very efficient algorithm for solution of the case described. (Author)
An Extension of the (Szwarc) Truck Assignment Problem
1972
10 pages
Report
No indication
English