A New Spatial Approach for Efficient Transformation of Equality - Generalized TSP to TSP

A New Spatial Approach for Efficient Transformation of
Equality - Generalized TSP to TSP
Mohammed Zia
PhD in Geomatics Engineering
Istanbul Technical University, Turkey18th August 2017
TSP or Travelling Salesman Problem?
TSP or Travelling Salesman Problem
TSP or Travelling Salesman Problem
TSP or Travelling Salesman Problem
TSP or Travelling Salesman Problem
1
2
3
4
5
9999 24 45 56 98
24 9999 10 24 32
45 10 9999 65 54
56 24 65 9999 100
98 32 54 100 9999
1 2 3 4 5
1
2
3
4
5
Cost Matrix
Equality Generalized Travelling Salesman Problem?
Equality Generalized Travelling Salesman Problem
Equality Generalized Travelling Salesman Problem
Cost Matrix
nth
nth
Equality Generalized Travelling Salesman Problem
Solution?
Equality Generalized Travelling Salesman Problem
Solution?
Brute Force Heuristic Methods
Equality Generalized Travelling Salesman Problem
Heuristic Solution
Equality Generalized Travelling Salesman Problem Instance
Clustered Travelling Salesman Problem Instance
Travelling Salesman Problem Instance
SOLUTION
Reduce to
Reduce to
Solve TSP
Derive Solution
Equality Generalized Travelling Salesman Problem
Heuristic Solution
Charles E. Noon and James C. Bean, February 1993, An Efficient
Transformation Of The Generalized Traveling Salesman Problem, INFOR
Information Systems and Operational Research, Volume 30 (1), DOI:
10.1080/03155986.1993.11732212
What is Cost?
What is Cost?
In Vehicle Navigation Instances
1. Distance
2. Time
3. Fuel Consumption
4. Scenic Beauty
5. Any Hybrid
What is Cost?
In Vehicle Navigation Instances
1. Distance Static
2. Time Dynamic
3. Fuel Consumption Dynamic
4. Scenic Beauty Dynamic
5. Any Hybrid Static/Dynamic
Equality - Generalized TSP with Static/Dynamic Costs
?
?
? ? ?
?
?
? ? ?
?
?
Equality - Generalized TSP with Dynamic Costs
Equality Generalized Travelling Salesman Problem Instance
Clustered Travelling Salesman Problem Instance
Travelling Salesman Problem Instance
SOLUTION
Reduce to
Reduce to
Solve TSP
Derive Solution
Current Equality Generalized TSP Instance with Empty Cost Matrix
?
Equality - Generalized TSP for Vehicle Navigation
Dynamic Costs – Dynamic Data – Cost Matrix on the fly
Static Costs – Static Data – Pre-processing possible
Equality - Generalized TSP for Vehicle Navigation
2 Problems in Pre-Processing
(a) What is Distance? Dijkstra Distance / Displacement.
Equality - Generalized TSP for Vehicle Navigation
2 Problems in Pre-Processing
(a) What is Distance?
(b) Matrix size is very big Ex. Istanbul – 23,000 Amenities
Dijkstra Distance / Displacement.
Equality - Generalized TSP for Vehicle Navigation
Distance = Dijkstra Distance or Displacement?
35,000 measurements
from 210 cities
Dijkstra Distance
Displacement
Equality - Generalized TSP for Vehicle Navigation
?
?
? ? ?
?
?
? ? ?
?
?
Displacement
Equality - Generalized TSP for Vehicle Navigation
NA
NA
NA
NA
NA
NA
NA
NA
NA
NA
NA
NA NA = 9999
1 2 3 4 5 6 7 8 9 10 11 12
1
2
3
4
5
6
7
8
9
10
11
12
Equality - Generalized TSP for Vehicle Navigation
NA
NA
NA
NA
NA
NA
NA
NA
NA
NA
NA
NA NA = 9999
1 2 3 4 5 6 7 8 9 10 11 12
1
2
3
4
5
6
7
8
9
10
11
12
122 – (32 + 42 + 22 + 32)
or
𝑛2- 𝑚=1
𝑘
|𝑚|2
Equality - Generalized TSP for Vehicle Navigation
How to reduce Cost Matrix Size?
Equality - Generalized TSP for Vehicle Navigation
Equality - Generalized TSP for Vehicle Navigation
Equality - Generalized TSP for Vehicle Navigation
Equality - Generalized TSP for Vehicle Navigation
Equality - Generalized TSP for Vehicle Navigation
1
2
3
4
56
7
8
9
10
11
12
X
Y
Equality - Generalized TSP for Vehicle Navigation
1
2
3
4
56
7
8
9
10
11
12
X
Y
Equality - Generalized TSP for Vehicle Navigation
1
2
3
4
56
7
8
9
10
11
12
X
Y
Average Cost1
Average Cost3
Product Cost =
Avg. Cost1 x Avg. Cost2 x Avg. Cost3
Equality - Generalized TSP for Vehicle Navigation
Each Cluster = [Product Cost1, Product Cost2, Product Cost3, . . . . ., Product Costp]
Sorted List
Equality - Generalized TSP for Vehicle Navigation
5%
Each Cluster = [Product Cost1, Product Cost2, Product Cost3, . . . . ., Product Costp]
Sorted List
Equality - Generalized TSP for Vehicle Navigation
NA
NA
NA
NA
NA
NA
NA
NA
NA
NA
NA
NA NA = 9999
1 2 3 4 5 6 7 8 9 10 11 12
1
2
3
4
5
6
7
8
9
10
11
12
1 4 5 8 10 11
NA
NA
NA
NA
NA
NA
1
4
5
8
10
11
Equality - Generalized TSP for Vehicle Navigation
2 Problems in Pre-Processing
(a) What is Distance?
(b) Matrix size is very big Ex. Istanbul – 23,000 Amenities
Dijkstra Distance / Displacement.
Equality - Generalized TSP for Vehicle Navigation
2 Problems in Pre-Processing
(a) What is Distance?
(b) Matrix size is very big
Equality - Generalized TSP for Vehicle Navigation
GTSP Sample Instance Library
Download - http://www.cs.rhul.ac.uk/home/zvero/GTSPLIB/
Presented Approach Vs Generalized Lin–Kernighan–Helsgaun Approach
For GLKH State-of-the-Art Approach –
Keld Helsgaun, 2015, Solving the equality generalized traveling salesman
problem using the Lin–Kernighan–Helsgaun Algorithm, Mathematical
Programming Computation, Volume 7, Page 269–287, DOI 10.1007/s12532-015-
0080-8
Equality - Generalized TSP for Vehicle Navigation
Average % Standard Deviation of Cluster’s Cost
Error %
Presented
Approach
GLKH Approach
Equality - Generalized TSP for Vehicle Navigation
# of Clusters in Sample Instance
Time taken (s)
Presented
Approach
GLKH Approach
Equality - Generalized TSP for Vehicle Navigation
# of Nodes in Sample Instance
Matrix Size
Presented
Approach
GLKH Approach
Equality - Generalized TSP for Vehicle Navigation
# of Nodes in Sample Instance
Matrix Size
with value
≠ 0 or 9999 Presented
Approach
GLKH Approach
Average % Standard Deviation of Cluster’s Cost
Error %
# of Clusters in Sample Instance
Time
taken (s)
# of Nodes in Sample Instance
Matrix Size
# of Nodes in Sample Instance
Matrix Size
with value
≠ 0 or 9999
For 5%
Equality - Generalized TSP for Vehicle Navigation
Gain in Time & Space – Polynomial Order
Lose in Error – Logarithmic Order
World TSP tour
Length: 7,516,353,779km
Cities: 1,904,711
Source: http://www.math.uwaterloo.ca/tsp/world/pictures.html
Thank You!
1 of 46

