Assignment round oneFrequency AssignmentProblemA mobile radio network assigns frequencies to its clients. If two clients are sufficiently close to each other, they must be assigned different frequencies. If they are far enough from each other they may share the frequency. Your task is to create an assignment that minimizes the number of frequencies used. Assignment
Create a Java program that takes a graph representing a radio network and tries to find an optimal frequency
assignment using some local search method. Test your solution with two sets of similar instances: set 1 set 2. For each set, test how good solutions can be found in 1 minute and in 10 minutes. InputThe program will be run with command java Frequency <graph>where <graph> is the file name of a graph with each node representing a mobile radio client. An edge means that the clients represented by the endpoints are too close to each other to use same frequency. Name your class containing the main()-method Frequency.java. Output
The performance of the program will be evaluated by running it for a prespecified time and checking the best achieved solution. To assist this,
each time the program finds a better assignment than before, it must print it out in the following format: n1 = 0; n2 = 2; n3 = 1; DeliverableReturn the commented source code and a small report describing your approach and results to schumach(at)tcs.hut.fi. Include your student number in the mail. GradingCorrect solution on first try with sufficient report earns 3 points, each failed attempt decreasing points by 1. Submitted solutions are compared with each other and a reference solution. Good solutions are granted 1-2 extra points. Example instances
Instance with 3 frequencies [TCS main] [Contact Info] [Personnel] [Research] [Publications] [Software] [Studies] [News Archive] [Links] Latest update: 04 October 2007. |