Chinese Postman Problem Research Abstract
Location
Ada, Ohio
Start Date
3-12-2024 12:00 AM
End Date
3-12-2024 12:00 AM
Description
In this research project, solutions to the Chinese Postman problem are created by a genetic algorithm and evaluated using a custom program. For this research project, it was decided that a routing problem could be an interesting challenge to explore. The Chinese Postman problem was chosen as it poses a real challenge faced in the modern world, but it is more complicated as it requires an algorithm to find the shortest possible path which visits every edge in an undirected graph. In this project, a genetic algorithm has been set up using Pymoo to produce an array of integers which correspond to each node in the graph, which when traversed in order produces a route for that solution. This output is regenerated with additional feedback to the algorithm, causing the algorithm to slowly trend towards the most optimal solution. Outputs are checked to ensure that the solutions are valid and minimize the distance that must be traveled. So far, testing has shown that the project has been able to evaluate the solutions generated by the algorithm so that eventually the algorithm produces a valid solution to the given problem. Having a system to produce and evaluate solutions to the Chinese Postman problem could be useful for applications such as delivery services which need to find an efficient route for delivering goods to every location in an area.
Recommended Citation
Freer, Samuel, "Chinese Postman Problem Research Abstract" (2024). College of Engineering Student Research Colloquium. 16.
https://digitalcommons.onu.edu/eng_student_research_colloquium/2024/Presentations/16
Chinese Postman Problem Research Abstract
Ada, Ohio
In this research project, solutions to the Chinese Postman problem are created by a genetic algorithm and evaluated using a custom program. For this research project, it was decided that a routing problem could be an interesting challenge to explore. The Chinese Postman problem was chosen as it poses a real challenge faced in the modern world, but it is more complicated as it requires an algorithm to find the shortest possible path which visits every edge in an undirected graph. In this project, a genetic algorithm has been set up using Pymoo to produce an array of integers which correspond to each node in the graph, which when traversed in order produces a route for that solution. This output is regenerated with additional feedback to the algorithm, causing the algorithm to slowly trend towards the most optimal solution. Outputs are checked to ensure that the solutions are valid and minimize the distance that must be traveled. So far, testing has shown that the project has been able to evaluate the solutions generated by the algorithm so that eventually the algorithm produces a valid solution to the given problem. Having a system to produce and evaluate solutions to the Chinese Postman problem could be useful for applications such as delivery services which need to find an efficient route for delivering goods to every location in an area.