dc.contributor.author | Ganesan, Arjun Sivaram Kumar | |
dc.description.abstract | 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. | en_US |
dc.publisher | North Dakota State University | en_US |
dc.rights | NDSU policy 190.6.2 | en_US |
dc.title | Genetic Search for Multi School Routing | en_US |
dc.type | Master's Paper | en_US |
dc.date.accessioned | 2023-12-29T17:32:06Z | |
dc.date.available | 2023-12-29T17:32:06Z | |
dc.date.issued | 2011 | |
dc.identifier.uri | https://hdl.handle.net/10365/33481 | |
dc.subject.lcsh | Vehicle routing problem. | en_US |
dc.subject.lcsh | Genetic algorithms. | en_US |
dc.subject.lcsh | School children -- Transportation -- Management -- Computer programs. | en_US |
dc.rights.uri | https://www.ndsu.edu/fileadmin/policy/190.pdf | en_US |
ndsu.degree | Master of Science (MS) | en_US |
ndsu.college | Engineering | en_US |
ndsu.department | Computer Science | en_US |
ndsu.program | Computer Science | en_US |
ndsu.advisor | Nygard, Kendall | |