This implements a 2-opt algorithim to solve the traveling salesman, or time builder, problem and create an optimized path between airports. Enter a list of airport codes and choose whether or not you want it to close the route back to the first airport in the list. Unknown or non-airport codes will be removed from the list. This type of optimization is inherently slow and computationally expensive, so about 180 stops is where it starts to get ridiculously slow. If you need to do more stops, do it in chunks, or... don't do it at all.
Examples: All Minnesota Passport Airports | All Wisconsin Passport Airports | All Florida Airports