"A heuristic algorithm, called the sweep algorithm, is developed for the vehicle dispatch problem with distance and load constraints for each vehicle. A mathematical development and a step procedure for the sweep algorithm is given. Also given are eight problems and their solutions derived by the sweep algorithm. The solutions for this algorithm are compared with solutions from other vehicle dispatch algorithms, and the sweep algorithm is found to give better results for almost every problem. Various modifications are also presented for the sweep algorithm. A mathematical formulation is given for the vehicle dispatch problem with arbitrary cost functions at each location. A branch and bound algorithm is developed, which yields an optimal solution for the problem with one server"--Abstract, page ii.
Gillett, Billy E.
Lee, Ralph E., 1921-2010
Bain, Lee J., 1939-
Rigler, A. K.
Eckles, Robert W., 1927-
Mathematics and Statistics
Ph. D. in Mathematics
University of Missouri--Rolla
vii, 104 pages
© 1970 Leland Ray Miller, All rights reserved.
Dissertation - Open Access
Library of Congress Subject Headings
Transportation, Automotive -- Dispatching -- Mathematical models
Traffic engineering -- Mathematical models
Print OCLC #
Electronic OCLC #
Link to Catalog Recordhttp://laurel.lso.missouri.edu/record=b1066967~S5
Miller, Leland Ray, "Heuristic algorithms for the generalized vehicle dispatch problem" (1970). Doctoral Dissertations. 2185.