aco_tsp: ACO Algorithm applied to the Traveling Salesman Problem

In FelixBehne/ant.colony.optimization: Ant Colony Optimization Dashboard

Description

ACO Algorithm applied to the Traveling Salesman Problem

Usage

aco_tsp(
  x,
  y,
  alpha,
  beta,
  evaporation,
  randomness_factor,
  numb_ants,
  iterations
)

Arguments

x	X-Values from the Cities
y	y-Values from the Cities
alpha	The strength of the pheromone. The higher the stronger.
beta	Relevance of the distance. The higher the more decreases the relevance.
evaporation	Strength with which the pheromones evaporate.
randomness_factor	Factor for random iterations.
numb_ants	Number of ants.
iterations	Number of iterations.

Value

All the routes with the minimal distance, possible that this are more than one.

Author(s)

The code is adopted from: https://github.com/ciessielski/ACOTSP

FelixBehne/ant.colony.optimization documentation built on Dec. 17, 2021, 8:25 p.m.