Show simple item record

dc.contributor.authorGanesan, Arjun Sivaram Kumar
dc.description.abstractIn 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.publisherNorth Dakota State Universityen_US
dc.rightsNDSU policy 190.6.2en_US
dc.titleGenetic Search for Multi School Routingen_US
dc.typeMaster's Paperen_US
dc.date.accessioned2023-12-29T17:32:06Z
dc.date.available2023-12-29T17:32:06Z
dc.date.issued2011
dc.identifier.urihttps://hdl.handle.net/10365/33481
dc.subject.lcshVehicle routing problem.en_US
dc.subject.lcshGenetic algorithms.en_US
dc.subject.lcshSchool children -- Transportation -- Management -- Computer programs.en_US
dc.rights.urihttps://www.ndsu.edu/fileadmin/policy/190.pdfen_US
ndsu.degreeMaster of Science (MS)en_US
ndsu.collegeEngineeringen_US
ndsu.departmentComputer Scienceen_US
ndsu.programComputer Scienceen_US
ndsu.advisorNygard, Kendall


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record