Optimisasi

UJian Akhir Semester

Email: nicholasandrian6509@gmail.com
RPubs: https://rpubs.com/Nicholas321

---

1 Soal 1

Let say you would like to make some sausages and you have the following ingredients available:

Sausage recipe in $/kg

ingredient	cost_dollar	availability_kg
Chicken	4.32	30
Wheat	2.46	20
Starch	1.86	17

Assume that you will make 2 types of sausage:

• Economy (>40% Chicken)

• Premium (>60% Chicken)

• One sausage is 50 grams (0.05 kg)

According to government regulations of Indonesia:

• The most starch you can use in your sausages is 25%.

• You have a contract with a butcher, and have already purchased 23 kg Chicken, that must go in your sausages.

• You have a demand for 350 economy sausages and 500 premium sausages.

So, please figure out how to optimize the cost effectively to blend your sausages.

1.1 Answer

The model of our problem:

• \(c\) = chicken in sausage for economy type

• \(w\) = wheat in sausage for economy type

• \(s\) = starch in sausage for economy type

• \(cp\) = chicken in sausage for premium type

• \(wp\) = wheat in sausage for premium type

• \(sp\) = starch in sausage for premium type

We want to minimize the cost

\[Cost = 4.32 (c + cp) + 2.46 (w + wp) + 1.86 (s + sp)\] The constraints:

c + w + s = (350 x 0.05) c + w + s = 17.5

cp + wp + sp = (500 x 0.05) cp + wp + sp = 25

c ≥ 0.4 (c + w + s) c ≥ 0.4c + 0.4w + 0.4s 0.6 c - 0.4 w - 0.4 s ≥ 0

cp ≥ 0.6 (cp + wp + sp) cp ≥ 0.6cp + 0.6wp + 0.6 sp 0.4cp - 0.6wp - 0.6sp ≥ 0

se ≤ 0.25 (c + w + s) s ≤ 0.25c + 0.25w + 0.25s -0.25c - 0.25w +0.75s ≤ 0

sp ≤ 0.25 (cp+ wp + sp) sp ≤ 0.25cp + 0.25wp + 0.25sp -0.25cp - 0.25wp + 0.75sp ≤ 0

c + cp ≤ 30

w + wp ≤ 20

s + sp ≤ 17

c + cp ≥ 23

then , after we know that constraints , then we can put it into this code below

x <- c(4.32,4.32,2.46,2.46, 1.86,1.86)
x

## [1] 4.32 4.32 2.46 2.46 1.86 1.86

b <- matrix(c (1,0,1,0,1,0,
            0,1,0,1,0,1,
            0.6,0,-0.4,0,-0.4,0,
            0,0.4,0,-0.6,0,-0.6,
            -0.25,0,-0.25,0,0.75,0,
            0,-0.25,0,-0.25,0,0.75,
            1,1,0,0,0,0,
            0,0,1,1,0,0,
            0,0,0,0,1,1,
            1,1,0,0,0,0), ncol=6, byrow=T)
b

##        [,1]  [,2]  [,3]  [,4]  [,5]  [,6]
##  [1,]  1.00  0.00  1.00  0.00  1.00  0.00
##  [2,]  0.00  1.00  0.00  1.00  0.00  1.00
##  [3,]  0.60  0.00 -0.40  0.00 -0.40  0.00
##  [4,]  0.00  0.40  0.00 -0.60  0.00 -0.60
##  [5,] -0.25  0.00 -0.25  0.00  0.75  0.00
##  [6,]  0.00 -0.25  0.00 -0.25  0.00  0.75
##  [7,]  1.00  1.00  0.00  0.00  0.00  0.00
##  [8,]  0.00  0.00  1.00  1.00  0.00  0.00
##  [9,]  0.00  0.00  0.00  0.00  1.00  1.00
## [10,]  1.00  1.00  0.00  0.00  0.00  0.00

a <- c(17.5,25,0,0,0,0,30,20,17,23)
a

##  [1] 17.5 25.0  0.0  0.0  0.0  0.0 30.0 20.0 17.0 23.0

Direction of the constraints

constraints_direction <-c("=","=",">=",">=","<=","<=","<=","<=","<=",">=")
constraints_direction

##  [1] "="  "="  ">=" ">=" "<=" "<=" "<=" "<=" "<=" ">="

library(lpSolve)

## Warning: package 'lpSolve' was built under R version 3.6.2

optimum <- lp(direction ="min",
              objective.in= x,
              const.mat = b,
              const.dir = constraints_direction,
              const.rhs = a,
              all.int = T)
str(optimum)

## List of 28
##  $ direction       : int 0
##  $ x.count         : int 6
##  $ objective       : num [1:6] 4.32 4.32 2.46 2.46 1.86 1.86
##  $ const.count     : int 10
##  $ constraints     : num [1:8, 1:10] 1 0 1 0 1 0 3 17.5 0 1 ...
##   ..- attr(*, "dimnames")=List of 2
##   .. ..$ : chr [1:8] "" "" "" "" ...
##   .. ..$ : NULL
##  $ int.count       : int 6
##  $ int.vec         : int [1:6] 1 2 3 4 5 6
##  $ bin.count       : int 0
##  $ binary.vec      : int 0
##  $ num.bin.solns   : int 1
##  $ objval          : num 0
##  $ solution        : num [1:6] 0 0 0 0 0 0
##  $ presolve        : int 0
##  $ compute.sens    : int 0
##  $ sens.coef.from  : num 0
##  $ sens.coef.to    : num 0
##  $ duals           : num 0
##  $ duals.from      : num 0
##  $ duals.to        : num 0
##  $ scale           : int 196
##  $ use.dense       : int 0
##  $ dense.col       : int 0
##  $ dense.val       : num 0
##  $ dense.const.nrow: int 0
##  $ dense.ctr       : num 0
##  $ use.rw          : int 0
##  $ tmp             : chr "Nobody will ever look at this"
##  $ status          : int 2
##  - attr(*, "class")= chr "lp"

print(optimum$status)

## [1] 2

The result is 2, that is mean there is no feasible solution for 350 economy sausages and 500 premium sausages.

2 Soal 2

Please find out the optimization problem of using Multinomial Linear Regression and Nonlinear Regression at Rpubs or Kaggle (translate and submit it to your Rpubs)!

library(deSolve)
library(nlme)
library(plotly)
#library(bbmle)
library(reshape2)

