Genetic Algorithm for Finding Maximum k-Distinct Lattice Paths
Level of Education of Students Involved
Dr. Rick Gillman
Arts and Sciences
Computer Science, Maths
This research employs a genetic algorithm to efficiently identify maximum sets of k-distinct lattice paths, which can be used in optimizing solutions for scheduling problems, routing problems, and data transmission in network systems. Building upon the previous work by Gillman et al., our method overcomes the computational limitations of traditional brute-force techniques, providing a more effective approach. The adaptability and potential of our methodology in tackling various optimization problems make it a valuable foundation for future research and applications.
Ateufack Zeudom, Ariel Fayol, "Genetic Algorithm for Finding Maximum k-Distinct Lattice Paths" (2023). Symposium on Undergraduate Research and Creative Expression (SOURCE). 1176.