Loading...
Please wait, while we are loading the content...
Similar Documents
Spatial Transformation of Equality – Generalized Travelling Salesman Problem to Travelling Salesman Problem
| Content Provider | Directory of Open Access Journals (DOAJ) |
|---|---|
| Author | Mohammed Zia Dursun Zafer Seker Ziyadin Cakir |
| Abstract | The Equality-Generalized Travelling Salesman Problem (E-GTSP), which is an extension of the Travelling Salesman Problem (TSP), is stated as follows: given groups of points within a city, like banks, supermarkets, etc., find a minimum cost Hamiltonian cycle that visits each group exactly once. It can model many real-life combinatorial optimization scenarios more efficiently than TSP. This study presents five spatially driven search-algorithms for possible transformation of E-GTSP to TSP by considering the spatial spread of points in a given urban city. Presented algorithms are tested over 15 different cities, classified by their street-network's fractal-dimension. Obtained results denote that the R-Search algorithm, which selects the points from each group based on their radial separation with respect to the start–end point, is the best search criterion for any E-GTSP to TSP conversion modelled for a city street network. An 8.8% length error has been reported for this algorithm. |
| Related Links | http://www.mdpi.com/2220-9964/7/3/115 |
| e-ISSN | 22209964 |
| DOI | 10.3390/ijgi7030115 |
| Journal | ISPRS International Journal of Geo-Information |
| Issue Number | 3 |
| Volume Number | 7 |
| Language | English |
| Publisher | MDPI AG |
| Publisher Date | 2018-01-01 |
| Publisher Place | Switzerland |
| Access Restriction | Open |
| Subject Keyword | Geography (general) Generalized Travelling Salesman Problem Shortest Route Combinatorial Optimization Openstreetmap |
| Content Type | Text |
| Resource Type | Article |