Application of Multi-Criteria Shortest Path to a Customizable Hex-Map Environment.

摘要

The shortest path problem of finding the optimal path through a complex network is well-studied in the field of operations research. This research presents an application of the shortest path problem to a customizable map with terrain features and enemy engagement risk. The PathFinder model developed represents the next step in the evolution of the Metz model built by Frawley, which is fashioned after the WWII-inspired war game, "Drive on Metz," that recreates the American advance on multiple German units over limited terrain. This original approach implements Dijkstra's Algorithm to find the optimal path with two competing user-defined priorities (distance and combat risk) and a static terrain element. The PathFinder model builds upon this foundation by improving the efficiency of the path-finding algorithm and adding the capability to define map terrain and assign a priority weight to identify the optimal path. This work uses Simplex designs to explore the behavior of the response surface of the multi-criteria design space. The model provides an intuitive and interactive environment for conducting analysis and basing routing decisions.