simulasikan datanya

set.seed(123)
x <- seq(0, 50, 1)
y <- ((runif(1, 10, 20) * x) / (runif(1, 0, 10) + x)) + rnorm(51, 0, 1)
plot(x, y,
     main = "Simulated data",
     xlab = "Independent variable",
     ylab = "Dependent variable",
     col = 9,
     las = 1)

Menggunakan persamaan Michaelis-Menten (laju reaksi enzimatik)

\[v=\frac{V_{\text{max}}\left[S\right]}{K_M + \left[S\right]}\tag{1}\]

lalu kita inisialkan nilai awal ke 1

m <- nls(y ~ a * x / (b + x), start = list(a = 1, b = 1))

cor(y, predict(m))

## [1] 0.9420521

plot(x, y,
     main = "Simulated data",
     xlab = "Independent variable",
     ylab = "Dependent variable",
     col = 9,
     las = 1)
lines(x, predict(m),
      lty = 2,
      col = "red",
      lwd = 3)

Nilai awal yang benar diperlukan

• Mulailah dengan mengamati plot dan menggunakan pengetahuan Anda tentang persamaan

set.seed(123)
y <- runif(1, 5, 15) * exp(-runif(1, 0.01, 0.05) * x) + rnorm(51, 0, 0.5)
plot(x, y,
     main = "Simulated data",
     xlab = "Independent variable",
     ylab = "Dependent variable",
     col = 9,
     las = 1)

Gunakan nilai-nilai ini: - a adalah nilai y saat \(x=0\) - b adalah tingkat kerusakan

Persamaan kita adalah \(Y=Ae^{-BX}\) dan \(b_{\text{initial}}=-2\frac{\ln{2}}{a_{\text{initial}}}\)

a_start <- 8
b_start <- -2 * log(2)/a_start

m <- nls(y ~ a * exp(-b * x), start = list(a = a_start,
                                           b = b_start))
cor(y ,predict(m))

## [1] 0.9758937

plot(x, y,
     main = "Simulated data",
     xlab = "Independent variable",
     ylab = "Dependent variable",
     col = 9,
     las = 1)
lines(x, predict(m),
      lty = 2,
      col = "red",
      lwd = 3)

Menggunakan fungsi SelfStarting

Menggunakan model pertumbuhan populasi logistik yang diberikan oleh persamaan (2)

\[\frac{dN}{dt}=RN\left(1-\frac{N}{K}\right)\tag{2}\]

simulasikan data

log_growth <- function(time, st, params){
  with(as.list(c(st, params)),{
    dN <- R * N * (1 - N/K)
    return(list(c(dN)))
  })
}

params <- c(R = 0.2, K = 1000)  # Parameters for logistic growth
N_ini <- c(N = 1)  # Initial values
times <- seq(0, 50, 1)  # Time steps to evaluate the ODE

out <- ode(N_ini, times, log_growth, params)  # ODE

set.seed(123)
N_obs <- out[, 2] + rnorm(51, 0, 50)  # Add random noise

N_obs <- ifelse(N_obs < 1, 1, N_obs) # Restrict smallest value of N_obs to be 1

plot(times, N_obs,
     main = "Simulated data",
     xlab = "Time",
     ylab = "Dependent variable",
     col = 9,
     las = 1)

R memiliki fungsi bawaan untuk memperkirakan nilai awal parameter persamaan logistik SSLogis

\[N_t = \frac{\alpha}{1 + e^{\frac{x_{\text{mid}}-t}{\text{scale}}}}\tag{3}\]

• Gunakan getInitial yang menghitung beberapa tebakan awal untuk parameter yang diberikan data
• Meneruskan model yang dimulai sendiri ke fungsi ini

ss <- getInitial(N_obs ~ SSlogis(times,
                                 alpha,
                                 xmid,
                                 scale),
                 data = data.frame(N_obs = N_obs,  # Pass data set as a data frame
                                   times = times))
ss

##      alpha       xmid      scale 
## 985.747083  34.169811   4.810827

SSLogis menggunakan parameterisasi yang berbeda dari masalah kita, jadi diperlukan beberapa aljabar

K_start <- ss["alpha"]
R_start <- 1 / ss["scale"]
N0_start <- ss["alpha"] / (exp(ss["xmid"] / ss["scale"]) + 1)

• Formula \(N_{t}=\frac{KN_{0}e^{Rt}}{K+N_{0}e^{Rt}-1}\)

log_formula <- formula(N_obs ~ K * N0 * exp(R * times) / (K + N0 * (exp(R * times) - 1)))  # Logistic growth
m<-nls(log_formula,
       start = list(K = K_start,
                    R = R_start,
                    N0 = N0_start))
summary(m)

## 
## Formula: N_obs ~ K * N0 * exp(R * times)/(K + N0 * (exp(R * times) - 1))
## 
## Parameters:
##           Estimate Std. Error t value Pr(>|t|)    
## K.alpha  985.74708   27.58937  35.729   <2e-16 ***
## R.scale    0.20786    0.01366  15.216   <2e-16 ***
## N0.alpha   0.81049    0.34976   2.317   0.0248 *  
## ---
## Signif. codes:  0 '***' 0.001 '**' 0.01 '*' 0.05 '.' 0.1 ' ' 1
## 
## Residual standard error: 42.73 on 48 degrees of freedom
## 
## Number of iterations to convergence: 0 
## Achieved convergence tolerance: 1.145e-06

cor(N_obs, predict(m))

## [1] 0.993136

plot(times, N_obs,
     main = "Simulated data",
     xlab = "Time",
     ylab = "Dependent variable",
     col = 9,
     las = 1)
lines(times, predict(m),
      col = "red",
      lty = 2,
      lwd = 3)

Pengaruh prediktor pada regresi non-linier

• Gunakan fungsi pertumbuhan logistik dengan parameter rmenjadi tingkat pertumbuhan, K adalah ukuran populasi ekuilibrium, dan n0 menjadi ukuran populasi awal

• Tiga percobaan (tiga kondisi)

Ks <- c(100, 200, 150) 
n0 <- c(5, 5, 6)
r <- c(0.15, 0.2, 0.15)
time <- 1:50

logF <- function(time, K, n0, r){
  d <- K * n0 * exp(r*time) / (K + n0 * (exp(r*time) - 1))
  return(d)
}

