{"id":22651,"date":"2025-02-10T11:33:00","date_gmt":"2025-02-10T11:33:00","guid":{"rendered":"http:\/\/141.23.68.248\/wp\/?page_id=22651"},"modified":"2025-02-10T19:32:41","modified_gmt":"2025-02-10T19:32:41","slug":"4-multi-objective-optimization","status":"publish","type":"page","link":"http:\/\/141.23.68.248\/wp\/?page_id=22651","title":{"rendered":"4. Multi-Objective Optimization"},"content":{"rendered":"

Multi-Objective Optimization (MOO) relies on the optimization of functions which may have conflicting parameters. As such, there is no single optimal solution, but instead multiple best solutions which constitute the Pareto front. These solutions have the characteristic that one of the objectives cannot be improved without worsening another objective (Yao et al, 2023). These solutions are considered non-dominated by each other.<\/span><\/p>\n

The R code uses NSGA-II, a genetic algorithm for the multi criteria optimization of the following six objectives:<\/span><\/p>\n

    \n
  1. Total intervention duration<\/span><\/li>\n
  2. Minimum intervention distance<\/span><\/li>\n
  3. Energy consumption<\/span><\/li>\n
  4. CO\u2082 emissions<\/span><\/li>\n
  5. Water usage<\/span><\/li>\n
  6. Total cost<\/span><\/li>\n<\/ol>\n

    In the following table, the examples of the Pareto optimal solutions are shown quantitatively. The bold values show the best values of the listed solutions. As can be seen, it is possible to optimize two objectives (for example, energy and cost), but in this case not more than two. The solution which has the lowest duration of time in maintenance, 40.5 days has the best service score, at only 0.0028% of the lifetime spent offline. However, it scores relatively worse in resource consumption and cost categories. This outcome can be related back to the end users of our project, maintenance planning strategists who must weigh the data and prioritize either service level or resource consumption\/cost objectives, given that there is not one solution that prioritizes them all.<\/span><\/p>\n

    Table 1: Solutions to the code which optimize the input objectives<\/span><\/p>\n\n\n\n\n\n\n\n\n\n\n\n
    Duration (days)<\/span><\/td>\ninterv.dist<\/span><\/td>\nenergy<\/span><\/td>\nCO\u2082<\/span><\/strong><\/td>\nH\u2082O<\/span><\/strong><\/td>\nCost (billion EUR)<\/span><\/td>\n<\/tr>\n
    56.5<\/span><\/td>\n-1<\/b><\/td>\n969573467<\/span><\/td>\n6133.831<\/span><\/td>\n890.7919<\/span><\/td>\n0.1242664<\/span><\/td>\n<\/tr>\n
    47<\/span><\/td>\n-1<\/span><\/td>\n969573467<\/span><\/td>\n6387.66<\/span><\/td>\n1038.0754<\/span><\/td>\n0.1242732<\/span><\/td>\n<\/tr>\n
    55<\/span><\/td>\n-1<\/span><\/td>\n353878147<\/b><\/td>\n7149.147<\/span><\/td>\n1479.9257<\/span><\/td>\n0.0454848<\/b><\/td>\n<\/tr>\n
    49.5<\/span><\/td>\n-1<\/span><\/td>\n1585268786<\/span><\/td>\n5626.173<\/b><\/td>\n596.225<\/b><\/td>\n0.2030617<\/span><\/td>\n<\/tr>\n
    47<\/span><\/td>\n-1<\/span><\/td>\n969573467<\/span><\/td>\n6387.66<\/span><\/td>\n1038.0754<\/span><\/td>\n0.1242732<\/span><\/td>\n<\/tr>\n
    40.5<\/b><\/td>\n-1<\/span><\/td>\n1791020251<\/span><\/td>\n5144700.71<\/span><\/td>\n4853759.613<\/span><\/td>\n0.3712642<\/span><\/td>\n<\/tr>\n
    45<\/span><\/td>\n-2<\/span><\/td>\n1790963897<\/span><\/td>\n4293052.974<\/span><\/td>\n4045053.423<\/span><\/td>\n0.3477393<\/span><\/td>\n<\/tr>\n
    45<\/span><\/td>\n-2<\/span><\/td>\n970093158<\/span><\/td>\n5143939.223<\/span><\/td>\n4853317.763<\/span><\/td>\n0.266165<\/span><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

    One of the strengths of MOO is in analyzing life cycle objectives which in effect are the sum of many more specific objectives (De Weck, 2004). In the case of this project, those are most prominently reliability and maintainability. We are illustrating the relationship between short term objectives such as cost, resources use and downtime and these more abstract life cycle objectives, with the decision making still relying on the end-user in order to determine which of these objectives should be prioritized. Figure 1 below shows a graphical summary of all the Pareto-optimal solutions, where the straight lines connecting the\u00a0CO\u2082 and\u00a0H\u2082O<\/span><\/strong> categories show how these solutions are often linked in being optimal or equally sub-optimal.<\/p>\n

    \"paretoplot1\"<\/a><\/p>\n

    Figure 1: Parallel coordinate plot of Pareto optimal solutions (red) to visualize the trade-offs necessary to optimize<\/span><\/strong><\/p>\n

     <\/p>\n

    Sources:<\/p>\n

    De Weck, O. L. (2004). <\/span>Multiobjective Optimization: History and Promise<\/span><\/i> [Invited Keynote Paper, GL2-2]. Third China-Japan-Korea Joint Symposium on Optimization of Structural and Mechanical Systems, Kanazawa.<\/span><\/strong><\/p>\n

    Yao, H., Xu, Z., Hou, Y., Dong, Q., Liu, P.,\u00a0 Ye, Z., Pei, X., Oeser, M., Wang, L., & Wang, D. (2023). Advanced industrial informatics towards smart, safe and sustainable roads: A state of the art. <\/span>Journal of Traffic and Transportation Engineering (English Edition), 10<\/span><\/i>(2), 143-158. <\/span>https:\/\/doi.org\/10.1016\/j.jtte.2023.02.001<\/span><\/a><\/strong><\/p>\n

    \u2190 Previous Page: Life Cycle Analysis<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"

    Multi-Objective Optimization (MOO) relies on the optimization of functions which may have conflicting parameters. As such, there is no single optimal solution, but instead multiple best solutions which constitute the Pareto front. These solutions haveContinue reading<\/a><\/p>\n","protected":false},"author":236,"featured_media":0,"parent":19580,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-22651","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"http:\/\/141.23.68.248\/wp\/index.php?rest_route=\/wp\/v2\/pages\/22651","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\/236"}],"replies":[{"embeddable":true,"href":"http:\/\/141.23.68.248\/wp\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=22651"}],"version-history":[{"count":8,"href":"http:\/\/141.23.68.248\/wp\/index.php?rest_route=\/wp\/v2\/pages\/22651\/revisions"}],"predecessor-version":[{"id":23509,"href":"http:\/\/141.23.68.248\/wp\/index.php?rest_route=\/wp\/v2\/pages\/22651\/revisions\/23509"}],"up":[{"embeddable":true,"href":"http:\/\/141.23.68.248\/wp\/index.php?rest_route=\/wp\/v2\/pages\/19580"}],"wp:attachment":[{"href":"http:\/\/141.23.68.248\/wp\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=22651"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}