In multiobjective optimization, how to calculate the distance to reference point?

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
0
down vote

favorite












In multiobjective optimization, what does the distance exactly means, is it:



1) The distance from reference point (V) to an individual (Xi) (candidate solution) in the population (decision space).



 Euclidean Distance = d(Xi,V) 


OR



2) The distance from reference point (V) to the objective vector f(X) in the objective space, where f(Xi) = f(f1(Xi),...fm(Xi)). m is the number of objectives.



Euclidean Distance = d(f(Xi),V) 


In this paper "Harris’s Hawk Multi-Objective Optimizer for Reference
Point Problems", in the pseudo code, Section 4.2:



a-




Calculate distances to reference point v for each search agent(hawk)
Xi on all objectives ݂fm(Xi).




and



b-




Calculate distances to reference point vi for all ݂fm(Xi) on each
search agent in group




What is the difference between a and b?










share|cite|improve this question



























    up vote
    0
    down vote

    favorite












    In multiobjective optimization, what does the distance exactly means, is it:



    1) The distance from reference point (V) to an individual (Xi) (candidate solution) in the population (decision space).



     Euclidean Distance = d(Xi,V) 


    OR



    2) The distance from reference point (V) to the objective vector f(X) in the objective space, where f(Xi) = f(f1(Xi),...fm(Xi)). m is the number of objectives.



    Euclidean Distance = d(f(Xi),V) 


    In this paper "Harris’s Hawk Multi-Objective Optimizer for Reference
    Point Problems", in the pseudo code, Section 4.2:



    a-




    Calculate distances to reference point v for each search agent(hawk)
    Xi on all objectives ݂fm(Xi).




    and



    b-




    Calculate distances to reference point vi for all ݂fm(Xi) on each
    search agent in group




    What is the difference between a and b?










    share|cite|improve this question

























      up vote
      0
      down vote

      favorite









      up vote
      0
      down vote

      favorite











      In multiobjective optimization, what does the distance exactly means, is it:



      1) The distance from reference point (V) to an individual (Xi) (candidate solution) in the population (decision space).



       Euclidean Distance = d(Xi,V) 


      OR



      2) The distance from reference point (V) to the objective vector f(X) in the objective space, where f(Xi) = f(f1(Xi),...fm(Xi)). m is the number of objectives.



      Euclidean Distance = d(f(Xi),V) 


      In this paper "Harris’s Hawk Multi-Objective Optimizer for Reference
      Point Problems", in the pseudo code, Section 4.2:



      a-




      Calculate distances to reference point v for each search agent(hawk)
      Xi on all objectives ݂fm(Xi).




      and



      b-




      Calculate distances to reference point vi for all ݂fm(Xi) on each
      search agent in group




      What is the difference between a and b?










      share|cite|improve this question















      In multiobjective optimization, what does the distance exactly means, is it:



      1) The distance from reference point (V) to an individual (Xi) (candidate solution) in the population (decision space).



       Euclidean Distance = d(Xi,V) 


      OR



      2) The distance from reference point (V) to the objective vector f(X) in the objective space, where f(Xi) = f(f1(Xi),...fm(Xi)). m is the number of objectives.



      Euclidean Distance = d(f(Xi),V) 


      In this paper "Harris’s Hawk Multi-Objective Optimizer for Reference
      Point Problems", in the pseudo code, Section 4.2:



      a-




      Calculate distances to reference point v for each search agent(hawk)
      Xi on all objectives ݂fm(Xi).




      and



      b-




      Calculate distances to reference point vi for all ݂fm(Xi) on each
      search agent in group




      What is the difference between a and b?







      optimization algorithms euclidean-geometry






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Sep 8 at 12:37

























      asked Sep 8 at 12:30









      shdotcom

      12




      12

























          active

          oldest

          votes











          Your Answer




          StackExchange.ifUsing("editor", function ()
          return StackExchange.using("mathjaxEditing", function ()
          StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
          StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
          );
          );
          , "mathjax-editing");

          StackExchange.ready(function()
          var channelOptions =
          tags: "".split(" "),
          id: "69"
          ;
          initTagRenderer("".split(" "), "".split(" "), channelOptions);

          StackExchange.using("externalEditor", function()
          // Have to fire editor after snippets, if snippets enabled
          if (StackExchange.settings.snippets.snippetsEnabled)
          StackExchange.using("snippets", function()
          createEditor();
          );

          else
          createEditor();

          );

          function createEditor()
          StackExchange.prepareEditor(
          heartbeatType: 'answer',
          convertImagesToLinks: true,
          noModals: false,
          showLowRepImageUploadWarning: true,
          reputationToPostImages: 10,
          bindNavPrevention: true,
          postfix: "",
          noCode: true, onDemand: true,
          discardSelector: ".discard-answer"
          ,immediatelyShowMarkdownHelp:true
          );



          );













           

          draft saved


          draft discarded


















          StackExchange.ready(
          function ()
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2909575%2fin-multiobjective-optimization-how-to-calculate-the-distance-to-reference-point%23new-answer', 'question_page');

          );

          Post as a guest



































          active

          oldest

          votes













          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes















           

          draft saved


          draft discarded















































           


          draft saved


          draft discarded














          StackExchange.ready(
          function ()
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2909575%2fin-multiobjective-optimization-how-to-calculate-the-distance-to-reference-point%23new-answer', 'question_page');

          );

          Post as a guest













































































          這個網誌中的熱門文章

          How to combine Bézier curves to a surface?

          Carbon dioxide

          Why am i infinitely getting the same tweet with the Twitter Search API?