Algorithm 1 Compute prioritized requirements Input R: set of requirements Input ord1, ..., ordk: partial orders defining priorities and constraints upon R (ordi R R defines a DAG) Output < R1, ...,Rn >: ordered list of requirements 1: initialize Population with a set of ordered lists of requirements {Pri, ...} 2: elicitedPairs := 0 3: maxElicitedPairs := MAX (default = 100) 4: thresholdDisagreement := TH (default = 5) 5: topPopulationPerc := PC (default 5%) 6: eliOrd := 7: for each Pri in Population do 8: compute sum of disagreement for Pri w.r.t. ord1, ..., ordk 9: end for 10: while minDisagreement > thresholdDisagreement execTime < timeOut do 11: sample Population with bias toward lower disagreement, e.g. using tournament selection 12: sort Population by increasing disagreement 13: if minDisagreement did not decrease during last G generations there are ties in the topPopulationPerc of Population elicitedPairs < maxElicitedPairs then 14: eliOrd := eliOrd elicit pairwise comparisons from user for ties 15: increment elicitedPairs by the number of elicited pairwise comparisons 16: end if 17: mutate Population using the requirement-pair-swap mutation operator 18: crossover Population using the cut-head(tail)/fill-intail( head) operator 19: for each Pri in Population do 20: compute sum of disagreement for Pri w.r.t. ord1, ..., ordk, eliOrd 21: update minDisagreement 22: end for 23: end while 24: return Prmin, the requirement list from Population with minimum disagreement I have to understand this algorithm and I appreciate any help. thank you