Doctoral Dissertations


"A heuristic algorithm is developed for solving the multi-terminal vehicle dispatch problem. The demand points are first assigned to terminals using a scheme that minimizes the cost of each assignment. Single-terminal vehicle dispatch problems are then solved at each terminal using a heuristic procedure, called the Sweep Algorithm. A sequence of trial reassignments are then attempted in order to obtain further improvements in the overall solution. Eleven multi-terminal vehicle dispatch problems are presented and their solutions, derived by this procedure, are given.

Several changes are also proposed for the Sweep Algorithm in order to improve the solutions obtained and to decrease the computing time required. The effects of using different traveling salesman algorithms in the Sweep Algorithm are studied. Two recently published traveling salesman procedures as well as the one previously used in the Sweep Algorithm are compared. One of these new approaches, the Lin-Kernighan algorithm, is found to perform significantly better for routes with a large number of demand points, than the method previously used. Single-terminal vehicle dispatch problems are solved, and comparisons with the results of other single-terminal algorithms are presented"--Abstract, page ii.


Gillett, Billy E.

Committee Member(s)

Byers, James K.
Stigall, Paul D.
Grimm, L. J.
Bain, Lee J., 1939-


Mathematics and Statistics

Degree Name

Ph. D. in Mathematics


University of Missouri--Rolla. Department of Computer Science


University of Missouri--Rolla

Publication Date



viii, 184 pages

Note about bibliography

Includes bibliographical references (pages 78-79).


© 1975 Jerry George Johnson, All rights reserved.

Document Type

Dissertation - Restricted Access

File Type




Library of Congress Subject Headings

Transportation, Automotive -- Dispatching -- Mathematical models
Heuristic programmin

Thesis Number

T 3036

Print OCLC #


Electronic OCLC #


Link to Catalog Record

Electronic access to the full-text of this document is restricted to Missouri S&T users. Otherwise, request this publication directly from Missouri S&T Library or contact your local library.

Share My Dissertation If you are the author of this work and would like to grant permission to make it openly accessible to all, please click the button above.