TopologieObjectiveFunction.java 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313
  1. package algorithm.objectiveFunction;
  2. import utility.FloatLog;
  3. import java.util.Locale;
  4. import algorithm.objectiveFunction.GraphMetrics.Graph;
  5. import model.DecoratedHolonObject;
  6. import model.DecoratedNetwork;
  7. import model.DecoratedState;
  8. public class TopologieObjectiveFunction {
  9. //Parameters
  10. //weight for f_g(H)
  11. static double w_eb = 0.2, w_max = 0.5, w_holon= 0.1, w_selection = .1, w_grid = 0.1;
  12. //--> f_eb parameter
  13. /**
  14. * Maximum Energie Difference(kappa)
  15. */
  16. static double k_eb = 5000.f;
  17. /**
  18. * Maximum when all on Energie Difference(kappa)
  19. */
  20. static double k_max = 10.f;
  21. static double lambda_max = 10.;
  22. //--> f_holon parameter
  23. /**
  24. * maximum penalty from holon element distribution
  25. */
  26. static double k_holon= 4000;
  27. //--> f_selection paramaeter;
  28. /**
  29. * average Maximum Cost for selction(kappa) of switch and elements.
  30. */
  31. static double k_selection = 200000;
  32. static double cost_switch = 3000;
  33. private static double cost_of_cable_per_meter = 6;
  34. //--> f_grid parameter
  35. /**
  36. * The avergae shortest path maximum length -> kappa for the squash function
  37. */
  38. static double k_avg_shortest_path = 1600;
  39. //Disjpijoint path cant have zero as output it starts with the value 1
  40. static double centerValue_disjoint_path = 1.0;
  41. static double k_disjoint_path = 2.4;
  42. static double lambda_avg_shortest_path = 10;
  43. static double lambda_disjoint_path = 10;
  44. static double k_grid = lambda_avg_shortest_path;// + lambda_disjoint_path;
  45. //pre-calculated parameters for partial function terms:
  46. /**
  47. * Pre calculated for the squash function
  48. * <br>
  49. * {@link TopologieObjectiveFunction#squash}
  50. */
  51. static double squash_subtract = 1.0f / (1.f + (float) Math.exp(5.0));
  52. static double range_for_k_avg_shortest_path = range(k_avg_shortest_path);
  53. static double range_for_k_disjoint_path = range(k_disjoint_path - centerValue_disjoint_path);
  54. public static FloatLog log = new FloatLog();
  55. static boolean useLog = false;
  56. static {
  57. //init
  58. checkParameter();
  59. }
  60. /**
  61. * Check parameter Setting and print error when wrong values are put in.
  62. * Here should all invariants be placed to be checked on initialization.
  63. */
  64. private static void checkParameter() {
  65. if(!(Math.abs(w_eb + w_holon + w_selection + w_grid + w_max - 1) < 0.001)) {
  66. System.err.println("ParameterError in ObjectiveFunction: Sum of all weights should be 1");
  67. }
  68. }
  69. /**
  70. * ObjectifeFunction by Carlos.
  71. * Function computes f_g:
  72. * f_g = w1 * squash(f_eb, k1) + w2 * squash(f_state, k2) + w3 * squash(f_pro, k3) + w4 * squash(f_perf, k4) + w5 * squash(f_holon, k5)
  73. *
  74. *
  75. * squash is the squashing function {@link TopologieObjectiveFunction#squash}
  76. *
  77. *
  78. * @param state
  79. * @param moreInformation TODO
  80. * @return f_g value between 0 and 100
  81. */
  82. static public float getFitnessValueForState(DecoratedState state, int amountOfAddedSwitch, double addedCableMeters, boolean moreInformation) {
  83. //Calculate f_eb the penalty for unbalenced energy in the network
  84. double f_eb = 0;
  85. for(DecoratedNetwork net : state.getNetworkList()) {
  86. //abs
  87. f_eb += Math.abs(net.getTotalConsumption() - net.getTotalProduction());
  88. }
  89. //Average?
  90. f_eb /= state.getNetworkList().size();
  91. double f_maximum = 0;
  92. for(DecoratedNetwork net : state.getNetworkList()) {
  93. double prod = net.getTotalProduction();
  94. double con = net.getTotalConsumption();
  95. if(prod == 0 || con == 0) {
  96. f_maximum += lambda_max;
  97. }else {
  98. f_maximum += lambda_max * (Math.abs(prod - con)/Math.max(prod, con));
  99. }
  100. }
  101. //Average?
  102. f_maximum /= state.getNetworkList().size();
  103. //calculate f_holon
  104. double f_holon = 0;
  105. for(DecoratedNetwork net : state.getNetworkList()) {
  106. double f_elements_deviation_production = net.getDeviationInProductionInNetworkForHolonObjects();
  107. double f_elements_deviation_consumption = net.getDeviationInConsumptionInNetworkForHolonObjects();
  108. double f_element = f_elements_deviation_production+f_elements_deviation_consumption;
  109. f_holon += f_element;
  110. }
  111. f_holon /= state.getNetworkList().size();
  112. //calculating f_selection
  113. double f_selection = calculateTopologieCost(state, amountOfAddedSwitch, addedCableMeters);
  114. //if(moreInformation)System.out.println("CostForWildcards:" + cost + ", CostSwitches(#" + amountOfAddedSwitch +"):" + cost_switch * amountOfAddedSwitch + ", CostCables(" +addedCableMeters+ "m):" + cost_of_cable_per_meter * addedCableMeters);
  115. //calculating f_grid
  116. double f_grid = 0;
  117. //each network is a holon
  118. for(DecoratedNetwork net: state.getNetworkList()) {
  119. Graph G = GraphMetrics.convertDecoratedNetworkToGraph(net);
  120. //We have to penalize single Networks;
  121. if(G.V.length <= 1 || G.S.length <= 1) {
  122. f_grid += lambda_avg_shortest_path;// + lambda_disjoint_path;
  123. continue;
  124. }
  125. double avgShortestPath = GraphMetrics.averageShortestDistance(G);
  126. //double disjpointPaths = GraphMetrics.averageEdgeDisjointPathProblem(G);
  127. if(useLog) {
  128. log.addSample("avgShortestPath", (float)avgShortestPath);
  129. }
  130. f_grid += avgShortestPathPenalty(avgShortestPath);// + disjoinPathPenalty(disjpointPaths);
  131. }
  132. //take average to encourage splitting
  133. f_grid /= state.getNetworkList().size();
  134. if(moreInformation) {
  135. printWeightedValues(f_eb, f_maximum, f_holon, f_selection, f_grid);
  136. if(useLog) {
  137. System.out.println("Log");
  138. System.out.println(log);
  139. }
  140. }
  141. //printUnsquashedValues(f_eb, f_maximum, f_holon, f_selection, f_grid);
  142. if(useLog) {
  143. log.addSample("Unsquashed f_eb", (float)f_eb);
  144. log.addSample("Unsquashed f_maximum", (float)f_maximum);
  145. log.addSample("Unsquashed f_holon", (float)f_holon);
  146. log.addSample("Unsquashed f_selection", (float)f_selection);
  147. log.addSample("Unsquashed f_grid", (float)f_grid);
  148. }
  149. return (float) (w_eb * squash(f_eb, k_eb)
  150. + w_max * squash(f_maximum, k_max)
  151. + w_holon * squash(f_holon, k_holon)
  152. + w_selection * squash(f_selection, k_selection)
  153. + w_grid * squash(f_grid, k_grid));
  154. }
  155. public static double calculateTopologieCost(DecoratedState state, int amountOfAddedSwitch,
  156. double addedCableMeters) {
  157. double cost = calculateWildcardCost(state);
  158. cost += calculateAddedSwitchCost(amountOfAddedSwitch);
  159. cost += calculateAddedCableCost(addedCableMeters);
  160. return cost;
  161. }
  162. public static double calculateAddedCableCost(double addedCableMeters) {
  163. return cost_of_cable_per_meter * addedCableMeters;
  164. }
  165. public static double calculateAddedSwitchCost(int amountOfAddedSwitch) {
  166. return cost_switch * amountOfAddedSwitch;
  167. }
  168. public static double calculateWildcardCost(DecoratedState state) {
  169. double cost = 0;
  170. for(DecoratedNetwork net : state.getNetworkList()) {
  171. for(DecoratedHolonObject dHobject : net.getConsumerList()) {
  172. if(dHobject.getModel().getName().contains("Wildcard")){
  173. if(dHobject.getModel().getName().length() > 9) {
  174. String costString = dHobject.getModel().getName().substring(9);
  175. cost += Double.parseDouble(costString);
  176. }
  177. }
  178. }
  179. for(DecoratedHolonObject dHobject : net.getConsumerSelfSuppliedList()) {
  180. if(dHobject.getModel().getName().contains("Wildcard")){
  181. if(dHobject.getModel().getName().length() > 9) {
  182. String costString = dHobject.getModel().getName().substring(9);
  183. cost += Double.parseDouble(costString);
  184. }
  185. }
  186. }
  187. for(DecoratedHolonObject dHobject : net.getSupplierList()) {
  188. if(dHobject.getModel().getName().contains("Wildcard")){
  189. if(dHobject.getModel().getName().length() > 9) {
  190. String costString = dHobject.getModel().getName().substring(9);
  191. cost += Double.parseDouble(costString);
  192. }
  193. }
  194. }
  195. }
  196. return cost;
  197. }
  198. private static String doubleToString(double value) {
  199. return String.format (Locale.US, "%.2f", value);
  200. }
  201. @SuppressWarnings("unused")
  202. private static double disjoinPathPenalty(double value) {
  203. return -(2.0 * lambda_disjoint_path) / (1 + Math.exp(- (value - centerValue_disjoint_path)/ range_for_k_disjoint_path)) + (2.0 * lambda_disjoint_path);
  204. }
  205. private static double avgShortestPathPenalty(double value) {
  206. return (2.0 * lambda_avg_shortest_path) / (1 + Math.exp(- value/ range_for_k_avg_shortest_path)) - lambda_avg_shortest_path;
  207. }
  208. /**
  209. * Attention Math.log calcultae ln not log
  210. * @param kappa
  211. * @return
  212. */
  213. private static double range(double kappa) {
  214. return - kappa / Math.log(Math.pow(2.0, 0.05) - 1.0 );
  215. }
  216. /**
  217. * The squashing function in paper
  218. * @param x the input
  219. * @param kappa the corresponding kappa
  220. * @return
  221. */
  222. static public double squash(double x, double kappa) {
  223. return 100.f/(1.0f + Math.exp(-(10.f * (x - kappa/2.f))/ kappa)) - squash_subtract;
  224. }
  225. /**
  226. * f_sup in paper
  227. * @param supply from 0 to 1
  228. * @return
  229. */
  230. static public double supplyPenalty(double supply) {
  231. double supplyPercentage = 100 * supply;
  232. return (supplyPercentage < 100) ? -0.5 * supplyPercentage + 50: supplyPercentage - 100;
  233. }
  234. static void printWeightedValues(double f_eb, double f_maximum, double f_holon, double f_selection, double f_grid){
  235. System.out.println("===================================================================");
  236. System.out.println(" f_eb: " + f_eb + ", k_eb: " + k_eb + ", w_eb: " + w_eb);
  237. System.out.println(" squash(f_eb, k_eb): " + doubleToString(squash(f_eb, k_eb)));
  238. System.out.println(" w_eb * squash(f_eb, k_eb): " + doubleToString(w_eb * squash(f_eb, k_eb)));
  239. System.out.println("===================================================================");
  240. System.out.println(" f_maximum: " + f_maximum + ", k_max: " + k_max + ", w_max: " + w_max);
  241. System.out.println(" squash(f_maximum, k_max): " + doubleToString(squash(f_maximum, k_max)));
  242. System.out.println(" w_max * squash(f_maximum, k_max): " + doubleToString(w_max * squash(f_maximum, k_max)));
  243. System.out.println("===================================================================");
  244. System.out.println(" f_selection: " + f_selection + ", k_selection: " + k_selection + ", w_selection: " + w_selection);
  245. System.out.println(" squash(f_selection, k_selection): " + doubleToString(squash(f_selection, k_selection)));
  246. System.out.println(" w_selection * squash(f_selection, k_selection): " + doubleToString(w_selection * squash(f_selection, k_selection)));
  247. System.out.println("===================================================================");
  248. System.out.println(" f_holon: " + f_holon + ", k_holon: " + k_holon + ", w_holon: " + w_holon);
  249. System.out.println(" squash(f_holon, k_holon): " + doubleToString(squash(f_holon, k_holon)));
  250. System.out.println(" w_holon * squash(f_holon, k_holon): " + doubleToString(w_holon * squash(f_holon, k_holon)));
  251. System.out.println("===================================================================");
  252. System.out.println(" f_grid: " + f_grid + ", k_grid: " + k_grid + ", w_grid: " + w_grid);
  253. System.out.println(" squash(f_grid, k_grid): " + doubleToString(squash(f_grid, k_grid)));
  254. System.out.println(" w_grid * squash(f_grid, k_grid): " + doubleToString(w_grid * squash(f_grid, k_grid)));
  255. System.out.println("===================================================================");
  256. System.out.println();
  257. System.out.println();
  258. }
  259. static void printUnsquashedValues(double f_eb, double f_maximum, double f_holon, double f_selection, double f_grid){
  260. System.out.print(" f_eb(" + f_eb + ") ");
  261. System.out.print(" f_maximum(" + f_maximum + ") ");
  262. System.out.print(" f_holon(" + f_holon + ") ");
  263. System.out.print(" f_selection(" + f_selection + ") ");
  264. System.out.println(" f_grid(" + f_grid + ") ");
  265. }
  266. }