Scope

This service provides to solve yourself Traveling Salesman Problem is using real roads. Road data is coming from Google Map Distance Matrix API. So, if you use it heavily, you should get a Google APIKEY.

Usage

Input

(required) points: All nodes for TSP. It can contain string or gps data.

(optional) startpoint: Force the search to define a start point.

(optional) endpoint: Force the search to define an end point.

(optional) api: Google APIKEY. Click for details.

Output

Object including sorting nodes.

EXAMPLE

A PROBLEM

Selected cities: İstanbul, Ankara, İzmir, Eskişehir, Afyonkarahisar, Konya, Antalya. (Marked yellow)

Selected start point: İstanbul

Selected end point: Antalya

INPUT

{
  "points": ["Ankara","İzmir","Eskişehir", "Afyonkarahisar", "Konya"],
  "startpoint": "İstanbul",
  "endpoint": "Antalya"
}

OUTPUT

Shortest route:

[
  "İstanbul",
  "İzmir",
  "Afyonkarahisar",
  "Eskişehir",
  "Ankara",
  "Konya",
  "Antalya"
]

OUTPUT on MAP

NOTE FOR Academic Usage !!!

If you use the algorithm for an academical purpose, please cite this:

@incollection{incollection,
author = {Emre Akadal, Sefa Saylan},
title = {Gerçek dünya haritası üzerinde genetik algoritmalarla gezgin satıcı problemi uygulaması},
booktitle = {R ile Veri Madenciliği Uygulamaları},
chapter = 7,
pages = {183-205},
publisher = {Çağlayan Kitabevi},
year = 2016,
address = {Istanbul, Turkey},
editor = {Dr. Mehmet Erdal Balaban, Dr. Elif Kartal},
}

Akadal, E., Saylan, S., 2016, Gerçek dünya haritası üzerinde genetik algoritmalarla gezgin satıcı problemi uygulaması, R ile Veri Madenciliği Uygulamaları, Çağlayan Kitabevi, Istanbul Turkey, 183-205.

akadal / TSP / 0.2.1

Comments

Loading comments