Recommended

ESCC 2016, July 10-16, Athens, Greece by
ESCC 2016, July 10-16, Athens, GreeceESCC 2016, July 10-16, Athens, Greece
ESCC 2016, July 10-16, Athens, GreeceLIFE GreenYourMove
95 views14 slides
Integrating the TDBU-ETSAP models in MCP format by
Integrating the TDBU-ETSAP models in MCP formatIntegrating the TDBU-ETSAP models in MCP format
Integrating the TDBU-ETSAP models in MCP formatIEA-ETSAP
1.4K views12 slides
Genetic algorithm by
Genetic algorithmGenetic algorithm
Genetic algorithmWadea Al-Subaihi
414 views11 slides
The Concept of Problem Complexity by
The Concept of Problem ComplexityThe Concept of Problem Complexity
The Concept of Problem ComplexityAlejandro Salado
253 views35 slides
With saloni in ijarcsse by
With saloni in ijarcsseWith saloni in ijarcsse
With saloni in ijarcssesatish rana
427 views5 slides
Eeee2017 Conference - OR in the digital era - ICT challenges | Presentation by
Eeee2017 Conference - OR in the digital era - ICT challenges | PresentationEeee2017 Conference - OR in the digital era - ICT challenges | Presentation
Eeee2017 Conference - OR in the digital era - ICT challenges | PresentationChristos Papalitsas
76 views19 slides

