Category: Heuristic algorithms

Heuristic routing
Heuristic routing is a system used to describe how deliveries are made when problems in a network topology arise. Heuristic is an adjective used in relation to methods of learning, discovery, or probl
In optimization, 2-opt is a simple local search algorithm for solving the traveling salesman problem.The 2-opt algorithm was first proposed by Croes in 1958, although the basic move had already been s
Turn restriction routing
A routing algorithm decides the path followed by a packet from the source to destination routers in a network. An important aspect to be considered while designing a routing algorithm is avoiding a de
Brain storm optimization algorithm
The brain storm optimization algorithm is a heuristic algorithm that focuses on solving multi-modal problems, such as radio antennas design worked on by Yahya Rahmat-Samii, inspired by the brainstormi
In computational engineering, Luus–Jaakola (LJ) denotes a heuristic for global optimization of a real-valued function. In engineering use, LJ is not an algorithm that terminates with an optimal soluti
Monte Carlo tree search
In computer science, Monte Carlo tree search (MCTS) is a heuristic search algorithm for some kinds of decision processes, most notably those employed in software that plays board games. In that contex
Social cognitive optimization
Social cognitive optimization (SCO) is a population-based metaheuristic optimization algorithm which was developed in 2002. This algorithm is based on the social cognitive theory, and the key point of
Adaptive dimensional search
Adaptive dimensional search algorithms differ from nature-inspired metaheuristic techniques in the sense that they do not use any metaphor as an underlying principle for implementation. Rather, they u
Lin–Kernighan heuristic
In combinatorial optimization, Lin–Kernighan is one of the best heuristics for solving the symmetric travelling salesman problem. It belongs to the class of local search algorithms, which take a tour
Heuristic (computer science)
In mathematical optimization and computer science, heuristic (from Greek εὑρίσκω "I find, discover") is a technique designed for solving a problem more quickly when classic methods are too slow or for
Nearest neighbour algorithm
The nearest neighbour algorithm was one of the first algorithms used to solve the travelling salesman problem approximately. In that problem, the salesman starts at a random city and repeatedly visits
HeuristicLab is a software environment for heuristic and evolutionary algorithms, developed by members of the Heuristic and Evolutionary Algorithm Laboratory (HEAL) at the , in Hagenberg im Mühlkreis.
In optimization, 3-opt is a simple local search algorithm for solving the travelling salesperson problem and related problems. Compared to the simpler 2-opt algorithm, it is slower but can generate hi
Emergent algorithm
An emergent algorithm is an algorithm that exhibits emergent behavior. In essence an emergent algorithm implements a set of simple building block behaviors that when combined exhibit more complex beha
Kernighan–Lin algorithm
The Kernighan–Lin algorithm is a heuristic algorithm for finding partitions of graphs.The algorithm has important practical application in the layout of digital circuits and components in electronic d
Thompson sampling
Thompson sampling, named after William R. Thompson, is a heuristic for choosing actions that addresses the in the multi-armed bandit problem. It consists of choosing the action that maximizes the expe