set.seed(123)
dat <- data.frame(Group = character(),
                  Time = numeric(),
                  Count = numeric())

for(i in 1:3){
  Ab <- logF(time = time, K = Ks[i], n0 = n0[i], r = r[i])
  tmp <- data.frame(Group = paste0("G", i), Time = time,
                    Count = Ab + rnorm(time, 0, 5))
  dat <-rbind(dat, tmp)
}
head(dat)

##   Group Time     Count
## 1    G1    1  2.960164
## 2    G1    2  5.482371
## 3    G1    3 15.418436
## 4    G1    4  9.103423
## 5    G1    5 10.671537
## 6    G1    6 20.036875

plot_ly(data = dat,
        x = ~Time,
        y = ~Count,
        color = ~Group,
        type = "scatter",
        mode = "markers") %>% 
  layout(title = "Growth over time for three groups",
         yaxis = list(zeroline = F))

## Warning: `arrange_()` is deprecated as of dplyr 0.7.0.
## Please use `arrange()` instead.
## See vignette('programming') for more help
## This warning is displayed once every 8 hours.
## Call `lifecycle::last_warnings()` to see where this warning was generated.

lF <- formula(Count ~ K * n0 * exp(r * Time) / (K + n0 * (exp(r * Time) - 1)) | Group)

3 Soal 3

Please read this link RPubs - https://rpubs.com/Argaadya/moea (translate and submit to your Rpubs).

3.1 Optimasi Portofolio dengan 3 Objektivitas

Masalah ini direplikasi dari studi Anagnostopolous dan Mamanis, yang melibatkan 3 fungsi objektif. Studi ini menggunakan MOEA untuk pemilihan portofolio dan pengoptimalan dalam manajemen investasi.

Masalah pengoptimalan portofolio berkaitan dengan pengelolaan aset portofolio yang meminimalkan risiko objektif yang menjadi kendala untuk menjamin tingkat pengembalian tertentu. Salah satu prinsip fundamental dari investasi keuangan adalah diversifikasi dimana investor mendiversifikasi investasinya menjadi berbagai jenis aset. Diversifikasi portofolio meminimalkan eksposur investor terhadap risiko, dan memaksimalkan pengembalian portofolio. Dalam beberapa kasus, sangat sulit bagi pengambil keputusan untuk mengetahui sebelumnya jumlah optimal sekuritas yang harus dimasukkan ke dalam portofolionya tanpa memeriksa semua tradeoff antara risiko, pengembalian dan kardinalitas portofolio. Bagaimanapun, seorang investor mungkin kehilangan solusi penting dengan tradeoff besar antara objekt ketika dia dipaksa untuk memperbaiki jumlah aset dalam portofolio sebelumnya.

Fungsi tujuan terdiri dari:

1. Memaksimalkan Return

Return

\[max \ μ(x)=∑_{i=1}^N x_i \ μ_i\]

\(mu (x)\): rata-rata total pengembalian atau return

\(x_i\) : berat/berat aset \(i\)

\(mu_i\) : rata-rata pengembalian aset \(i\)

2. Meminimalkan Resiko

Risiko portofolio diwakili oleh varians pengembalian.

\[min \ ρ (x) = ∑_{i = 1}^N ∑_{j = 1} ^N x_i \ x_j \ σ_{ij}\]

\(ρ (x)\) : total risiko portofolio \(σ_{ij}\): kovariansi antara aset \(i\) dan \(j\)

Meminimalkan Jumlah Aset

Jumlah aset diminimalkan. Banyaknya aset merupakan penjumlahan dari seluruh aset yang memiliki bobot > 0.

\[min \ card(x) = ∑_{i = 1} ^N 1_{x \ > \ 0}\]

\(card (x)\): jumlah aset

Tunduk pada

\[∑_{i = 1}^N x_i = 1\]

\[0 \ ≤\ x_i \ ≤ \ 1\]

3.2 Mengimport Data

