13
votes
Building the shortest route through all points in QGIS
What you're looking for is called "Travelling salesman problem".
Let's assume there is a point and a line layers, see the image below.
There are several approaches available:
Approach 1 : ...
- 34k
2
votes
Accepted
Creating map of travelling salesperson problem solution with pgrouting?
Use this query to get the route for the sequence of given nodes.
select fd.seq as seq,
fd.geo as geo
from (
SELECT ROW_NUMBER() OVER (ORDER BY now() ASC) AS seq,
(
...
- 428
2
votes
Why Travelling Salesman Problem plugin is not working in QGIS 3?
I'd recommend you to stick to ORS Tools plugin, as it supports, amongst other tools and functions, TravellingSalesmanProblem: https://github.com/GIScience/orstools-qgis-plugin
- 604
1
vote
Calculating the shortest path connecting multiple points (like TSP) on road network in QGIS
If you have GRASS installed you can use v.net.salesman:
Creates a cycle connecting given nodes (Traveling salesman problem).
- 77.8k
1
vote
Accepted
Route design for Travelling Salesperson
Disclosure: I work for Esri and this is not my area of interest.
I think you have 2 'major' problems. The first is to identify the territory for each dealer--check for location/allocation. It might be ...
- 19.1k
1
vote
Building the shortest route through all points in QGIS
You can also use networkx together with pyqgis:
from itertools import combinations
import networkx as nx
layer = QgsProject.instance().mapLayersByName("building")[0]
all_features = [f for f ...
- 77.8k
Only top scored, non community-wiki answers of a minimum length are eligible