More Related Content

Similar to A New Spatial Approach for Efficient Transformation of Equality - Generalized TSP to TSP

Particle Swarm Optimization to Solve Multiple Traveling Salesman Problem by
Particle Swarm Optimization to Solve Multiple Traveling Salesman ProblemParticle Swarm Optimization to Solve Multiple Traveling Salesman Problem
Particle Swarm Optimization to Solve Multiple Traveling Salesman ProblemIRJET Journal
52 views6 slides
Operation research model for solving TSP by
Operation research model for solving TSPOperation research model for solving TSP
Operation research model for solving TSPDrGovindshaysharma
45 views16 slides
Comparison Study of Multiple Traveling Salesmen Problem using Genetic Algorithm by
Comparison Study of Multiple Traveling Salesmen Problem using Genetic AlgorithmComparison Study of Multiple Traveling Salesmen Problem using Genetic Algorithm
Comparison Study of Multiple Traveling Salesmen Problem using Genetic AlgorithmIOSR Journals
384 views6 slides
SVD and the Netflix Dataset by
SVD and the Netflix DatasetSVD and the Netflix Dataset
SVD and the Netflix DatasetBen Mabey
20K views29 slides
A Solution Procedure To Solve Multi Objective Fractional Transportation Problem by
A Solution Procedure To Solve Multi Objective Fractional Transportation ProblemA Solution Procedure To Solve Multi Objective Fractional Transportation Problem
A Solution Procedure To Solve Multi Objective Fractional Transportation ProblemJustin Knight
4 views6 slides
paper by
paperpaper
paperHari Krishnan
93 views7 slides

Similar to A New Spatial Approach for Efficient Transformation of Equality - Generalized TSP to TSP(20)

