COSC 6367 (Dr. Eick) - Spring 2012
Project 1
Due Date: | March 2, 2012, 12p (electronic submission) |
Last Updated: | February 28, 10a |
For example, let us assume that the following source and destination
capacities are given:
source[1]=5 source[2]=5 source[3]=20 source[4]=15 source[5]=15 source[6]=20 |
destination[1]=16 destination[2]=16 destination[3]=16 destination[4]=16 destination[5]=16 |
Moreover, four different cost functions f1, f2, f3, and f4 will be used for the project:
Let i the source index (i=1,...,6) j be the destination index (j=1,...,5) u the number of units to be transported (>=0)
f1(i,j,u) := (|i*j - 13|)* u f2(i,j,u) := (|i*j - 13| * u^2 f3(i,j,u) := (|i^2 - j^2| + 1)* max(1, sqrt(u)) f4(i,j,u) := |i*j - 13|*u + u^3 |
"linear transportation problem" "quadratic transportation problem" "general transportation problem1" "general transportation problem2" |
16 16 16 16 16 5 5 0 0 0 0 5 3 2 0 0 0 20 0 10 10 0 0 15 0 0 0 15 0 15 8 4 0 0 3 20 0 0 6 1 13
f1(1,1,5) + f1(2,1,3) + f1(2,2,2) + f1(3,2,10) + f1(3,3,10) + f1(4,4,15) + f1(5,1,8) + f1(5,2,4) + f1(5,5,3) + f1(6,3,6) + f1(6,4,1) + f1(6,5,13)= 12*5 + 11*3 + 9*2 + 7*10 + 4*10 + 3*15 + ...
Provide a script like interface for your program that allows to run a large set of experiments, such as those mentioned above! Moreover, provide tracing options for your program that display the input paramter used, summaries of the evolution process (e.g. average fitness, when a new best solution was found, and possibly population diversity and statistics about particular genetic operators) and reports the best 5 results obtained by a program run in a nice and understandable form. Test and enhance your program assuming each of the 4 classes of supported cost-functions. Be prepared to demo your program!
Write a report (approx. 9 to 13 single spaced pages) that describes the
evolution of the project, gives a clear description of the explored and employed
search strategies, and summarizes the results of running your program using the
four cost functions for:
source[1]=5 source[2]=5 source[3]=20 source[4]=15 source[5]=15 source[6]=20 |
destination[1]=16 destination[2]=16 destination[3]=16 destination[4]=16 destination[5]=16 |
source[1]=14 source[2]=14 source[3]=14 source[4]=14 source[5]=14 source[6]=30 |
destination[1]=20 destination[2]=10 destination[3]=10 destination[4]=10 destination[5]=50 |