Skip to main content

Table 6 Completion time J in sec. and average CPU time in sec. for different genetic algorithms

From: Performance impact of mutation operators of a subpopulation-based genetic algorithm for multi-robot task allocation problems

Problem

Criterion

Subpopulation-based GA

Standard GA

Prob.A

\(J_{\mathrm{min}}\)

170.06

250.03

\(J_{\mathrm{mean}}\)

189.55

290.07

\(J_{\mathrm{max}}\)

225.56

319.12

CPU

988

1432

Prob.B

\(J_{\mathrm{min}}\)

185.95

257.16

\(J_{\mathrm{mean}}\)

207.03

300.45

\(J_{\mathrm{max}}\)

228.75

355.11

CPU

1028

1423

Prob.C

\(J_{\mathrm{min}}\)

252.72

348.52

\(J_{\mathrm{mean}}\)

292.78

414.79

\(J_{\mathrm{max}}\)

376.46

500.94

CPU

2419

2732

Prob.D

\(J_{\mathrm{min}}\)

255.96

374.93

\(J_{\mathrm{mean}}\)

333.07

448.25

\(J_{\mathrm{max}}\)

383.95

480.42

CPU

2580

2885

  1. \(J_{\mathrm{max}}\) maximum completion time, \(J_{\mathrm{mean}}\) mean completion time, \(J_{\mathrm{min}}\) minimum completion time