Particle Swarm Optimization to Solve Multiple Traveling Salesman Problem by IRJET Journal
Particle Swarm Optimization to Solve Multiple Traveling Salesman ProblemParticle Swarm Optimization to Solve Multiple Traveling Salesman Problem
Particle Swarm Optimization to Solve Multiple Traveling Salesman Problem
IRJET Journal52 views
Comparison Study of Multiple Traveling Salesmen Problem using Genetic Algorithm by IOSR Journals
Comparison Study of Multiple Traveling Salesmen Problem using Genetic AlgorithmComparison Study of Multiple Traveling Salesmen Problem using Genetic Algorithm
Comparison Study of Multiple Traveling Salesmen Problem using Genetic Algorithm
IOSR Journals384 views
SVD and the Netflix Dataset by Ben Mabey
SVD and the Netflix DatasetSVD and the Netflix Dataset
SVD and the Netflix Dataset
Ben Mabey20K views
A Solution Procedure To Solve Multi Objective Fractional Transportation Problem by Justin Knight
A Solution Procedure To Solve Multi Objective Fractional Transportation ProblemA Solution Procedure To Solve Multi Objective Fractional Transportation Problem
A Solution Procedure To Solve Multi Objective Fractional Transportation Problem
Justin Knight4 views
A Review On Algorithms Used To Solve Multiple Travelling Salesman Problem by Jim Jimenez
A Review On Algorithms Used To Solve Multiple Travelling Salesman ProblemA Review On Algorithms Used To Solve Multiple Travelling Salesman Problem
A Review On Algorithms Used To Solve Multiple Travelling Salesman Problem
Jim Jimenez2 views
An improved artificial bee colony with perturbation operators in scout bees’ ... by IAESIJAI
An improved artificial bee colony with perturbation operators in scout bees’ ...An improved artificial bee colony with perturbation operators in scout bees’ ...
An improved artificial bee colony with perturbation operators in scout bees’ ...
IAESIJAI2 views
Hybrid iterated local search algorithm for optimization route of airplane tr... by IJECEIAES
Hybrid iterated local search algorithm for optimization route of  airplane tr...Hybrid iterated local search algorithm for optimization route of  airplane tr...
Hybrid iterated local search algorithm for optimization route of airplane tr...
IJECEIAES4 views
A new hybrid approach for solving travelling salesman problem using ordered c... by eSAT Journals
A new hybrid approach for solving travelling salesman problem using ordered c...A new hybrid approach for solving travelling salesman problem using ordered c...
A new hybrid approach for solving travelling salesman problem using ordered c...
eSAT Journals147 views
A COMPARISON BETWEEN SWARM INTELLIGENCE ALGORITHMS FOR ROUTING PROBLEMS by ecij
A COMPARISON BETWEEN SWARM INTELLIGENCE ALGORITHMS FOR ROUTING PROBLEMSA COMPARISON BETWEEN SWARM INTELLIGENCE ALGORITHMS FOR ROUTING PROBLEMS
A COMPARISON BETWEEN SWARM INTELLIGENCE ALGORITHMS FOR ROUTING PROBLEMS
ecij23 views
Supply chain logistics : vehicle routing and scheduling by Retigence Technologies
Supply chain logistics : vehicle  routing and  schedulingSupply chain logistics : vehicle  routing and  scheduling
Supply chain logistics : vehicle routing and scheduling
A Dynamic Logistic Dispatching System With Set-Based Particle Swarm Optimization by Rajib Roy
A Dynamic Logistic Dispatching System With Set-Based Particle Swarm OptimizationA Dynamic Logistic Dispatching System With Set-Based Particle Swarm Optimization
A Dynamic Logistic Dispatching System With Set-Based Particle Swarm Optimization
Rajib Roy109 views
The Optimizing Multiple Travelling Salesman Problem Using Genetic Algorithm by ijsrd.com
The Optimizing Multiple Travelling Salesman Problem Using Genetic AlgorithmThe Optimizing Multiple Travelling Salesman Problem Using Genetic Algorithm
The Optimizing Multiple Travelling Salesman Problem Using Genetic Algorithm
ijsrd.com1.1K views
Optimization Approach for Capacitated Vehicle Routing Problem Using Genetic A... by ijsrd.com
Optimization Approach for Capacitated Vehicle Routing Problem Using Genetic A...Optimization Approach for Capacitated Vehicle Routing Problem Using Genetic A...
Optimization Approach for Capacitated Vehicle Routing Problem Using Genetic A...
ijsrd.com646 views

Recently uploaded

