`TSPACO`

Module: opytimizer.optimizers.single_objective.swarm.aco

Ant Colony Optimization specialized for the Traveling Salesman Problem.

Each ant constructs a Hamiltonian cycle by selecting the next unvisited city according to pheromone and heuristic information.

Constructor

TSPACO(params: Optional[Dict[str, Any]] = None, distance_matrix: Optional[numpy.ndarray] = None) -> None

Parameter	Type	Default	Description
`params`	`Optional[Dict[str, Any]]`	`None`	Contains key-value parameters to the meta-heuristic.
`distance_matrix`	`Optional[numpy.ndarray]`	`None`	Matrix containing pairwise distances between cities.

compile(self, space: opytimizer.spaces.graph._SingleObjectiveGraphSpace) -> None

Compiles pheromone and TSP heuristic information.

Parameter	Type	Default	Description
`space`	`opytimizer.spaces.graph._SingleObjectiveGraphSpace`		—