Doctoral Dissertations

Abstract

"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.

Advisor(s)

Gillett, Billy E.

Committee Member(s)

Lee, Ralph E., 1921-2010
Bain, Lee J., 1939-
Rigler, A. K.
Eckles, Robert W., 1927-

Department(s)

Mathematics and Statistics

Degree Name

Ph. D. in Mathematics

Publisher

University of Missouri--Rolla

Publication Date

1970

Pagination

vii, 104 pages

Note about bibliography

Includes bibliographical references (pages 66-67).

Rights

© 1970 Leland Ray Miller, All rights reserved.

Document Type

Dissertation - Open Access

File Type

text

Language

English

Subject Headings

Transportation, Automotive -- Dispatching -- Mathematical modelsTraffic engineering -- Mathematical modelsHeuristic algorithms

Thesis Number

T 2391

Print OCLC #

6022417

Electronic OCLC #

854564730

Download

Included in

Mathematics Commons

Share

 
COinS