Masters Theses

Abstract

"The Vehicle Routing Problem is an NP-complete problem that has been studied extensively since it was introduced in 1958 by G. B. Dantzig and J. H. Ramser. This thesis creates three algorithms that endeavor to find an optimal solution for each problem tested. Two of the algorithms (Simulated Annealing and Tabu Search) have been used previously to solve this problem. These two solution methods are revisited to discover whether a new approach to creating routes will produce the best-known optimal values every time. New routes are created by forming route neighborhoods and then selecting cities from these neighborhoods for insertion. The third algorithm is an original algorithm which combines Simulated Annealing and Tabu Search. The algorithms presented do not produce the best-known optimal values, but are competitive with previously published algorithms"--Abstract, page iii.

Advisor(s)

Gillett, Billy E.

Committee Member(s)

Erçal, Fikret
Bain, Lee J., 1939-

Department(s)

Computer Science

Degree Name

M.S. in Computer Science

Comments

A report which is substantially this thesis is available here for download.

Publisher

University of Missouri--Rolla

Publication Date

Fall 1993

Pagination

vii, 31 pages

Note about bibliography

Includes bibliographical references (pages 29-30).

Rights

© 1993 Jeffrey Dale White, All rights reserved.

Document Type

Thesis - Restricted Access

File Type

text

Language

English

Thesis Number

T 6665

Print OCLC #

30017420

Download
Off-campus S&T users

Share My Thesis 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.

Share

 
COinS