Data diperoleh dari Bursa Efek New York di Kaggle (https://www.kaggle.com/dgawlik/nyse). Kami hanya akan menggunakan data dari Januari hingga Maret 2015 untuk ilustrasi.

# Library
library(ranger)
library(scales)
library(plotly)
library(tidyverse)
library(lubridate)

nyse <- read.csv("prices.csv")

nyse <- nyse %>% 
  mutate(date = ymd(date)) %>% 
  filter(year(date) == 2015,
         month(date) %in% c(1:3))

head(nyse)

##         date symbol   open  close    low   high   volume
## 1 2015-01-02      A  41.18  40.56  40.37  41.31  1529200
## 2 2015-01-02    AAL  54.28  53.91  53.07  54.60 10748600
## 3 2015-01-02    AAP 160.85 158.56 157.47 162.50   509800
## 4 2015-01-02   AAPL 111.39 109.33 107.35 111.44 53204600
## 5 2015-01-02   ABBV  65.44  65.89  65.44  66.40  5086100
## 6 2015-01-02    ABC  90.61  90.46  89.82  91.32  1124600

Untuk mendapatkan nama perusahaan yang lebih jelas, mari kita impor Simbol Ticker dan Keamanan

securities <- read.csv("securities.csv")

securities <- securities %>% 
  select(Ticker.symbol, Security) %>% 
  rename(symbol = Ticker.symbol,
         name = Security)

Gabungkan yang di atas dengan data price

nyse <- nyse %>% 
   left_join(securities, by = c("symbol")) %>% 
   select(date, symbol, name, everything())

head(nyse)

##         date symbol                     name   open  close    low   high
## 1 2015-01-02      A Agilent Technologies Inc  41.18  40.56  40.37  41.31
## 2 2015-01-02    AAL  American Airlines Group  54.28  53.91  53.07  54.60
## 3 2015-01-02    AAP       Advance Auto Parts 160.85 158.56 157.47 162.50
## 4 2015-01-02   AAPL               Apple Inc. 111.39 109.33 107.35 111.44
## 5 2015-01-02   ABBV                   AbbVie  65.44  65.89  65.44  66.40
## 6 2015-01-02    ABC   AmerisourceBergen Corp  90.61  90.46  89.82  91.32
##     volume
## 1  1529200
## 2 10748600
## 3   509800
## 4 53204600
## 5  5086100
## 6  1124600

Mari kita batasi jumlah saham yang tersedia sehingga hanya 30 saham yang dipilih secara acak. Terlalu banyak pilihan akan menghasilkan waktu proses yang lebih lama. Karena ini hanya perkenalan, saya akan menguranginya.

set.seed(13)
selected_stock <- sample(nyse$symbol, 30)

nyse <- nyse %>% 
  filter(symbol %in% selected_stock)
head(nyse)

##         date symbol               name  open  close   low   high  volume
## 1 2015-01-02    CAG ConAgra Foods Inc. 36.22  35.82 35.81  36.29 5126400
## 2 2015-01-02    CBS          CBS Corp. 55.75  54.79 54.46  55.77 4328900
## 3 2015-01-02   COTY          Coty, Inc 20.76  20.43 20.36  21.06  686000
## 4 2015-01-02    CPB      Campbell Soup 44.10  44.00 43.80  44.27 1032400
## 5 2015-01-02    CXO   Concho Resources 99.69 101.01 97.46 102.52 1034300
## 6 2015-01-02    DAL    Delta Air Lines 49.92  49.18 48.71  50.01 8637300

3.3 Mengkalkulasi Return

Mari mengkalkulasikan return harian

nyse <- nyse %>%   
  rename(price = close) %>% 
  select(date, symbol, name, price) %>% 
  group_by(symbol, name) %>%
  mutate(price_prev = lag(price),
         returns = (price - price_prev)/price_prev) %>% 
  slice(-1) %>% 
  ungroup()

head(nyse)

## # A tibble: 6 x 6
##   date       symbol name               price price_prev  returns
##   <date>     <fct>  <fct>              <dbl>      <dbl>    <dbl>
## 1 2015-01-05 CAG    ConAgra Foods Inc.  35.4       35.8 -0.0109 
## 2 2015-01-06 CAG    ConAgra Foods Inc.  35.1       35.4 -0.00988
## 3 2015-01-07 CAG    ConAgra Foods Inc.  35.9       35.1  0.0237 
## 4 2015-01-08 CAG    ConAgra Foods Inc.  36.7       35.9  0.0217 
## 5 2015-01-09 CAG    ConAgra Foods Inc.  36.2       36.7 -0.0123 
## 6 2015-01-12 CAG    ConAgra Foods Inc.  35.7       36.2 -0.0155

Mari menghitung rata-rata return dari setiap stock

mean_stock <- nyse %>% 
  group_by(symbol) %>% 
  summarise(mean = mean(returns)) %>% 
  arrange(desc(mean))

## `summarise()` ungrouping output (override with `.groups` argument)

head(mean_stock)

## # A tibble: 6 x 2
##   symbol    mean
##   <fct>    <dbl>
## 1 COTY   0.00312
## 2 CXO    0.00264
## 3 NEM    0.00227
## 4 CBS    0.00181
## 5 HRL    0.00168
## 6 PSX    0.00164

Nilai \(R_f\) diperoleh dari suku bunga terbaru pada tiga bulan tagihan Treasury AS . Karena datanya dari tahun 2016, kita akan menggunakan data dari tahun 2015 (Gunakan data dari 27 Maret 2015), yaitu 0,04%. Tarif diperoleh dari https://ycharts.com/indicators/3_month_t_bill.

rf <- 0.04/100

3.4 Matriks Kovariansi Antar Portofolio

Hitung matriks kovariansi antar portofolio. Pertama, kita perlu memisahkan return masing-masing portofolio menjadi beberapa kolom dengan cara menyebarkannya.

nyse_wide <- nyse %>%
  pivot_wider(id_cols = c(date, symbol), names_from = symbol, values_from = returns) %>% 
  select(-date)

# Create Excess Return
for (i in 1:n_distinct(nyse$symbol)) {
  nyse_wide[,i]<- nyse_wide[,i] - as.numeric(mean_stock[i,2])
}
  
head(nyse_wide)

## # A tibble: 6 x 29
##       CAG      CBS     COTY      CPB     CXO      DAL       ED      GWW      HCP
##     <dbl>    <dbl>    <dbl>    <dbl>   <dbl>    <dbl>    <dbl>    <dbl>    <dbl>
## 1 -0.0140 -0.0123  -0.00521 -0.0170  -0.0502 -0.0183  -0.0110  -2.59e-2  8.82e-3
## 2 -0.0130 -0.0224  -0.00963 -0.00850 -0.0218 -0.0252   0.00413 -1.57e-2  1.78e-2
## 3  0.0205 -0.00414  0.00119  0.0423  -0.0249 -0.00693  0.0133  -5.83e-4  2.00e-2
## 4  0.0186  0.00922  0.00611  0.0113   0.0463  0.0243   0.00477  2.08e-2 -1.46e-2
## 5 -0.0154  0.0126  -0.0316  -0.00466  0.0296 -0.0288  -0.00668 -1.31e-2 -1.33e-4
## 6 -0.0186  0.00268 -0.0295   0.00150 -0.0453 -0.0191  -0.00492 -1.39e-2  1.47e-2
## # ... with 20 more variables: HRB <dbl>, HRL <dbl>, HSIC <dbl>, KEY <dbl>,
## #   KSU <dbl>, MAS <dbl>, MTD <dbl>, NEM <dbl>, PG <dbl>, PNC <dbl>, PSX <dbl>,
## #   SCG <dbl>, SLB <dbl>, TGT <dbl>, TMK <dbl>, TROW <dbl>, USB <dbl>,
## #   WDC <dbl>, WHR <dbl>, ZION <dbl>

Buatlah kovarian matrix

nyse_cov <- cov(x = nyse_wide)

3.5 Tentukan Fungsi Fitness

Mari kita tentukan fungsi fitness.

fitness <- function(x){
  # Tetapkan bobot untuk setiap saham
  weight_stock <- x
  
 # Menghitung total return
 f1 <- numeric()
 for (i in 1:n_distinct(nyse$symbol)) {
   f1[i] <- weight_stock[i]*mean_stock$mean[i]
 }
 mean_return <- sum(f1) - 1e9 * (round(sum(weight_stock),10)-1)^2 
 
 # Menghitung total resiko
 f2 <- numeric()
 for (i in 1:n_distinct(nyse$symbol)) {
   f3 <- numeric()
   
   for (j in 1:n_distinct(nyse$symbol)) {
    f3[j] <- weight_stock[i]*weight_stock[j]*nyse_cov[i,j]
   }
 f2[i] <- sum(f3)
 }
 risk <- sum(f2) + 1e9 * (round(sum(weight_stock),10)-1)^2
 
 # Menghitung Jumlah Aset
 card <- length(weight_stock[weight_stock > 0]) 
 
 return(c(-mean_return, risk, card))
}

3.6 Menjalankan Algoritma

Algoritma NSGA-II dapat dijalankan dengan fungsi nsga2() dari paket nsga2R.

library(nsga2R)

Berikut beberapa parameter untuk fungsi tersebut:

• fn : fungsi fitness yang akan diminimalkan

• varNo : Jumlah variabel keputusan

• objDim : Jumlah fungsi tujuan

• lowerBounds: Batas bawah dari setiap variabel keputusan

• upperBounds: Batas atas setiap variabel keputusan

• popSize : Ukuran populasi

• generations: Jumlah generasi

Kami akan menjalankan algoritma untuk 1000 iterasi, dengan ukuran populasi 200. Probabilitas mutasi adalah 0,2 sedangkan probabilitas untuk crossover adalah 0,8.

set.seed(123)
n_asset <- n_distinct(nyse$symbol)
finance_optim <- nsga2R(fn = fitness, varNo = n_asset, objDim = 3, generations = 1000,
                        mprob = 0.2, popSize = 200, cprob = 0.8,
                        lowerBounds = rep(0, n_asset), upperBounds = rep(1, n_asset))

## ********** R based Nondominated Sorting Genetic Algorithm II *********
## initializing the population
## ranking the initial population
## crowding distance calculation
## ---------------generation--------------- 1 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 1 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 2 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 2 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 3 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 3 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 4 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 4 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 5 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 5 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 6 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 6 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 7 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 7 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 8 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 8 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 9 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 9 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 10 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 10 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 11 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 11 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 12 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 12 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 13 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 13 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 14 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 14 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 15 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 15 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 16 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 16 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 17 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 17 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 18 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 18 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 19 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 19 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 20 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 20 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 21 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 21 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 22 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 22 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 23 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 23 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 24 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 24 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 25 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 25 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 26 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 26 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 27 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 27 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 28 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 28 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 29 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 29 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 30 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 30 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 31 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 31 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 32 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 32 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 33 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 33 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 34 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 34 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 35 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 35 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 36 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 36 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 37 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 37 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 38 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 38 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 39 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 39 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 40 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 40 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 41 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 41 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 42 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 42 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 43 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 43 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 44 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 44 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 45 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 45 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 46 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 46 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 47 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 47 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 48 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 48 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 49 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 49 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 50 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 50 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 51 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 51 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 52 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 52 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 53 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 53 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 54 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 54 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 55 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 55 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 56 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 56 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 57 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 57 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 58 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 58 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 59 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 59 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 60 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 60 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 61 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 61 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 62 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 62 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 63 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 63 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 64 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 64 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 65 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 65 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 66 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 66 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 67 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 67 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 68 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 68 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 69 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 69 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 70 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 70 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 71 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 71 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 72 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 72 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 73 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 73 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 74 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 74 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 75 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 75 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 76 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 76 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 77 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 77 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 78 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 78 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 79 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 79 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 80 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 80 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 81 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 81 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 82 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 82 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 83 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 83 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 84 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 84 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 85 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 85 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 86 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 86 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 87 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 87 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 88 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 88 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 89 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 89 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 90 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 90 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 91 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 91 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 92 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 92 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 93 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 93 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 94 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 94 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 95 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 95 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 96 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 96 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 97 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 97 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 98 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 98 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 99 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 99 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 100 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 100 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 101 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 101 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 102 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 102 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 103 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 103 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 104 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 104 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 105 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 105 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 106 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 106 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 107 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 107 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 108 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 108 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 109 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 109 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 110 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 110 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 111 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 111 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 112 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 112 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 113 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 113 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 114 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 114 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 115 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 115 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 116 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 116 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 117 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 117 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 118 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 118 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 119 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 119 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 120 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 120 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 121 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 121 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 122 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 122 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 123 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 123 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 124 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 124 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 125 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 125 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 126 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 126 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 127 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 127 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 128 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 128 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 129 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 129 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 130 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 130 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 131 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 131 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 132 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 132 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 133 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 133 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 134 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 134 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 135 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 135 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 136 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 136 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 137 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 137 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 138 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 138 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 139 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 139 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 140 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 140 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 141 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 141 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 142 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 142 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 143 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 143 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 144 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 144 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 145 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 145 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 146 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 146 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 147 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 147 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 148 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 148 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 149 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 149 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 150 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 150 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 151 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 151 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 152 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 152 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 153 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 153 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 154 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 154 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 155 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 155 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 156 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 156 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 157 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 157 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 158 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 158 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 159 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 159 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 160 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 160 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 161 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 161 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 162 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 162 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 163 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 163 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 164 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 164 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 165 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 165 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 166 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 166 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 167 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 167 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 168 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 168 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 169 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 169 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 170 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 170 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 171 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 171 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 172 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 172 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 173 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 173 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 174 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 174 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 175 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 175 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 176 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 176 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 177 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 177 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 178 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 178 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 179 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 179 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 180 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 180 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 181 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 181 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 182 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 182 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 183 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 183 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 184 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 184 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 185 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 185 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 186 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 186 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 187 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 187 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 188 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 188 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 189 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 189 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 190 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 190 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 191 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 191 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 192 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 192 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 193 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 193 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 194 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 194 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 195 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 195 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 196 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 196 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 197 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 197 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 198 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 198 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 199 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 199 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 200 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 200 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 201 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 201 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 202 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 202 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 203 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 203 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 204 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 204 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 205 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 205 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 206 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 206 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 207 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 207 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 208 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 208 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 209 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 209 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 210 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 210 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 211 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 211 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 212 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 212 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 213 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 213 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 214 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 214 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 215 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 215 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 216 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 216 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 217 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 217 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 218 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 218 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 219 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 219 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 220 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 220 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 221 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 221 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 222 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 222 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 223 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 223 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 224 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 224 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 225 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 225 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 226 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 226 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 227 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 227 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 228 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 228 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 229 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 229 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 230 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 230 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 231 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 231 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 232 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 232 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 233 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 233 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 234 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 234 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 235 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 235 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 236 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 236 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 237 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 237 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 238 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 238 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 239 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 239 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 240 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 240 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 241 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 241 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 242 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 242 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 243 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 243 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 244 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 244 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 245 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 245 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 246 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 246 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 247 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 247 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 248 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 248 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 249 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 249 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 250 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 250 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 251 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 251 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 252 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 252 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 253 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 253 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 254 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 254 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 255 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 255 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 256 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 256 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 257 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 257 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 258 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 258 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 259 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 259 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 260 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 260 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 261 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 261 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 262 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 262 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 263 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 263 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 264 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 264 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 265 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 265 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 266 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 266 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 267 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 267 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 268 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 268 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 269 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 269 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 270 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 270 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 271 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 271 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 272 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 272 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 273 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 273 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 274 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 274 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 275 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 275 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 276 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 276 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 277 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 277 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 278 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 278 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 279 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 279 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 280 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 280 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 281 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 281 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 282 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 282 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 283 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 283 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 284 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 284 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 285 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 285 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 286 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 286 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 287 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 287 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 288 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 288 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 289 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 289 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 290 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 290 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 291 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 291 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 292 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 292 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 293 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 293 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 294 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 294 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 295 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 295 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 296 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 296 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 297 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 297 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 298 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 298 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 299 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 299 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 300 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 300 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 301 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 301 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 302 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 302 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 303 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 303 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 304 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 304 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 305 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 305 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 306 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 306 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 307 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 307 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 308 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 308 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 309 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 309 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 310 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 310 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 311 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 311 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 312 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 312 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 313 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 313 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 314 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 314 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 315 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 315 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 316 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 316 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 317 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 317 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 318 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 318 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 319 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 319 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 320 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 320 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 321 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 321 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 322 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 322 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 323 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 323 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 324 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 324 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 325 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 325 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 326 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 326 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 327 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 327 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 328 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 328 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 329 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 329 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 330 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 330 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 331 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 331 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 332 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 332 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 333 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 333 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 334 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 334 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 335 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 335 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 336 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 336 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 337 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 337 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 338 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 338 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 339 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 339 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 340 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 340 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 341 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 341 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 342 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 342 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 343 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 343 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 344 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 344 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 345 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 345 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 346 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 346 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 347 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 347 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 348 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 348 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 349 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 349 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 350 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 350 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 351 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 351 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 352 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 352 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 353 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 353 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 354 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 354 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 355 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 355 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 356 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 356 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 357 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 357 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 358 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 358 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 359 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 359 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 360 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 360 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 361 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 361 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 362 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 362 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 363 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 363 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 364 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 364 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 365 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 365 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 366 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 366 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 367 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 367 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 368 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 368 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 369 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 369 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 370 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 370 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 371 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 371 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 372 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 372 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 373 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 373 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 374 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 374 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 375 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 375 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 376 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 376 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 377 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 377 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 378 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 378 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 379 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 379 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 380 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 380 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 381 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 381 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 382 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 382 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 383 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 383 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 384 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 384 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 385 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 385 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 386 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 386 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 387 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 387 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 388 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 388 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 389 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 389 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 390 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 390 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 391 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 391 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 392 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 392 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 393 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 393 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 394 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 394 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 395 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 395 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 396 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 396 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 397 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 397 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 398 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 398 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 399 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 399 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 400 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 400 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 401 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 401 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 402 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 402 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 403 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 403 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 404 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 404 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 405 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 405 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 406 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 406 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 407 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 407 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 408 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 408 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 409 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 409 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 410 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 410 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 411 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 411 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 412 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 412 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 413 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 413 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 414 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 414 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 415 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 415 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 416 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 416 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 417 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 417 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 418 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 418 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 419 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 419 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 420 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 420 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 421 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 421 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 422 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 422 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 423 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 423 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 424 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 424 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 425 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 425 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 426 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 426 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 427 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 427 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 428 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 428 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 429 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 429 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 430 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 430 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 431 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 431 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 432 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 432 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 433 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 433 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 434 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 434 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 435 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 435 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 436 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 436 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 437 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 437 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 438 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 438 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 439 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 439 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 440 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 440 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 441 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 441 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 442 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 442 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 443 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 443 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 444 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 444 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 445 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 445 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 446 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 446 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 447 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 447 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 448 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 448 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 449 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 449 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 450 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 450 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 451 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 451 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 452 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 452 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 453 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 453 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 454 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 454 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 455 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 455 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 456 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 456 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 457 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 457 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 458 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 458 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 459 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 459 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 460 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 460 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 461 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 461 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 462 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 462 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 463 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 463 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 464 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 464 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 465 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 465 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 466 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 466 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 467 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 467 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 468 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 468 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 469 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 469 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 470 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 470 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 471 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 471 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 472 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 472 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 473 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 473 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 474 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 474 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 475 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 475 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 476 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 476 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 477 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 477 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 478 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 478 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 479 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 479 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 480 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 480 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 481 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 481 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 482 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 482 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 483 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 483 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 484 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 484 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 485 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 485 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 486 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 486 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 487 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 487 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 488 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 488 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 489 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 489 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 490 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 490 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 491 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 491 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 492 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 492 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 493 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 493 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 494 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 494 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 495 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 495 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 496 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 496 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 497 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 497 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 498 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 498 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 499 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 499 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 500 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 500 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 501 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 501 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 502 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 502 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 503 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 503 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 504 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 504 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 505 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 505 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 506 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 506 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 507 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 507 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 508 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 508 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 509 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 509 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 510 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 510 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 511 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 511 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 512 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 512 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 513 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 513 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 514 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 514 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 515 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 515 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 516 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 516 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 517 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 517 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 518 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 518 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 519 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 519 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 520 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 520 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 521 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 521 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 522 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 522 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 523 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 523 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 524 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 524 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 525 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 525 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 526 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 526 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 527 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 527 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 528 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 528 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 529 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 529 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 530 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 530 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 531 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 531 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 532 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 532 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 533 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 533 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 534 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 534 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 535 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 535 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 536 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 536 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 537 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 537 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 538 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 538 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 539 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 539 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 540 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 540 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 541 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 541 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 542 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 542 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 543 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 543 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 544 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 544 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 545 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 545 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 546 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 546 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 547 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 547 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 548 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 548 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 549 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 549 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 550 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 550 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 551 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 551 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 552 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 552 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 553 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 553 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 554 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 554 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 555 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 555 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 556 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 556 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 557 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 557 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 558 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 558 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 559 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 559 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 560 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 560 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 561 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 561 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 562 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 562 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 563 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 563 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 564 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 564 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 565 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 565 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 566 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 566 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 567 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 567 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 568 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 568 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 569 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 569 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 570 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 570 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 571 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 571 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 572 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 572 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 573 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 573 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 574 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 574 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 575 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 575 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 576 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 576 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 577 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 577 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 578 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 578 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 579 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 579 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 580 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 580 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 581 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 581 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 582 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 582 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 583 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 583 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 584 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 584 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 585 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 585 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 586 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 586 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 587 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 587 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 588 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 588 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 589 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 589 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 590 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 590 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 591 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 591 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 592 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 592 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 593 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 593 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 594 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 594 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 595 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 595 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 596 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 596 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 597 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 597 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 598 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 598 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 599 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 599 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 600 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 600 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 601 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 601 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 602 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 602 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 603 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 603 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 604 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 604 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 605 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 605 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 606 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 606 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 607 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 607 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 608 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 608 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 609 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 609 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 610 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 610 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 611 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 611 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 612 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 612 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 613 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 613 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 614 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 614 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 615 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 615 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 616 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 616 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 617 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 617 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 618 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 618 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 619 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 619 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 620 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 620 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 621 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 621 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 622 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 622 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 623 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 623 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 624 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 624 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 625 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 625 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 626 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 626 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 627 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 627 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 628 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 628 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 629 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 629 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 630 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 630 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 631 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 631 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 632 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 632 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 633 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 633 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 634 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 634 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 635 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 635 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 636 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 636 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 637 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 637 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 638 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 638 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 639 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 639 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 640 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 640 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 641 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 641 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 642 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 642 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 643 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 643 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 644 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 644 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 645 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 645 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 646 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 646 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 647 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 647 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 648 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 648 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 649 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 649 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 650 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 650 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 651 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 651 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 652 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 652 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 653 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 653 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 654 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 654 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 655 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 655 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 656 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 656 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 657 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 657 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 658 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 658 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 659 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 659 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 660 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 660 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 661 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 661 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 662 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 662 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 663 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 663 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 664 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 664 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 665 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 665 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 666 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 666 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 667 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 667 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 668 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 668 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 669 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 669 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 670 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 670 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 671 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 671 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 672 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 672 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 673 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 673 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 674 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 674 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 675 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 675 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 676 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 676 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 677 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 677 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 678 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 678 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 679 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 679 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 680 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 680 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 681 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 681 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 682 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 682 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 683 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 683 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 684 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 684 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 685 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 685 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 686 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 686 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 687 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 687 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 688 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 688 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 689 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 689 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 690 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 690 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 691 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 691 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 692 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 692 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 693 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 693 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 694 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 694 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 695 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 695 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 696 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 696 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 697 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 697 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 698 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 698 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 699 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 699 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 700 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 700 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 701 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 701 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 702 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 702 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 703 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 703 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 704 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 704 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 705 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 705 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 706 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 706 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 707 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 707 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 708 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 708 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 709 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 709 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 710 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 710 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 711 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 711 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 712 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 712 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 713 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 713 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 714 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 714 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 715 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 715 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 716 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 716 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 717 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 717 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 718 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 718 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 719 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 719 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 720 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 720 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 721 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 721 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 722 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 722 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 723 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 723 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 724 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 724 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 725 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 725 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 726 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 726 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 727 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 727 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 728 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 728 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 729 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 729 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 730 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 730 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 731 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 731 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 732 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 732 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 733 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 733 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 734 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 734 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 735 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 735 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 736 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 736 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 737 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 737 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 738 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 738 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 739 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 739 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 740 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 740 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 741 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 741 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 742 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 742 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 743 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 743 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 744 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 744 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 745 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 745 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 746 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 746 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 747 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 747 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 748 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 748 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 749 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 749 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 750 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 750 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 751 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 751 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 752 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 752 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 753 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 753 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 754 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 754 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 755 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 755 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 756 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 756 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 757 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 757 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 758 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 758 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 759 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 759 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 760 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 760 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 761 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 761 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 762 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 762 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 763 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 763 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 764 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 764 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 765 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 765 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 766 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 766 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 767 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 767 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 768 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 768 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 769 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 769 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 770 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 770 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 771 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 771 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 772 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 772 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 773 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 773 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 774 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 774 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 775 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 775 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 776 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 776 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 777 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 777 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 778 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 778 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 779 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 779 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 780 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 780 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 781 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 781 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 782 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 782 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 783 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 783 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 784 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 784 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 785 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 785 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 786 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 786 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 787 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 787 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 788 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 788 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 789 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 789 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 790 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 790 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 791 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 791 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 792 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 792 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 793 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 793 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 794 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 794 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 795 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 795 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 796 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 796 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 797 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 797 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 798 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 798 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 799 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 799 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 800 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 800 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 801 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 801 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 802 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 802 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 803 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 803 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 804 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 804 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 805 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 805 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 806 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 806 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 807 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 807 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 808 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 808 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 809 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 809 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 810 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 810 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 811 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 811 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 812 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 812 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 813 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 813 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 814 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 814 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 815 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 815 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 816 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 816 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 817 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 817 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 818 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 818 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 819 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 819 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 820 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 820 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 821 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 821 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 822 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 822 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 823 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 823 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 824 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 824 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 825 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 825 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 826 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 826 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 827 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 827 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 828 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 828 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 829 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 829 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 830 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 830 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 831 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 831 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 832 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 832 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 833 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 833 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 834 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 834 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 835 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 835 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 836 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 836 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 837 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 837 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 838 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 838 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 839 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 839 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 840 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 840 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 841 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 841 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 842 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 842 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 843 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 843 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 844 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 844 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 845 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 845 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 846 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 846 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 847 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 847 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 848 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 848 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 849 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 849 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 850 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 850 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 851 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 851 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 852 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 852 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 853 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 853 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 854 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 854 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 855 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 855 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 856 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 856 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 857 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 857 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 858 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 858 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 859 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 859 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 860 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 860 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 861 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 861 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 862 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 862 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 863 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 863 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 864 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 864 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 865 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 865 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 866 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 866 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 867 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 867 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 868 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 868 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 869 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 869 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 870 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 870 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 871 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 871 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 872 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 872 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 873 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 873 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 874 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 874 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 875 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 875 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 876 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 876 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 877 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 877 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 878 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 878 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 879 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 879 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 880 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 880 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 881 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 881 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 882 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 882 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 883 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 883 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 884 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 884 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 885 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 885 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 886 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 886 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 887 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 887 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 888 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 888 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 889 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 889 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 890 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 890 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 891 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 891 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 892 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 892 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 893 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 893 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 894 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 894 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 895 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 895 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 896 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 896 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 897 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 897 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 898 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 898 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 899 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 899 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 900 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 900 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 901 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 901 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 902 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 902 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 903 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 903 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 904 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 904 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 905 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 905 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 906 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 906 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 907 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 907 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 908 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 908 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 909 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 909 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 910 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 910 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 911 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 911 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 912 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 912 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 913 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 913 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 914 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 914 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 915 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 915 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 916 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 916 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 917 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 917 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 918 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 918 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 919 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 919 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 920 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 920 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 921 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 921 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 922 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 922 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 923 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 923 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 924 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 924 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 925 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 925 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 926 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 926 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 927 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 927 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 928 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 928 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 929 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 929 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 930 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 930 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 931 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 931 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 932 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 932 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 933 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 933 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 934 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 934 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 935 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 935 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 936 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 936 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 937 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 937 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 938 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 938 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 939 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 939 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 940 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 940 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 941 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 941 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 942 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 942 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 943 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 943 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 944 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 944 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 945 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 945 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 946 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 946 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 947 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 947 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 948 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 948 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 949 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 949 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 950 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 950 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 951 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 951 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 952 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 952 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 953 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 953 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 954 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 954 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 955 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 955 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 956 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 956 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 957 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 957 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 958 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 958 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 959 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 959 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 960 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 960 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 961 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 961 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 962 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 962 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 963 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 963 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 964 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 964 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 965 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 965 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 966 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 966 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 967 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 967 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 968 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 968 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 969 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 969 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 970 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 970 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 971 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 971 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 972 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 972 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 973 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 973 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 974 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 974 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 975 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 975 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 976 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 976 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 977 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 977 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 978 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 978 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 979 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 979 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 980 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 980 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 981 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 981 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 982 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 982 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 983 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 983 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 984 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 984 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 985 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 985 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 986 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 986 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 987 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 987 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 988 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 988 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 989 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 989 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 990 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 990 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 991 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 991 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 992 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 992 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 993 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 993 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 994 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 994 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 995 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 995 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 996 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 996 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 997 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 997 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 998 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 998 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 999 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 999 ends
## 
## ********** new iteration *********
## ---------------generation--------------- 1000 starts
## tournament selection
## crossover operator
## mutation operator
## evaluate the objective fns of childAfterM
## Rt = Pt + Qt
## ranking again
## crowded comparison again
## environmental selection
## ---------------generation--------------- 1000 ends
## ********** stop the evolution *********

Untuk memeriksa solusi pareto front, Anda dapat melihat objek dan subset hanya yang memiliki pareto front rank 1. Mari kita lihat berapa banyak solusi optimal berbeda yang dihasilkan.

finance_optim$objectives[finance_optim$paretoFrontRank == 1, ] %>% 
   matrix(ncol = 3) %>% 
   as.data.frame() %>% 
   distinct() %>% 
   mutate(V1 = round(-V1, 5),
          V2 = round(V2, 5)) %>% 
   rename(`Total Return` = V1,
          Risk = V2,
          `Number of Assets` = V3)

##   Total Return    Risk Number of Assets
## 1     -0.00007 0.00022               29
## 2      0.00060 0.00033               29
## 3     -0.00036 0.00011               29

Ternyata hanya ada 1 solusi.

Mari kita periksa berat totalnya

sum(finance_optim$parameters[1, ])

## [1] 0.9999996

Jumlah bobotnya adalah 1, jadi kami yakin bahwa solusi kami tidak melanggar batasan.

Jika Anda ingin mendapatkan bobot untuk setiap aset, Anda dapat menggunakan objek parameters dari finance_optim. Mari kita lihat parameter untuk solusi pertama.

data.frame(symbol = unique(nyse$symbol),
           name = unique(nyse$name),
           weight = finance_optim$parameters[1, ]) %>% 
   mutate(return = round(weight * mean_stock$mean, 5),
          weight = round(weight,5))

##    symbol                             name  weight   return
## 1     CAG               ConAgra Foods Inc. 0.02021  0.00006
## 2     CBS                        CBS Corp. 0.11933  0.00031
## 3    COTY                        Coty, Inc 0.00007  0.00000
## 4     CPB                    Campbell Soup 0.01933  0.00003
## 5     CXO                 Concho Resources 0.00883  0.00001
## 6     DAL                  Delta Air Lines 0.08615  0.00014
## 7      ED              Consolidated Edison 0.02033  0.00003
## 8     GWW             Grainger (W.W.) Inc. 0.00561  0.00001
## 9     HCP                         HCP Inc. 0.10920  0.00013
## 10    HRB                        Block H&R 0.01890  0.00002
## 11    HRL               Hormel Foods Corp. 0.01571  0.00001
## 12   HSIC                     Henry Schein 0.00070  0.00000
## 13    KEY                          KeyCorp 0.01229  0.00001
## 14    KSU             Kansas City Southern 0.01483  0.00001
## 15    MAS                      Masco Corp. 0.00610  0.00000
## 16    MTD                   Mettler Toledo 0.00101  0.00000
## 17    NEM Newmont Mining Corp. (Hldg. Co.) 0.00144  0.00000
## 18     PG                 Procter & Gamble 0.06241 -0.00002
## 19    PNC           PNC Financial Services 0.02338 -0.00001
## 20    PSX                      Phillips 66 0.00551  0.00000
## 21    SCG                       SCANA Corp 0.00036  0.00000
## 22    SLB                Schlumberger Ltd. 0.00700 -0.00001
## 23    TGT                     Target Corp. 0.02900 -0.00004
## 24    TMK                  Torchmark Corp. 0.02664 -0.00003
## 25   TROW              T. Rowe Price Group 0.00691 -0.00001
## 26    USB                     U.S. Bancorp 0.34266 -0.00053
## 27    WDC                  Western Digital 0.02516 -0.00004
## 28    WHR                  Whirlpool Corp. 0.00111  0.00000
## 29   ZION                    Zions Bancorp 0.00983 -0.00003