Published January 1, 2016
| Version v1
Conference paper
Open
A Heuristic Algorithm for the Band Collocation Problem
- 1. Ege Univ, Dept Math, Izmir, Turkey
- 2. Izmir Univ, Dept Math & Comp Sci, Izmir, Turkey
- 3. Karabuk Univ, Dept Comp Engn, Karabuk, Turkey
Description
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.
Files
bib-1d85cb6d-aa0a-40f4-a2fa-9b09e54d2875.txt
Files
(218 Bytes)
| Name | Size | Download all |
|---|---|---|
|
md5:60c442efe3e57e4d400603c8e0c75f83
|
218 Bytes | Preview Download |