Heuristics for the Solution of a Very Large Street Routing Problem with Mixed Transportation Mode

  • Peter Matis
Keywords: SRP, VRP, GIS, heuristics, approximations

Abstract

Servicing a large number of customers in a city zone is often a considerable part of many logistics chains. This problem is called a Street Routing Problem (SRP). As presented, only using systems such as Geographical Information Systems (GIS) it is possible to effectively manage SRP. New heuristic for solving a very large SRP is evaluated on the real data. One of the key properties of GIS for use with the routing software is its flexible interactive and user-friendly environment. The paper presents several approximations of length for SRP with mixed transportation mode.

Author Biography

Peter Matis

Department of Transport Systems, Faculty of Managements and Informatics, University of Zilina, Slovakia

Published
2009-09-30
How to Cite
Matis, P. (2009). Heuristics for the Solution of a Very Large Street Routing Problem with Mixed Transportation Mode. Communications - Scientific Letters of the University of Zilina, 11(3), 20-24. Retrieved from http://journals.uniza.sk/index.php/communications/article/view/1001
Section
Articles