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

Communications

Peter Matis¹ 

[1] Department of Transport Systems, Faculty of Managements and Informatics, University of Zilina, Slovakia;

关键词: srp;    vrp;    gis;    heuristics;    approximations;   

DOI  :  10.26552/com.C.2009.3.20-24

来源: DOAJ

【 摘 要 】

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.

【 授权许可】

Unknown