SEARCH TREE-BASED APPROACH FOR THE P-MEDIAN PROBLEM USING THE ANT COLONY OPTIMIZATION ALGORITHM

Abstract

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.