Date of Award
2011
Publisher
North Dakota State University
Document Type
Master's Paper
Degree Awarded
Master of Science (MS)
Program
Computer Science
Department
Computer Science
College
Engineering
Faculty Advisor
Nygard, Kendall
Description
In genetic search for multi school routing, a set of commonly shared school buses and vans with capacity, travel speed and travel time limitations are used to service students from their pick up locations to their respective schools. The goal is to reduce the number of buses used, the total travel time of the students and the total operating cost of the school buses. This paper focuses on the optimization of the routes using genetic algorithm that is widely applied for combinatorial optimization problems including vehicle routing problems with time windows. The proposed genetic algorithm uses the genetic representation of routes as genes, which is then combined as chromosomes, applies appropriate genetic operators and performs chromosome evaluation. The progress of the solution is also displayed in a GUI window and the results are saved in the database for further analysis. A random set of several test problems were used to evaluate the performance of the proposed approach and encouraging results were obtained.
Recommended Citation
Ganesan, Arjun Sivaram Kumar, "Genetic Search for Multi School Routing" (2011). Computer Science. 245.
https://digitalcommons.ndsu.edu/computer-sci/245
Rights
NDSU policy 190.6.2
Rights Link
https://www.ndsu.edu/fileadmin/policy/190.pdf
Handle Identifier
https://hdl.handle.net/10365/33481