EdFred
Taxi to Parking
Why? Never heard of a hotel, or airplane camping?
If you're retired, or took a month off, why do you have to return home after every couple airports?
Travelling Salesman problem- airport passport programs.
- Thread starter Ozone
- Start date
Why? Never heard of a hotel, or airplane camping?
If you're retired, or took a month off, why do you have to return home after every couple airports?
Crashnburn
Pattern Altitude
Considering there is only 1 even prime, and it's the second loneliest number.I said “not different, not “not difficult.” Meaning that the third dimension of doing it with airplanes is the same fundamental problem as the original from what I think was called CS240 when I took it. It’s just a matter of calculating optimum altitude between airport pairs (optimize for time, fuel consumption, or any other variable of your choosing) and then using the optimized variable instead of distance when you run your traveling salesman algorithm. Adding an O(n^2) step to an O(n!) algorithm isn’t that big of a deal. (Actually I think traveling salesman can be written faster than O(n!) but that doesn’t change my point. It’s just been a long time so I’m thinking in O(n!) terms for the sake of discussion.)
And, as I said, it’s trivial for the set of even primes, with a well-known algorithm that runs in O(1).
- Joined
- Jul 10, 2019
- Messages
- 1,268
- Display Name
Display name:
Initial Fix
I see what you did there.
Crashnburn
Pattern Altitude
A number of years ago I took a Data Structures and Algorithms class in Java. One of the assignments was the Traveling Salesman problem.
Later, I decided I wanted something similar, but in Python, for optimizing my flight simulation goal of flying to every airport in the world. I quickly discovered that it was O(N!). I optimized it a bit. As the trial path was computed, as soon as it was longer than the shortest path so far, that trial was terminated.
Also, I made it open jaw, so the start and finish airports could be different. That way, I could enter a block of airports on one side, optimally visit the airports in that group, and finish close to the next group of airports. Thus, the runtime would be M*O(N!) instead of O((M*N)!) Where M is the number of airport groups, and N is the number of airports in the group.
My version of Python is single threaded. If I rewrite the program, it will be in C++, which supports multi-threading. That should speed things up, but probably not by the number of threads supported.
I also wrote a program that converts differences in Lat/Long into distances. Crossing the International Date line requires some care, but as far as I could tell, I did it correctly. I never could get the bearing calculations to work correctly, but FSX:SE's flight planner gave the correct bearings.
Later, I decided I wanted something similar, but in Python, for optimizing my flight simulation goal of flying to every airport in the world. I quickly discovered that it was O(N!). I optimized it a bit. As the trial path was computed, as soon as it was longer than the shortest path so far, that trial was terminated.
Also, I made it open jaw, so the start and finish airports could be different. That way, I could enter a block of airports on one side, optimally visit the airports in that group, and finish close to the next group of airports. Thus, the runtime would be M*O(N!) instead of O((M*N)!) Where M is the number of airport groups, and N is the number of airports in the group.
My version of Python is single threaded. If I rewrite the program, it will be in C++, which supports multi-threading. That should speed things up, but probably not by the number of threads supported.
I also wrote a program that converts differences in Lat/Long into distances. Crossing the International Date line requires some care, but as far as I could tell, I did it correctly. I never could get the bearing calculations to work correctly, but FSX:SE's flight planner gave the correct bearings.
- Joined
- Jul 10, 2019
- Messages
- 1,268
- Display Name
Display name:
Initial Fix
As much as I like working out the math, someone already did it for us in the Aviation Formulary.
https://edwilliams.org/avform.htm
Pinecone
En-Route
Because MOST people are not retired, can't take off a month, and wouldn't spend the money for the hotels.
But then you would have to add in the factor of airports with close by hotels and possibly courtesy cars to end up at the end of each day. And deal with how many airports you can do each day.
Crashnburn
Pattern Altitude
Thanks. I wrote the program before I knew about POA.
corsaircrusader
Filing Flight Plan
- Joined
- Feb 15, 2023
- Messages
- 4
- Display Name
Display name:
corsaircrusader
I don't have maps, but I do have a script in R that can solve the TSP problem (within less than or equal to twice the optimal length of the tour). With a bit more effort (maybe I'll come back to it later), one could extend this to produce some maps/graphics. You can download the dataset that this script uses from OurAirports dot com. You can download R and Rstudio from CRAN and Posit, respectively, to execute the script. There are R online interpreters, but most likely they won't let you install the packages you need to run this script. You can lookup the theory behind the heurstic algorithms by reading the vignette for the TSP package on CRAN (just search CRAN TSP, click on the link, halfway down that ugly text page will be a thing called "vignette" that you can click on that will open a PDF that explains all the math and such).
Feel free to customize the filter to pick which airports you want to find the best route for. Calculating the distance matrix has quadratic space complexity, so you can eat up hundreds of gigabytes of RAM pretty quickly if you have more than say 10,000 airports in the list (I ran out of memory trying to do all airports in the U.S. anyways, and I have 64 Gigs; there are probably more efficient implementations for calculating the distance matrix, though they may not be compatible with the TSP package). Memory usage also scales based on the number of CPU cores you throw at the problem (each core has to have a copy of the data). By the way, the code will max out your CPU if you let it, so feel free to reduce the number of iterations (which may reduce how optimal the result is) or the number of CPUs to match your machine.
I can't post links yet, so below are screenshots, followed by the pasting of the code. In this example, I calculated the route of all open airports, balloonports, and heliports in Arkansas which have a GPS code (per the data source).
# install.packages(c("TSP", "dplyr", "data.table", "geosphere", "doParallel"))
library(TSP)
library(dplyr)
library(data.table)
library(geosphere)
library(doParallel)
iterations <- 100
numCores <- 16
registerDoParallel(cl = numCores)
airports <- fread("I'm not allowed to post links yet")
desired_airports <- airports %>% filter(type != "closed",
iso_country == "US",
iso_region == "US-AR",
ident != "",
gps_code != "")
distance_matrix <- as.matrix(distm(desired_airports %>% select(longitude_deg, latitude_deg))) / 1000 # convert meters to kilometers
rownames(distance_matrix) <- desired_airports$ident
colnames(distance_matrix) <- desired_airports$ident
methods <- c("nearest_insertion", "cheapest_insertion", "farthest_insertion", "arbitrary_insertion",
"nn", "repetitive_nn", "two_opt")
distTSP <- as.TSP(distance_matrix)
solutions <- lapply(methods, function(m) solve_TSP(distTSP, method = m, two_opt = T, rep = numCores*iterations))
stopImplicitCluster()
tour_lengths <- sapply(solutions, tour_length)
best_solution <- solutions[[which(tour_lengths == min(tour_lengths))]]
print(best_solution)
best_airport_route <- labels(best_solution)
Feel free to customize the filter to pick which airports you want to find the best route for. Calculating the distance matrix has quadratic space complexity, so you can eat up hundreds of gigabytes of RAM pretty quickly if you have more than say 10,000 airports in the list (I ran out of memory trying to do all airports in the U.S. anyways, and I have 64 Gigs; there are probably more efficient implementations for calculating the distance matrix, though they may not be compatible with the TSP package). Memory usage also scales based on the number of CPU cores you throw at the problem (each core has to have a copy of the data). By the way, the code will max out your CPU if you let it, so feel free to reduce the number of iterations (which may reduce how optimal the result is) or the number of CPUs to match your machine.
I can't post links yet, so below are screenshots, followed by the pasting of the code. In this example, I calculated the route of all open airports, balloonports, and heliports in Arkansas which have a GPS code (per the data source).
# install.packages(c("TSP", "dplyr", "data.table", "geosphere", "doParallel"))
library(TSP)
library(dplyr)
library(data.table)
library(geosphere)
library(doParallel)
iterations <- 100
numCores <- 16
registerDoParallel(cl = numCores)
airports <- fread("I'm not allowed to post links yet")
desired_airports <- airports %>% filter(type != "closed",
iso_country == "US",
iso_region == "US-AR",
ident != "",
gps_code != "")
distance_matrix <- as.matrix(distm(desired_airports %>% select(longitude_deg, latitude_deg))) / 1000 # convert meters to kilometers
rownames(distance_matrix) <- desired_airports$ident
colnames(distance_matrix) <- desired_airports$ident
methods <- c("nearest_insertion", "cheapest_insertion", "farthest_insertion", "arbitrary_insertion",
"nn", "repetitive_nn", "two_opt")
distTSP <- as.TSP(distance_matrix)
solutions <- lapply(methods, function(m) solve_TSP(distTSP, method = m, two_opt = T, rep = numCores*iterations))
stopImplicitCluster()
tour_lengths <- sapply(solutions, tour_length)
best_solution <- solutions[[which(tour_lengths == min(tour_lengths))]]
print(best_solution)
best_airport_route <- labels(best_solution)
Attachments
- Joined
- Jul 17, 2019
- Messages
- 1,933
- Location
- Chicago suburbs
- Display Name
Display name:
The Little Arrow That Could
corsaircrusader
Filing Flight Plan
- Joined
- Feb 15, 2023
- Messages
- 4
- Display Name
Display name:
corsaircrusader
jkjk!
I wish you had a python version I could tinker with
There might be a Python package out there that can do this (python-tsp, for example)! The nice thing about R is that you can call Python code from within it using the reticulate package (and you can send R objects to Python, do computations on it, and then pull Python objects back into R, and do computations on that, all within a single script, pretty seamlessly). I don't know if there is an equivalent to the reticulate package in Python, though (which one would think is possible since the package exists for inter-operability). In this case, the R package geosphere and TSP are doing all the hard work (for calculating the distance matrix from lat/long points and solving the TSP problem, respectively), and those packages may have underlying implementations in C++, RCpp, and/or Fortran.
corsaircrusader
Filing Flight Plan
- Joined
- Feb 15, 2023
- Messages
- 4
- Display Name
Display name:
corsaircrusader
Edit: The below code assumes Euclidean distance, which does not scale well when the curvature of the Earth becomes a significant factor. The code above does not have this problem (it calculates distance on the ellipsoid WGS84, which is the best global ellipsoid overall at present per the documentation (but not the optimal in all places of the Earth)).
It turns out it is fairly easy to modify my earlier script to produce a plot. Still doesn't have several features I would like to see, such as labels on the points, a map of the world behind it, or is interactive so you can zoom in and out, but I'm sure it's all solvable (probably with ggplot2 or as a Shiny app). Here are two such plots (remember, the heuristics have random components). Coordinates are latitude and longitude for y and x, respectively.
Updated code is below.
It turns out it is fairly easy to modify my earlier script to produce a plot. Still doesn't have several features I would like to see, such as labels on the points, a map of the world behind it, or is interactive so you can zoom in and out, but I'm sure it's all solvable (probably with ggplot2 or as a Shiny app). Here are two such plots (remember, the heuristics have random components). Coordinates are latitude and longitude for y and x, respectively.
Updated code is below.
Code:
library(TSP)
library(dplyr)
library(data.table)
library(geosphere)
library(doParallel)
numCores <- 8
iterations <- numCores * 200
registerDoParallel(cl = numCores)
airports <- fread("https://davidmegginson.github.io/ourairports-data/airports.csv")
desired_airports <- airports %>% filter(type != "closed",
iso_country == "US",
iso_region == "US-AR",
ident != "",
gps_code != "",
gps_code != "5AK4") # airport misclassified, should be in US-AK
etsp <- as.ETSP(data.frame(x = desired_airports$longitude_deg,
y = desired_airports$latitude_deg,
row.names = desired_airports$gps_code))
#distance_matrix <- as.matrix(distm(desired_airports %>% select(longitude_deg, latitude_deg))) / 1000 # convert meters to kilometers
#rownames(distance_matrix) <- desired_airports$gps_code
#colnames(distance_matrix) <- desired_airports$gps_code
methods <- c("nearest_insertion", "cheapest_insertion", "farthest_insertion", "arbitrary_insertion",
"nn", "repetitive_nn", "two_opt")
#distTSP <- as.TSP(distance_matrix)
#solutions <- lapply(methods, function(m) solve_TSP(distTSP, method = m, two_opt = T, rep = iterations))
solutions <- lapply(methods, function(m) solve_TSP(etsp, method = m, two_opt = T, rep = iterations))
stopImplicitCluster()
tour_lengths <- sapply(solutions, tour_length)
best_solution <- solutions[[which(tour_lengths == min(tour_lengths))]]
print(best_solution)
best_airport_route <- labels(best_solution)
print(best_airport_route)
plot(etsp, best_solution, tour_col = "red")
Last edited:
jkjk!
I wish you had a python version I could tinker with
Java:
https://www.javatpoint.com/travelling-salesman-problem-in-java
Python & C++
https://www.guru99.com/travelling-salesman-problem.html
bflynn
Final Approach
Hyde Field (W32) has closed, a victim of the FRZ.
Well, it's a victim of a lot of things. The FRZ didn't help.
In the '90s, I heard that there was a guy who embarked on a project to fly 40 instrument approaches on his 40th birthday. I bet he was real tired when he got done with that!
Pinecone
En-Route
Years ago I hit all the airports in Delaware in one trip. Wasn't even a long one!
Sadly, they didn't have a passport program though.
What, all 5 of them????
Pinecone
En-Route
True, but who would/could take the time to hit 100 airports in one long trip?
MD is only 33, so not too bad.
Pinecone
En-Route
I used to fly out of there for helicopter training. It was a nice airport. I hear, later it was worse than Laurel.
EdFred
Taxi to Parking
I've done 6 in about 90 minutes without dropping the gear and flying at cruise speed. Runway heading lines me up with next IAF, so I'm being pretty efficient. Can't imagine do that 6 more times.
I was based at VKX for years prior to 9/11. W32 was pretty decrepit then. They had to mow the (paved) runway to keep the weeds at bay. Not much in the way of services. The only thing that kept it alive toward the end was Stan Fetter who operated is traffic reporting business out of there.
bflynn
Final Approach
What, all 5 of them????
10 public use airports in reality. Even Rhode Island has 7.
N06 - Laurel
IGL - New Castle
GED - Delaware Coastal
EVY - Summit
D74 - Chorman
38N - Smyrna
33N - Delaware Airpark
15N - Jenkins
0N6 - Albanna Aviation
0N4 - Chandelle
The smallest - Chandelle is just 2500 x 28'...I try to avoid runways narrower than my wingspan.
RussR
En-Route
What, all 5 of them????
Yep, all 10. Touch and go on some, full stop taxi back on others. Chandelle stands out because it has (or had) a tree right off the departure end on centerline.
I think Jenkins was the "roughest", just a little grass runway with what looked like aircraft in various stages of decay and salvage along the sides. Like an airplane graveyard.
It's been 18 years but some things still stand out!
corsaircrusader
Filing Flight Plan
- Joined
- Feb 15, 2023
- Messages
- 4
- Display Name
Display name:
corsaircrusader
So, while my code produces a route and doesn't really graph it, SkyVector can give you a graph pretty easily once you have a list of airport IDs. You can take the output of my code, select the gps_code column, and print it with each code on a newline (solution %>% select(gps_code) %>% pull %>% cat(sep="\n")), then paste that into SkyVector's flightplan and hit Enter. For example, a route of all open airports in Texas which have scheduled service or are large or or are medium and either have a homepage or Wikipedia link, is shown below. (Note that I solved all Texas airports and then filtered to this list, and a subset of a solution of a Traveling Salesman Problem is not guaranteed to be optimal due to the multi-dimensionality of the problem, not to mention my code uses a heuristic so it can work at scale so the solution isn't optimal to begin with, so there's some weird behavior in this example routing).
