Paper 78

Proc Optgraph, the Traveling Salesman Problem and Map Drawing with the Annotation Dataset

September 23, 2025: 8:30 AM - 9:00 AM

Visualizations and Reporting (VR), Executive Dining Room #2

Authors	Abstract
Caleb Greski, Joe DeMaio	Many people, such as Superbowl winning quarterbacks, celebrate success in life by saying “I’m going to Disneyland!”. What do you do once you get there? I doubt you want to spend lots of time waiting in line. Perhaps there is an optimized order in which to visit rides and attractions to minimize line wait time. This is known as the Traveling Salesman Problem (TSP). In this paper we demonstrate how to use the Optgraph Procedure in SAS to compute a route for our travelling salesman and construct a visualization of said tour on a map. Using the annotation data set feature allows us to design graphical displays of TSPs which overlay the optimized path on top of any relevant images, such as a map designed by a graphic designer, or a chess board.

Caleb Greski, Joe DeMaio

Many people, such as Superbowl winning quarterbacks, celebrate success in life by saying “I’m going to Disneyland!”. What do you do once you get there? I doubt you want to spend lots of time waiting in line. Perhaps there is an optimized order in which to visit rides and attractions to minimize line wait time. This is known as the Traveling Salesman Problem (TSP). In this paper we demonstrate how to use the Optgraph Procedure in SAS to compute a route for our travelling salesman and construct a visualization of said tour on a map. Using the annotation data set feature allows us to design graphical displays of TSPs which overlay the optimized path on top of any relevant images, such as a map designed by a graphic designer, or a chess board.