Search - TSP LOCAL

Search - TSP LOCAL - List

[Software Engineering] SA-TSP DL : 0: Simulated Annealing (SA) is the oldest probabilistic meta-heuristic algorithm and one of the first algorithms having ability to avoid being trapped in local minima. It is inspired by the process of annealing in metallurgy. In this process a material is heated and slowly cooled into solid crystal state with minimum energy and larger crystal size to reduce defects in metallic structures. Once the system has cooled, the configuration will represent a sample at or close to a global optimum.
Date : 2025-12-30 Size : 2kb User : sorayya
[Software Engineering] ACO-TSP DL : 0: Ant Colony Optimization Algorithm (ACO) and TSP ACO algorithm mimics the behavior of real life ants and on how they interact with each other. The basic philosophy of the algorithm involves the movement of a colony of ants through the different states of the problem influenced by two local decision policies, viz., trails and attractiveness and two mechanisms, viz., trail evaporation and daemon actions. The algorithm aims to search for an optimal path based on the behavior of ants seeking a path between their colony and a source of food. Thereby, each such ant incrementally constructs a solution to the problem.
Date : 2025-12-30 Size : 14kb User : sorayya