Finding Optimal Travel Routes with Uncertain Cost Data. Issue 2 (9th October 2012)

• Record Type: Journal Article
• Authors: Dean, Denis J.
• Is Part Of: Transactions in GIS. Volume 17:Issue 2(2013:Apr.)
• Page Start: 159
• Page End: 181
• Publication Date: 2012-10-09
• Subjects: Geographic information systems -- Periodicals; 910.285
• DOI: 10.1111/j.1467-9671.2012.01360.x
• Languages: English
• ISSNs: 1361-1682

Abstract

<abstract abstract-type="main"> <title>Abstract</title> <p>Geospatial data analysis techniques are widely used to find optimal routes from specified starting points to specified destinations. Optimality is defined in terms of minimizing some impedance value over the length of the route – the value to be minimized might be distance, travel time, financial cost, or any other metric. Conventional analysis procedures assume that impedance values of all possible travel routes are known <italic>a priori</italic>, and when this assumption holds, efficient solution strategies exist that allow truly optimal solutions to be found for even very large problems. When impedance values are not known with certainty <italic>a priori</italic>, exact solution strategies do not exist and heuristics must be employed. This study evaluated how the quality of the solutions generated by one such heuristic were impacted by the nature of the uncertainty in the cost database, the nature of the costs themselves, and the parameters used in the heuristic algorithm. It was found that all of these factors influenced the qualities of the solutions produced by the heuristic, but encouragingly, an easily controlled parameter of the heuristic algorithm itself played the most important role in controlling solution quality.</p> </abstract>