In this paper we present a heuristic algorithm for the The Band Collocation Problem (BCP) which may have some applications in the field of telecommunication. First, we give the definition the BCP. Second, we explain how we create the problem instances with known optimal solutions as a library. Third, we propose the heuristic algorithm. Then, we analysis and interpret the results of the proposed algorithm on the problem instances with known optimal solutions. Finally, we suggest new ideas about the BCP and its solution approaches.