Computational Intelligence - May 2014 - 67

Table 4 Simulation results on the ba scale-free graphs. The values in each row are the average on 30 randomly generated interference
graphs, the standard difference of the 30 values of the total cost is given in the parentheses.
TOTal COST

NuMber OF SPilleD NODeS

TiMe (s)

n

m

mo

b

OCH

COMa

Hea

OCH

COMa

Hea

OCH

COMa

Hea

100

12

15

0.06

795.20

340.13

370.8

25.27

15.43

16.00

0.03

851.21

586.83

(147.61)

(27.82)

(28.63)

279.10

110.77

137.73

9.67

5.43

6.43

0.03

213.41

164.07

(71.17)

(25.40)

(19.09)

1109.63

478.90

536.10

35.30

22.13

22.73

0.03

896.53

752.53

(119.59)

(34.45)

(34.33)

593.63

218.40

252.60

18.90

11.83

11.90

0.03

289.00

198.43

(107.99)

(21.61)

(16.09)

1267.47

404.23

494.13

44.67

32.07

32.53

0.07

1439.98

908.59

(123.55)

(34.80)

(37.56)

383.27

96.53

141.23

13.63

12.80

13.83

0.05

709.91

521.11

(97.89)

(18.66)

(21.46)

2012.17

762.43

898.70

71.07

50.60

51.63

0.07

2513.62

969.67

(150.17)

(34.73)

(35.43)

1096.17

296.43

375.37

39.21

27.77

29.07

0.05

1218.35

790.67

(137.91)

(21.54)

(26.58)

0.08

15

20

0.06

0.08

200

30

40

0.06

0.08

40

50

0.06

0.08

COMA v = 18.66
10

HEA

v = 21.46

OCH

v = 97.89

5

0

0

200

400

600

LFR, n = 200,  = 40, kmax = 100, n = 0.6, b = 0.06
Number of Times Appear

Number of Times Appear

BA Graphs, n = 200, m = 30, mo = 40, b = 0.08
15

800

15
COMA v = 33.04
10

HEA

v = 41.80

OCH

v = 141.43

5

0

0

200

Total Cost
(a)

400

600

800

1000

Total Cost
(b)

Figure 6 Distributions of the 30 results of the total cost for the three algorithms. (a) BA scale-free graphs. (b) LFR modular graphs.

graphs. But in scale-free and modular
graphs, it is usually that Fitness M (R i)
< Fitness S (R i) . Thus the Fitness (R i)
calculated by (3) is evidently smaller
than that calculated by (1) in scale-free
and modular graphs.
IV. Conclusion

The node-weighted resource allocation
problem formulated in this paper is a
generalization of the k -coloring prob-

lem. By appropriately utilizing the cost
infor mation, the cost-or iented
memetic algorithm (COMA) for the
resource allocation problem is provided.
The COMA has two main contributions: one is the metric-based technique to decode a chromosome and
the other is the cost-oriented crossover
operator (COPX). The metric-based
technique is a combination of two
types of information: conflict (edge)

and cost (weight), which can produce
smaller value of the fitness in general
than using any one of the two types of
information. The metric-based technique can reduce both the total cost
and the number of spilled nodes but
requires more runtime. The COPX is a
modification of the CFPX. The difference between the two operators is that
the COPX tends to reduce the total
cost whereas the CFPX tends to reduce

may 2014 | IEEE ComputatIonal IntEllIgEnCE magazInE

67



Table of Contents for the Digital Edition of Computational Intelligence - May 2014

Computational Intelligence - May 2014 - Cover1
Computational Intelligence - May 2014 - Cover2
Computational Intelligence - May 2014 - 1
Computational Intelligence - May 2014 - 2
Computational Intelligence - May 2014 - 3
Computational Intelligence - May 2014 - 4
Computational Intelligence - May 2014 - 5
Computational Intelligence - May 2014 - 6
Computational Intelligence - May 2014 - 7
Computational Intelligence - May 2014 - 8
Computational Intelligence - May 2014 - 9
Computational Intelligence - May 2014 - 10
Computational Intelligence - May 2014 - 11
Computational Intelligence - May 2014 - 12
Computational Intelligence - May 2014 - 13
Computational Intelligence - May 2014 - 14
Computational Intelligence - May 2014 - 15
Computational Intelligence - May 2014 - 16
Computational Intelligence - May 2014 - 17
Computational Intelligence - May 2014 - 18
Computational Intelligence - May 2014 - 19
Computational Intelligence - May 2014 - 20
Computational Intelligence - May 2014 - 21
Computational Intelligence - May 2014 - 22
Computational Intelligence - May 2014 - 23
Computational Intelligence - May 2014 - 24
Computational Intelligence - May 2014 - 25
Computational Intelligence - May 2014 - 26
Computational Intelligence - May 2014 - 27
Computational Intelligence - May 2014 - 28
Computational Intelligence - May 2014 - 29
Computational Intelligence - May 2014 - 30
Computational Intelligence - May 2014 - 31
Computational Intelligence - May 2014 - 32
Computational Intelligence - May 2014 - 33
Computational Intelligence - May 2014 - 34
Computational Intelligence - May 2014 - 35
Computational Intelligence - May 2014 - 36
Computational Intelligence - May 2014 - 37
Computational Intelligence - May 2014 - 38
Computational Intelligence - May 2014 - 39
Computational Intelligence - May 2014 - 40
Computational Intelligence - May 2014 - 41
Computational Intelligence - May 2014 - 42
Computational Intelligence - May 2014 - 43
Computational Intelligence - May 2014 - 44
Computational Intelligence - May 2014 - 45
Computational Intelligence - May 2014 - 46
Computational Intelligence - May 2014 - 47
Computational Intelligence - May 2014 - 48
Computational Intelligence - May 2014 - 49
Computational Intelligence - May 2014 - 50
Computational Intelligence - May 2014 - 51
Computational Intelligence - May 2014 - 52
Computational Intelligence - May 2014 - 53
Computational Intelligence - May 2014 - 54
Computational Intelligence - May 2014 - 55
Computational Intelligence - May 2014 - 56
Computational Intelligence - May 2014 - 57
Computational Intelligence - May 2014 - 58
Computational Intelligence - May 2014 - 59
Computational Intelligence - May 2014 - 60
Computational Intelligence - May 2014 - 61
Computational Intelligence - May 2014 - 62
Computational Intelligence - May 2014 - 63
Computational Intelligence - May 2014 - 64
Computational Intelligence - May 2014 - 65
Computational Intelligence - May 2014 - 66
Computational Intelligence - May 2014 - 67
Computational Intelligence - May 2014 - 68
Computational Intelligence - May 2014 - 69
Computational Intelligence - May 2014 - 70
Computational Intelligence - May 2014 - 71
Computational Intelligence - May 2014 - 72
Computational Intelligence - May 2014 - Cover3
Computational Intelligence - May 2014 - Cover4
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202311
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202308
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202305
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202302
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202211
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202208
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202205
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202202
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202111
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202108
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202105
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202102
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202011
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202008
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202005
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202002
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_201911
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_201908
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_201905
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_201902
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_201811
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_201808
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_201805
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_201802
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_winter17
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_fall17
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_summer17
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_spring17
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_winter16
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_fall16
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_summer16
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_spring16
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_winter15
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_fall15
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_summer15
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_spring15
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_winter14
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_fall14
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_summer14
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_spring14
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_winter13
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_fall13
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_summer13
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_spring13
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_winter12
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_fall12
https://www.nxtbookmedia.com