Pharmaceutical Inorganic chemistry UNIT-V Radiopharmaceutical.pptx by
Pharmaceutical Inorganic chemistry UNIT-V Radiopharmaceutical.pptxPharmaceutical Inorganic chemistry UNIT-V Radiopharmaceutical.pptx
Pharmaceutical Inorganic chemistry UNIT-V Radiopharmaceutical.pptxMs. Pooja Bhandare
120 views51 slides
Collective Bargaining and Understanding a Teacher Contract(16793704.1).pptx by
Collective Bargaining and Understanding a Teacher Contract(16793704.1).pptxCollective Bargaining and Understanding a Teacher Contract(16793704.1).pptx
Collective Bargaining and Understanding a Teacher Contract(16793704.1).pptxCenter for Integrated Training & Education
96 views57 slides
Volf work.pdf by
Volf work.pdfVolf work.pdf
Volf work.pdfMariaKenney3
66 views43 slides
UNIDAD 3 6º C.MEDIO.pptx by
UNIDAD 3 6º C.MEDIO.pptxUNIDAD 3 6º C.MEDIO.pptx
UNIDAD 3 6º C.MEDIO.pptxMarcosRodriguezUcedo
139 views32 slides
GCSE Spanish by
GCSE SpanishGCSE Spanish
GCSE SpanishWestHatch
53 views166 slides
The Accursed House by Émile Gaboriau by
The Accursed House  by Émile GaboriauThe Accursed House  by Émile Gaboriau
The Accursed House by Émile GaboriauDivyaSheta
234 views15 slides

Recently uploaded(20)

Pharmaceutical Inorganic chemistry UNIT-V Radiopharmaceutical.pptx by Ms. Pooja Bhandare
Pharmaceutical Inorganic chemistry UNIT-V Radiopharmaceutical.pptxPharmaceutical Inorganic chemistry UNIT-V Radiopharmaceutical.pptx
Pharmaceutical Inorganic chemistry UNIT-V Radiopharmaceutical.pptx
Ms. Pooja Bhandare120 views
GCSE Spanish by WestHatch
GCSE SpanishGCSE Spanish
GCSE Spanish
WestHatch53 views
The Accursed House by Émile Gaboriau by DivyaSheta
The Accursed House  by Émile GaboriauThe Accursed House  by Émile Gaboriau
The Accursed House by Émile Gaboriau
DivyaSheta234 views
Narration lesson plan by TARIQ KHAN
Narration lesson planNarration lesson plan
Narration lesson plan
TARIQ KHAN64 views
EIT-Digital_Spohrer_AI_Intro 20231128 v1.pptx by ISSIP
EIT-Digital_Spohrer_AI_Intro 20231128 v1.pptxEIT-Digital_Spohrer_AI_Intro 20231128 v1.pptx
EIT-Digital_Spohrer_AI_Intro 20231128 v1.pptx
ISSIP407 views
Classification of crude drugs.pptx by GayatriPatra14
Classification of crude drugs.pptxClassification of crude drugs.pptx
Classification of crude drugs.pptx
GayatriPatra14104 views
ISO/IEC 27001 and ISO/IEC 27005: Managing AI Risks Effectively by PECB
ISO/IEC 27001 and ISO/IEC 27005: Managing AI Risks EffectivelyISO/IEC 27001 and ISO/IEC 27005: Managing AI Risks Effectively
ISO/IEC 27001 and ISO/IEC 27005: Managing AI Risks Effectively
PECB 651 views
The basics - information, data, technology and systems.pdf by JonathanCovena1
The basics - information, data, technology and systems.pdfThe basics - information, data, technology and systems.pdf
The basics - information, data, technology and systems.pdf
JonathanCovena1156 views
Retail Store Scavenger Hunt.pptx by jmurphy154
Retail Store Scavenger Hunt.pptxRetail Store Scavenger Hunt.pptx
Retail Store Scavenger Hunt.pptx
jmurphy15447 views
Monthly Information Session for MV Asterix (November) by Esquimalt MFRC
Monthly Information Session for MV Asterix (November)Monthly Information Session for MV Asterix (November)
Monthly Information Session for MV Asterix (November)
Esquimalt MFRC91 views
AUDIENCE - BANDURA.pptx by iammrhaywood
AUDIENCE - BANDURA.pptxAUDIENCE - BANDURA.pptx
AUDIENCE - BANDURA.pptx
iammrhaywood131 views

