//! calculate the fitness value of the given contactvectors if a contact is added
/*!
* \param ContactWindowsVector contact windows to check
* \param CotnactWindowsVector contacts of the complete problem
* \param int max number of Contacts of the Scheduling problem
* \param ContactWindow to add
*/
// Call to calculate Objective Values for Fitness
public void calculateValues(ContactWindowsVector currentSolution, ContactWindowsVector completeContacts, int numberOfAllContacts,
ContactWindow contactToAdd)
{
currentSolution.add(contactToAdd);
calculate(currentSolution, calcualteMaxPrioValue(completeContacts), numberOfAllContacts, null, completeContacts);
currentSolution.deleteAt(currentSolution.Count() - 1);
}
//! Remove unwanted contact windows
/*!
* \param int Min. Duration window
* Deletes all contact windows whitch contact times are lower then min duration
*/
public void removeUnwantedContacts(int minDuration)
{
for (int i = 0; i < schedulerContacts.Count(); i++)
{
if (schedulerContacts.getAt(i).getDuration() < minDuration)
{
schedulerContacts.deleteAt(i);
i--;
}
}
}
//! Calculates a schedule from the defined problem
/*!
* \pram ScheduleProblemInterface defined problem with contactwindows
* This Function will calculate the solution to the problem defined in
* Schedule Problem Interface
*/
public void CalculateSchedule(ScheduleProblemInterface problem)
{
set = problem.getContactWindows();
schedule = new ContactWindowsVector();
set.sort(Structs.sortByField.TIME);
while (!isComplete())
{
for (int i = 0; i < set.Count(); i++)
{
bool collisionFound = false;
List <int> collisionSet = new List <int>();
collisionSet.Add(i);
for (int j = 1; j < set.Count() - 1; j++)
{
collisionFound = checkCollision(set.getAt(i), set.getAt(j));
collisionSet.Add(j);
}
if (collisionFound)
{
set.getAt(i).setSheduled();
for (int k = 0; k < collisionSet.Count - 1; k++)
{
set.getAt(collisionSet[k]).unShedule();
}
}
else
{
schedule.add(set.getAt(i));
set.deleteAt(i);
i--;
}
}
}
//retrive all the contactwindows that need to be scheduled
//ContactWindowsVector set = problem.getContactWindows();
//Scheduler Magic until is Complete returns true
//No Element of the ContactWindowsVector set should be deleted
//To Schedule a item call set.getAt(index).setSheduled()
//To Unschedule a item call set.getAt(index).unShedule()
}
//! Calculate scheduling solution from certain startpoint
/*!
* calculate a schedule from a certain starting point
* if iterating trhough every contact window can be used to brute force
* the scheduling solution
* \param ScheduleProblemInterface to solve scheduling problem
* \param int point from which to start from
*/
public void BruteForceSchedule(ScheduleProblemInterface problem, int step)
{
objective = problem.getObjectiveFunction();
set = problem.getContactWindows();
int nrOfAllContacts = set.Count();
ContactWindowsVector set1 = new ContactWindowsVector();
ContactWindowsVector set2 = new ContactWindowsVector();
//double maxFitness = 0.0;
int count = 0;
set1.add(set.getAt(step));
set.deleteAt(step);
while (!isComplete())
{
int pos = -1;
double maxFitness = 0.0;
for (int i = 0; i < set.Count(); i++)
{
objective.calculateValues(set1, set, nrOfAllContacts, set.getAt(i));
double fitness = objective.getObjectiveResults();
if (fitness > maxFitness)
{
maxFitness = fitness;
pos = i;
}
if (Properties.Settings.Default.global_MaxPerf == false)
{
System.Windows.Forms.Application.DoEvents();
}
}
bool found = false;
if (pos >= 0)
{
for (int i = 0; i < set1.Count(); i++)
{
if (set.getAt(pos).checkConflikt(set1.getAt(i)))
{
if (set.getAt(pos).getSatName() == set1.getAt(i).getSatName() ||
set.getAt(pos).getStationName() == set1.getAt(i).getStationName())
{
set2.add(set.getAt(pos));
set2.getLast().unShedule();
set.deleteAt(pos);
found = true;
break;
}
}
if (Properties.Settings.Default.global_MaxPerf == false)
{
System.Windows.Forms.Application.DoEvents();
}
}
if (!found)
{
set1.add(set.getAt(pos));
set1.getLast().setSheduled();
set.deleteAt(pos);
}
}
else
{
count++;
}
}
set.add(set1);
set.add(set2);
schedule = set;
}
//! Calculates a schedule from the defined problem
/*!
* \pram ScheduleProblemInterface defined problem with contactwindows
* Greedy approach earliest job first.
*/
public void CalculateSchedule(ScheduleProblemInterface problem)
{
set = problem.getContactWindows();
ContactWindowsVector set1 = new ContactWindowsVector();
ContactWindowsVector set2 = new ContactWindowsVector();
List <string> staName = set.getStationNames();
//while set is not empty do
while (!isComplete())
{
//loop through all Stations
for (int i = 0; i < staName.Count(); i++)
{
int pos = -1;
double earliest = 9999.99;
int priority = 4;
//loop through all Contacts and find the item that finisches
//first and has the highest priority.
for (int k = 0; k < set.Count(); k++)
{
if (set.getAt(k).getStationName() == staName[i])
{
if (set.getAt(k).getStopTime().getEpoch() < earliest
&&
(int)set.getAt(k).getPriority() <= priority)
{
pos = k;
earliest = set.getAt(k).getStopTime().getEpoch();
priority = (int)set.getAt(k).getPriority();
}
}
}
//update Progress Bar on Main Form
if (Properties.Settings.Default.global_MaxPerf == false)
{
System.Windows.Forms.Application.DoEvents();
}
if (f != null)
{
f.incrementProgressBar();
}
//the found earliest job is added to set1 if its empty
//or no other contact in set1 is conflicting with it
//if there is a conflict add this element to set2
//Then the element is deleted from set1
if (pos > -1)
{
if (set1.isEmpty())
{
set1.add(set.getAt(pos));
set.deleteAt(pos);
}
else
{
bool found = false;
for (int k = 0; k < set1.Count(); k++)
{
if (set.getAt(pos).checkConflikt(set1.getAt(k)))
{
if (set.getAt(pos).getSatName() == set1.getAt(k).getSatName())
{
set2.add(set.getAt(pos));
set.deleteAt(pos);
found = true;
break;
}
}
}
if (!found)
{
set1.add(set.getAt(pos));
set.deleteAt(pos);
}
}
}
}
}
for (int i = 0; i < set1.Count(); i++)
{
set1.getAt(i).setSheduled();
}
for (int i = 0; i < set2.Count(); i++)
{
set2.getAt(i).unShedule();
}
set.add(set1);
set.add(set2);
schedule = set;
solveConflictsByPriority();
if (f != null)
{
f.resetProgressBar();
}
}
