Improving a Set of Sequential Heuristics for the Channel Allocation Problem

摘要

We consider the miinimum span channel allocation problem encountered in cellular systems. Our solution approach is based on a set of sequential heuristics, and incorporates concepts borrowed from graph coloring schemes. The performance of the new heuristics has been tested on knolwn benchmark problems, whose optimal solaution have been recently quoted in the literature. The new heuristics are quite effecitive in terms of speed, as well as in terms of spans produced. The results obtained are near-optimal in almost all cases, and certainly comparable to those produced by slower optimization procedures, indicating that these new variations can be treated either as an effcient alternative to this type of problems or as a very good starting point to more compliecated procedures.