{"id":22669,"date":"2025-02-10T11:47:26","date_gmt":"2025-02-10T11:47:26","guid":{"rendered":"http:\/\/141.23.68.248\/wp\/?page_id=22669"},"modified":"2025-02-10T15:30:06","modified_gmt":"2025-02-10T15:30:06","slug":"coding-challenge","status":"publish","type":"page","link":"http:\/\/141.23.68.248\/wp\/?page_id=22669","title":{"rendered":"Coding Challenge"},"content":{"rendered":"<p style=\"text-align: justify;\">In order to be able to explore all the combinations of our 3 systems we had to extend the already exisitng function by another loop that will consider the third system. This means also a higher computing time as we go from n^2 to n^3. In each step the combine.lifetime-Function is being called. This also had to be further expanded to match our needs. With a third option we added more conditions to check the possible combinations of the 3 events with each other. We realized that the dist.Events-function is being called frequently and that the performance can be exhanced by commenting out the plot.timeline-function. This allowed us to use an n.grid of 4 with a calculating time of 10 minutes. Everything above that would run forever.<\/p>\n<p style=\"text-align: justify;\">Based on the already calculated maintenace schedules we extracted first intervention variables. These were then used accordingly in the associated life-cycle assessment functions. For the multi-objective optimization we overwrote these intervention variables to get a variatey of cases that could appear and therefore changing the final results.<\/p>\n<hr \/>\n<h5 style=\"text-align: center;\"><a href=\"http:\/\/141.23.68.248\/wp\/?page_id=21620\">Introduction\u00a0<\/a>|\u00a0<a href=\"http:\/\/141.23.68.248\/wp\/?page_id=21661\">System Integration<\/a>\u00a0|\u00a0<a href=\"http:\/\/141.23.68.248\/wp\/?page_id=21666\">Maintenance Planning<\/a>\u00a0|\u00a0<a href=\"http:\/\/141.23.68.248\/wp\/?page_id=21677\">Combined Life Cycle Assessment Analysis<\/a>\u00a0|\u00a0<a href=\"http:\/\/141.23.68.248\/wp\/?page_id=21679\">Multi-Objective-Optimization<\/a>\u00a0|\u00a0<a href=\"http:\/\/141.23.68.248\/wp\/?page_id=22669\">Coding Challenge<\/a>\u00a0|\u00a0<a href=\"http:\/\/141.23.68.248\/wp\/?page_id=21681\">Conclusion &amp; Future Work<\/a><\/h5>\n","protected":false},"excerpt":{"rendered":"<p>In order to be able to explore all the combinations of our 3 systems we had to extend the already exisitng function by another loop that will consider the third system. This means also a<a class=\"read-more\" href=\"http:\/\/141.23.68.248\/wp\/?page_id=22669\">Continue reading<\/a><\/p>\n","protected":false},"author":248,"featured_media":0,"parent":21620,"menu_order":6,"comment_status":"closed","ping_status":"open","template":"page-templates\/page_fullwidth.php","meta":{"footnotes":""},"class_list":["post-22669","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"http:\/\/141.23.68.248\/wp\/index.php?rest_route=\/wp\/v2\/pages\/22669","targetHints":{"allow":["GET"]}}],"collection":[{"href":"http:\/\/141.23.68.248\/wp\/index.php?rest_route=\/wp\/v2\/pages"}],"about":[{"href":"http:\/\/141.23.68.248\/wp\/index.php?rest_route=\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"http:\/\/141.23.68.248\/wp\/index.php?rest_route=\/wp\/v2\/users\/248"}],"replies":[{"embeddable":true,"href":"http:\/\/141.23.68.248\/wp\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=22669"}],"version-history":[{"count":7,"href":"http:\/\/141.23.68.248\/wp\/index.php?rest_route=\/wp\/v2\/pages\/22669\/revisions"}],"predecessor-version":[{"id":22982,"href":"http:\/\/141.23.68.248\/wp\/index.php?rest_route=\/wp\/v2\/pages\/22669\/revisions\/22982"}],"up":[{"embeddable":true,"href":"http:\/\/141.23.68.248\/wp\/index.php?rest_route=\/wp\/v2\/pages\/21620"}],"wp:attachment":[{"href":"http:\/\/141.23.68.248\/wp\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=22669"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}