Optimization Algorithms for Subway Challenge

The Subway Challenge is an open record put out by the Guinness World Records Company. The goal of the challenge is to visit all 472 stations on the New York City Subway System in the shortest amount of time. We transformed the New York Subway System into a representation that a computer can solve. We then ran a couple different solvers on our representation: Nearest Neighbor Search and Ant Colony Optimizer. Through trial and error, we found multiple tours that beat the world record.

Poster can be found here: https://designday.jhu.edu/wp-content/uploads/formidable/6/SubwayChallengePosterv4-2.pdf

I was featured in the HUB! https://hub.jhu.edu/2022/04/29/students-wrap-up-design-day-projects/

I was a featured project for the 2022 Design Day: https://designday.jhu.edu/wp-content/uploads/2022/04/2022-wse-design-day-program.pdf