Procedure non-dominated_sorting (P) input: Population solutions output: Pareto sorting solutions set Step1. //create the Pareto level 1 For each solution ke P Sk; //memory the solutions which are dominated by k nk = = 0 //the number of solutions which dominate k Step 1.1 For each solution uЄ P if (ku) Sk = Sk U{u} if (uk)nk=nk End for +1 Step 1.2 //store the Pareto level 1 if n₁ =0 ₁ = End for {k} Step 2. //fetch the Pareto level 2 from Pareto level 1, and then fetch the Pareto level 3 from level 2, and so on. Step 2.1 i=1 Step 2.2 if (0), then ;+1 = 0. For each solution ke г; For each solution uЄ Sk nu-nu-1 if n₁ =0 г¡+₁ =П₁₁₁ ~{u} End for End for i+1 i+1 Step 2.3 i=i+1; go back to step 2.2
Procedure non-dominated_sorting (P) input: Population solutions output: Pareto sorting solutions set Step1. //create the Pareto level 1 For each solution ke P Sk; //memory the solutions which are dominated by k nk = = 0 //the number of solutions which dominate k Step 1.1 For each solution uЄ P if (ku) Sk = Sk U{u} if (uk)nk=nk End for +1 Step 1.2 //store the Pareto level 1 if n₁ =0 ₁ = End for {k} Step 2. //fetch the Pareto level 2 from Pareto level 1, and then fetch the Pareto level 3 from level 2, and so on. Step 2.1 i=1 Step 2.2 if (0), then ;+1 = 0. For each solution ke г; For each solution uЄ Sk nu-nu-1 if n₁ =0 г¡+₁ =П₁₁₁ ~{u} End for End for i+1 i+1 Step 2.3 i=i+1; go back to step 2.2
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
can you draw a proper flowchart with appropriate flowchart shapes and interpret this pseudo code regarding pareto non-dominated sorting
![Procedure non-dominated_sorting (P)
input: Population solutions
output: Pareto sorting solutions set
Step1. //create the Pareto level 1
For each solution ke P
Sk; //memory the solutions which are dominated by k
nk
=
= 0 //the number of solutions which dominate k
Step 1.1 For each solution uЄ P
if (ku) Sk = Sk U{u}
if (uk)nk=nk
End for
+1
Step 1.2 //store the Pareto level 1
if n₁ =0 ₁ =
End for
{k}
Step 2. //fetch the Pareto level 2 from Pareto level 1, and then fetch the Pareto level 3
from level 2, and so on.
Step 2.1 i=1
Step 2.2 if (0), then ;+1 = 0.
For each solution ke г;
For each solution uЄ Sk
nu-nu-1
if n₁ =0 г¡+₁ =П₁₁₁ ~{u}
End for
End for
i+1
i+1
Step 2.3 i=i+1; go back to step 2.2](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F44139cc2-9f6a-4989-904c-f8119b50ea31%2F462d43dc-ecdb-41f7-80c7-ec2ad35d93b5%2Fv89e7bu_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Procedure non-dominated_sorting (P)
input: Population solutions
output: Pareto sorting solutions set
Step1. //create the Pareto level 1
For each solution ke P
Sk; //memory the solutions which are dominated by k
nk
=
= 0 //the number of solutions which dominate k
Step 1.1 For each solution uЄ P
if (ku) Sk = Sk U{u}
if (uk)nk=nk
End for
+1
Step 1.2 //store the Pareto level 1
if n₁ =0 ₁ =
End for
{k}
Step 2. //fetch the Pareto level 2 from Pareto level 1, and then fetch the Pareto level 3
from level 2, and so on.
Step 2.1 i=1
Step 2.2 if (0), then ;+1 = 0.
For each solution ke г;
For each solution uЄ Sk
nu-nu-1
if n₁ =0 г¡+₁ =П₁₁₁ ~{u}
End for
End for
i+1
i+1
Step 2.3 i=i+1; go back to step 2.2
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education