In this paper we present an approximation algorithm for the p-median problem that uses the principles of ant colony optimization technique. We introduce a search tree that keeps the partial solutions during the solution process of the p-median problem. An adaptation is proposed that allows ant colony optimization algorithm to perform on this tree and obtain good results in short time.

Ant colony optimization algorithm (ACO) is a heuristic bionic evolutionary system based on the population. The positive feedback of ACO helps to search the approximate optimal solution, however, it also makes it easier to get trapped in local optimal solution. In order to avoid prematurity and enhance its adaptability, this paper introduces chaos principle in ACO and proposes an adaptive chaoti...

Intraperitoneal injection of complete Freund's adjuvant which caused an extensive cellular response in the reticuloendothelial system greatly increased the severity of infection which resulted from footpad inoculation of ectromelia virus in mice. The mortality was greatest during the proliferative phase of the cellular response, indicated by the colony-forming cell response. Exposure of colony-...

This study deals with performance-based design optimization (PBDO) of steel moment frames employing four different metaheuristics consisting of genetic algorithm (GA), ant colony optimization (ACO), harmony search (HS), and particle swarm optimization (PSO). In order to evaluate the seismic capacity of the structures, nonlinear pushover analysis is conducted (PBDO). This method is an iterative ...

Résumé: This paper presents HACSEG, a new ant algorithm for the image segmentation based on the Markov Random Field (MRF) and a modified version of the Ant Colony System algorithm coupled with a local search. HACSEG algorithm differs from other ant algorithms proposed for image segmentation, in the way that each artificial ant is associated with a particular partition that is modified using phe...

The purpose of this article is to review the literature on the topic of deterministic vehicle routing problem (VRP) and to give a review on the exact and approximate solution techniques. More specifically the approximate (meta-heuristic) solution techniques are classified into: tabu search, simulated annealing, genetic algorithm, evolutionary algorithm, hybrid algorithm, and Ant Colony Opti...

The increasing availability of parallel hardware encourages the design and adoption of parallel algorithms. In this article, we present a study in which we analyze the impact that different communication policies have on the solution quality reached by a parallel homogeneous multi-colony ACO algorithm for the traveling salesman problem. We empirically test different configurations of each algor...

A method of automatic programming, called genetic programming, assumes that the desired program is found by using a genetic algorithm. We propose an idea of ant colony programming in which instead of a genetic algorithm an ant colony algorithm is applied to search for the program. The test results demonstrate that the proposed idea can be used with success to solve the approximation problems.

Background: Nowadays, the COVID-19 pandemic has become a global problem that new methods must be used to prevent it. The virus is highly contagious and is mainly transmitted through the air. Ozone is a powerful oxidant that can be used to inactivate a wide range of viruses that may be resistant to other disinfectants. The purpose of this study was to review the use and effect of ozone in inacti...