As a swarm-based optimization heuristic, the Ant System (AS) was proposed to deal with Traveling Salesman Problem (TSP). Classifified as constructive approach, AS inspired by ants’ social behavior.In Practice, its implementation reveals three basic variants that exploit two operating models: fifirst “natural” model, where ants move and update pheromones, consideration of distances between towns...

We present a matching and LP based heuristic algorithm that decides graph non-Hamiltonicity. Each of the n! Hamilton cycles in a complete directed graph on n + 1 vertices corresponds with each of the n! n-permutation matrices P, such that pu,i = 1 if and only if the ith arc in a cycle enters vertex u, starting and ending at vertex n + 1. A graph instance (G) is initially coded as exclusion set ...

Meta-heuristic algorithms are applied in optimization problems in a variety of fields, including engineering, economics, and computer science. In this paper, seven population-based meta-heuristic algorithms are employed for size and geometry optimization of truss structures. These algorithms consist of the Artificial Bee Colony algorithm, Cyclical Parthenogenesis Algorithm, Cuckoo Search algori...

location-allocation is a combinatorial optimization problem, and is defined as non deterministic polynomial hard (np) hard optimization. therefore, solution of such a problem should be shifted from exact to heuristic or meta heuristic due to the complexity of the problem. locating medical centers and allocating injuries of an earthquake to them has high importance in earthquake disaster managem...

in this paper, a method for automatic stitching of radiology images based on pixel features has been presented. in this method, according to the smooth texture of radiological images and in order to increase the number of the extracted features after quality enhancement of initial radiology images, 45 degree isotropic mask is applied to each radiology image to observe the image details. after t...

This paper examines the following statements about heuristic search, which are commonly held to be true: More accurate heuristics result in fewer states being expanded by A* and IDA*. A* expands fewer states than any other equally informed algorithm that finds optimal solutions. Any admissible heuristic can be turned into a consistent heuristic by a simple technique called . In search spaces wh...

Lines of Action (LOA) is a two-person zero-sum chess-like connection game with perfect information. The goal of each side is to connect its own pieces. The state-space complexity and game-tree complexity are comparable with those of Othello. A LOA evaluation function usually consists of a combination of the following components: threats, solid formations, (partial) blocking, centralisation, mat...