VTechWorks staff will be away for the Thanksgiving holiday beginning at noon on Wednesday, November 27, through Friday, November 29. We will resume normal operations on Monday, December 2. Thank you for your patience.
 

Design and Application of Genetic Algorithms for the Multiple Traveling Salesperson Assignment Problem

Simple item page
dc.contributor.authorCarter, Arthur E.en
dc.contributor.committeechairRagsdale, Cliff T.en
dc.contributor.committeememberRees, Loren P.en
dc.contributor.committeememberCook, Deborah F.en
dc.contributor.committeememberMatheson, Lance A.en
dc.contributor.committeememberBrown, Evelyn C.en
dc.contributor.departmentManagement Science and Information Technologyen
dc.date.accessioned2014-03-14T20:10:46Zen
dc.date.adate2003-04-29en
dc.date.available2014-03-14T20:10:46Zen
dc.date.issued2003-04-21en
dc.date.rdate2004-04-29en
dc.date.sdate2003-04-25en
dc.description.abstractThe multiple traveling salesmen problem (MTSP) is an extension of the traveling salesman problem with many production and scheduling applications. The TSP has been well studied including methods of solving the problem with genetic algorithms. The MTSP has also been studied and solved with GAs in the form of the vehicle-scheduling problem. This work presents a new modeling methodology for setting up the MTSP to be solved using a GA. The advantages of the new model are compared to existing models both mathematically and experimentally. The model is also used to model and solve a multi line production problem in a spreadsheet environment. The new model proves itself to be an effective method to model the MTSP for solving with GAs. The concept of the MTSP is then used to model and solve with a GA the use of one salesman make many tours to visit all the cities instead of using one continuous trip to visit all the cities. While this problem uses only one salesman, it can be modeled as a MTSP and has many applications for people who must visit many cities on a number of short trips. The method used effectively creates a schedule while considering all required constraints.en
dc.description.degreePh. D.en
dc.identifier.otheretd-04252003-123556en
dc.identifier.sourceurlhttp://scholar.lib.vt.edu/theses/available/etd-04252003-123556/en
dc.identifier.urihttp://hdl.handle.net/10919/27258en
dc.publisherVirginia Techen
dc.relation.haspartDissertation.pdfen
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.subjectSpreadsheetsen
dc.subjectSchedulingen
dc.subjectMultiple Traveling Salesmen Problemen
dc.subjectGenetic Algorithmsen
dc.subjectArtificial Intelligenceen
dc.titleDesign and Application of Genetic Algorithms for the Multiple Traveling Salesperson Assignment Problemen
dc.typeDissertationen
thesis.degree.disciplineManagement Science and Information Technologyen
thesis.degree.grantorVirginia Polytechnic Institute and State Universityen
thesis.degree.leveldoctoralen
thesis.degree.namePh. D.en

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Dissertation.pdf
Size:
406.24 KB
Format:
Adobe Portable Document Format
Download

Collections

Doctoral Dissertations