A New Spatial Approach for Efficient Transformation of Equality - Generalized TSP to TSP

  • 1. A New Spatial Approach for Efficient Transformation of Equality - Generalized TSP to TSP Mohammed Zia PhD in Geomatics Engineering Istanbul Technical University, Turkey18th August 2017
  • 2. TSP or Travelling Salesman Problem?
  • 3. TSP or Travelling Salesman Problem
  • 4. TSP or Travelling Salesman Problem
  • 5. TSP or Travelling Salesman Problem
  • 6. TSP or Travelling Salesman Problem 1 2 3 4 5 9999 24 45 56 98 24 9999 10 24 32 45 10 9999 65 54 56 24 65 9999 100 98 32 54 100 9999 1 2 3 4 5 1 2 3 4 5 Cost Matrix
  • 9. Equality Generalized Travelling Salesman Problem Cost Matrix nth nth
  • 10. Equality Generalized Travelling Salesman Problem Solution?
  • 11. Equality Generalized Travelling Salesman Problem Solution? Brute Force Heuristic Methods
  • 12. Equality Generalized Travelling Salesman Problem Heuristic Solution Equality Generalized Travelling Salesman Problem Instance Clustered Travelling Salesman Problem Instance Travelling Salesman Problem Instance SOLUTION Reduce to Reduce to Solve TSP Derive Solution
  • 13. Equality Generalized Travelling Salesman Problem Heuristic Solution Charles E. Noon and James C. Bean, February 1993, An Efficient Transformation Of The Generalized Traveling Salesman Problem, INFOR Information Systems and Operational Research, Volume 30 (1), DOI: 10.1080/03155986.1993.11732212
  • 15. What is Cost? In Vehicle Navigation Instances 1. Distance 2. Time 3. Fuel Consumption 4. Scenic Beauty 5. Any Hybrid
  • 16. What is Cost? In Vehicle Navigation Instances 1. Distance Static 2. Time Dynamic 3. Fuel Consumption Dynamic 4. Scenic Beauty Dynamic 5. Any Hybrid Static/Dynamic
  • 17. Equality - Generalized TSP with Static/Dynamic Costs ? ? ? ? ? ? ? ? ? ? ? ?
  • 18. Equality - Generalized TSP with Dynamic Costs Equality Generalized Travelling Salesman Problem Instance Clustered Travelling Salesman Problem Instance Travelling Salesman Problem Instance SOLUTION Reduce to Reduce to Solve TSP Derive Solution Current Equality Generalized TSP Instance with Empty Cost Matrix ?
  • 19. Equality - Generalized TSP for Vehicle Navigation Dynamic Costs – Dynamic Data – Cost Matrix on the fly Static Costs – Static Data – Pre-processing possible
  • 20. Equality - Generalized TSP for Vehicle Navigation 2 Problems in Pre-Processing (a) What is Distance? Dijkstra Distance / Displacement.
  • 21. Equality - Generalized TSP for Vehicle Navigation 2 Problems in Pre-Processing (a) What is Distance? (b) Matrix size is very big Ex. Istanbul – 23,000 Amenities Dijkstra Distance / Displacement.
  • 22. Equality - Generalized TSP for Vehicle Navigation Distance = Dijkstra Distance or Displacement? 35,000 measurements from 210 cities Dijkstra Distance Displacement
  • 23. Equality - Generalized TSP for Vehicle Navigation ? ? ? ? ? ? ? ? ? ? ? ? Displacement
  • 24. Equality - Generalized TSP for Vehicle Navigation NA NA NA NA NA NA NA NA NA NA NA NA NA = 9999 1 2 3 4 5 6 7 8 9 10 11 12 1 2 3 4 5 6 7 8 9 10 11 12
  • 25. Equality - Generalized TSP for Vehicle Navigation NA NA NA NA NA NA NA NA NA NA NA NA NA = 9999 1 2 3 4 5 6 7 8 9 10 11 12 1 2 3 4 5 6 7 8 9 10 11 12 122 – (32 + 42 + 22 + 32) or 𝑛2- 𝑚=1 𝑘 |𝑚|2
  • 26. Equality - Generalized TSP for Vehicle Navigation How to reduce Cost Matrix Size?
  • 27. Equality - Generalized TSP for Vehicle Navigation
  • 28. Equality - Generalized TSP for Vehicle Navigation
  • 29. Equality - Generalized TSP for Vehicle Navigation
  • 30. Equality - Generalized TSP for Vehicle Navigation
  • 31. Equality - Generalized TSP for Vehicle Navigation 1 2 3 4 56 7 8 9 10 11 12 X Y
  • 32. Equality - Generalized TSP for Vehicle Navigation 1 2 3 4 56 7 8 9 10 11 12 X Y
  • 33. Equality - Generalized TSP for Vehicle Navigation 1 2 3 4 56 7 8 9 10 11 12 X Y Average Cost1 Average Cost3 Product Cost = Avg. Cost1 x Avg. Cost2 x Avg. Cost3
  • 34. Equality - Generalized TSP for Vehicle Navigation Each Cluster = [Product Cost1, Product Cost2, Product Cost3, . . . . ., Product Costp] Sorted List
  • 35. Equality - Generalized TSP for Vehicle Navigation 5% Each Cluster = [Product Cost1, Product Cost2, Product Cost3, . . . . ., Product Costp] Sorted List
  • 36. Equality - Generalized TSP for Vehicle Navigation NA NA NA NA NA NA NA NA NA NA NA NA NA = 9999 1 2 3 4 5 6 7 8 9 10 11 12 1 2 3 4 5 6 7 8 9 10 11 12 1 4 5 8 10 11 NA NA NA NA NA NA 1 4 5 8 10 11
  • 37. Equality - Generalized TSP for Vehicle Navigation 2 Problems in Pre-Processing (a) What is Distance? (b) Matrix size is very big Ex. Istanbul – 23,000 Amenities Dijkstra Distance / Displacement.
  • 38. Equality - Generalized TSP for Vehicle Navigation 2 Problems in Pre-Processing (a) What is Distance? (b) Matrix size is very big
  • 39. Equality - Generalized TSP for Vehicle Navigation GTSP Sample Instance Library Download - http://www.cs.rhul.ac.uk/home/zvero/GTSPLIB/ Presented Approach Vs Generalized Lin–Kernighan–Helsgaun Approach For GLKH State-of-the-Art Approach – Keld Helsgaun, 2015, Solving the equality generalized traveling salesman problem using the Lin–Kernighan–Helsgaun Algorithm, Mathematical Programming Computation, Volume 7, Page 269–287, DOI 10.1007/s12532-015- 0080-8
  • 40. Equality - Generalized TSP for Vehicle Navigation Average % Standard Deviation of Cluster’s Cost Error % Presented Approach GLKH Approach
  • 41. Equality - Generalized TSP for Vehicle Navigation # of Clusters in Sample Instance Time taken (s) Presented Approach GLKH Approach
  • 42. Equality - Generalized TSP for Vehicle Navigation # of Nodes in Sample Instance Matrix Size Presented Approach GLKH Approach
  • 43. Equality - Generalized TSP for Vehicle Navigation # of Nodes in Sample Instance Matrix Size with value ≠ 0 or 9999 Presented Approach GLKH Approach
  • 44. Average % Standard Deviation of Cluster’s Cost Error % # of Clusters in Sample Instance Time taken (s) # of Nodes in Sample Instance Matrix Size # of Nodes in Sample Instance Matrix Size with value ≠ 0 or 9999 For 5%
  • 45. Equality - Generalized TSP for Vehicle Navigation Gain in Time & Space – Polynomial Order Lose in Error – Logarithmic Order
  • 46. World TSP tour Length: 7,516,353,779km Cities: 1,904,711 Source: http://www.math.uwaterloo.ca/tsp/world/pictures.html Thank You!