Genetic Algorithm for Finding Maximum k-Distinct Lattice Paths

Level of Education of Students Involved


Faculty Sponsor

Dr. Rick Gillman


Arts and Sciences


Computer Science, Maths

ORCID Identifier(s)


Presentation Type

Poster Presentation

Symposium Date

Spring 4-27-2023


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.

Biographical Information about Author(s)

As an AI enthusiast, my background includes a strong foundation in computer science, mathematics, and programming, which has driven my passion for exploring the potential applications of artificial intelligence. Throughout my educational journey, I have gained expertise in various AI techniques, including machine learning, deep learning, and evolutionary algorithms such as genetic algorithms.

The selection of this project was motivated by my fascination with optimization problems and their real-world implications.

This document is currently not available here.