Using GIS for Optimisation in Transportation Planningby Günter Kiechle The use of Geographic Information Systems (GIS) for preparing input data for optimisation algorithms improves the practical applicability of such algorithms in the field of transportation planning. This promising combination of technologies is the subject of a collaboration between the University of Vienna and Salzburg Research. Vehicle Routing Problems (VRPs) are a widely investigated class of problems in combinatorial optimisation, and include many transportation tasks (eg parcel services). In general, a VRP consists of a set of customers that must be served via a fleet of vehicles, each of which leaves from and returns to a central depot. The type of VRP determines whether customers have goods delivered to them, are transported from one location to another, or are served in some other way. Using GIS for Real-World Input Data Essential input data for real-world VRPs is gathered by using Geographic Information Systems (GIS). Whereas most researchers use Euclidean distances between customers and depots for their optimisation algorithms, a GIS can provide real distance information derived from a digital road network. Experiences in former projects showed that using distance data of limited quality in optimisation algorithms leads to results of even more limited quality. In the worst case, a valid solution for a given input dataset might actually be unfeasible in reality. To get distance information of sufficient quality, the most detailed street network commercially available for the considered region should be used. Unfortunately static distance information from a digital road network does not correlate directly with real travel times because of dynamic influences like traffic jams, road works and weather conditions. Travel times also depend on parameters such as driving style and vehicle type, which are particularly hard to quantify. Empirical Evaluation of Travel Times
Table 1: Deviation of driving times in minutes
This analysis comprised trips to more than forty locations carried out by more than twenty drivers on several days and at all times of day. All the vehicles were of the same type and were able to exceed the allowed speed limit on all the roads used. These results enable us to specify safety margins that are suitable to counteract these observed variations in driving time. The results of this evaluation were used to define reasonable buffer values for optimisation procedures in order to achieve highly robust solutions for use in practical scenarios. Integration of GIS and Optimisation ![]() Figure 1: Component diagram. The system works as follows: after retrieving customer coordinates and other relevant data from the CRM-Application, the Front-End uses the Network Toolbox to obtain a distance matrix containing travel times for all possible customer pairs. The Front-End forwards all information to the Optimisation Module, which applies the optimisation algorithm. Resulting tours are returned to the Front-End and given a geographical representation using the Network Toolbox. Finally, a complete list of travel plans including customers, street paths and visiting order for the requested period of time may be generated and presented to the application user. Implementing the Optimisation Algorithm Real World VRP Example ![]() Figure 2: User interface of a decision support system for transportation planning. Please contact: |
|||||||||||










