Computer Engineering and Applications

2013496

39

WU Bin, QIAN Cunhua, NI Weihong

210009
School of Economics and Management, Nanjing University of Technology, Nanjing 210009, China
WU Bin, QIAN Cunhua, NI Weihong. Glowworm Swarm Optimization for cross dock scheduling problem. Computer
Engineering and Applications, 2013, 49639-42.
AbstractGlowworm Swarm OptimizationGSOis a new swarm intelligence optimization algorithm, but now it has few applications in the field of combinatorial optimization. GSO is presented to solve the cross dock scheduling problem in the paper.
Cross dock scheduling problem is a kind of highly complex optimization problem, and it is the critical issue for the cross docking
logistics. The two-stage Largest Order ValueLOVbased on random key encoding method is designed for the solution. In order
to enhance accuracy and convergence rate of the GSO, the best acceptance and moving by dimensional strategies are proposed.
Based on the principle of social psychology, the position update equation is improved. Simulation results show that the proposed
GSO algorithm is efficient for the cross dock scheduling problem.
Key wordsglowworm swarm optimization; cross dock scheduling problem; logistics

Glowworm Swarm OptimizationGSO NP

GSO

GSO

O221TP183

doi10.3778/j.issn.1002-8331.1204-0710

[2-4]

McWilliams [1] 2005

[68] [5] [9]

Glowwrom Swarm OptimizationGSO

GSO Krishnanand Ghose

JIT
NP

2005 GSO
[10-11] [12]
[13]

TSP [14]

[15] GSO

[2-4]Lee[5]Yu
Egbelu Miao
[6]

[7]

No.BK2010555No.11YJCZH184
19791964
1968
E-mailseasimen@yahoo.com.cn
2012-05-07

2012-11-08

CNKI 2012-12-05

1002-8331201306-0039-04

http://www.cnki.net/kcms/detail/11.2127.TP.20121205.1652.003.html

40

Computer Engineering and Applications

2013496

6~8

[9]

0-1

P NI P MO

N
M I

O c kl (k < N l < M ) k
l fij (i < I j < O) i

GSO
Ant Colony OptimizationACO
Particle Swarm OptimizationPSO
GSO
Luciferin

GSO

j ri i

s j j

T k

1, ik
x ik =
0,

3.1

NP

1, jl
y jl =
0,
M

k xik = 1
I

i xik 1
M

l y jl = 1
O

j y jl 1
I

i fij = s j
O

j fij = ri
I

s.t.

D i x i

min max T k = x ik y jl c kl fij

i ri = j s j

"i

li
l 0
r di (0 < r di < r s )

"k

r s GSO
3

"j

"j

"j

"i

3.1.1

"i j

li (t + 1) = (1 - )li (t) + J i (t + 1)

li (t) i t (0 < < 1)

12
3

J i (t + 1)

4
5

i t + 1

3.1.2

2013496

41

i j

4 GSO
4.1

1 j i
2 j i
i

l j (t) - li (t)
p ij =
l k (t) - li (t)

Largest Order ValueLOV

10

N i (t) ={ j:d i j (t) < r di (t); li (t) < l j (t)} i t

j N i (t) d i j (t) i j t
r di (t) i t i
j 11

3.1.3

1 N + M X i = (x i1
x i2 x iN + M )

2 N M
LOV = (1 2 N )
= (1 2 M ) LOV I O 0

11

3 14 = (1, 2 ,, I + O )

12
r di (t + 1) = min{rs max{0 r di (t) + (nt - | Ni(t) |)}}

k N i (t)

x j (t) - x i (t)
x i (t + 1) = x i (t) + s

x j (t) - x i (t)

GSO

12

i = i, i N i 0

= (i - N ), N < i N + M (i - N ) 0
I + (i - N )

14

5 5 4 4
1
2431|3415 2

nt

3.2

GSO

GSO
GSO

LOV

1
0.30
4
4
2

2
4.20
1
1
4

LOV

11

r c 2 (x jk (t) - x ik (t))

13

c1 c 2

61
2.3
3
3
3

72
1.2
5
0
4

x ik (t + 1) = x ik (t) + r c1 (x kbest (t) - x ik (t)) +

5
0.04
5
0

4
2.80
2
2
1

3
1.50
3
3
3

4
1

83
3.5
1
1
1

94
3.2
2
2
5

105
1.6
4
4

13 x j
x best

k(0 < k < D) x j

j N i '(t) N i '(t) ={ j:d i j (t) < r di (t)}

42

4.2

Computer Engineering and Applications

2013496

50 2

GSO

3
2 GSO GSO IGSO

1 SN

IGSO 6

GSO

MCN

7.5% 7.8% 3 IGSO

IGSO

x best

20.5% 25.6%

t = 0

CD1 IGSO

3 9

30.8% IGSO

4.1 N i '(t) ={ j:

d i j (t) < r di (t)}

4.2 j k = 0

k<N+M

4.3 13

GSO
GSO

IGSO

CD1

1 647

1 621

1 496

1 430

CD2

1 636

1 598

1 502

1 472

CD3

2 290

2 180

2 137

2 085

k = k + 1 4.3

CD4

2 176

2 106

2 021

1 937

CD5

3 124

3 049

2 973

2 838

CD6

2 792

2 631

2 544

2 425

4.4

5 12

x best
6 t = t + 1 t < MCN 3

IGSO

CD1

1 496

1 430

1 870

1 870

CD2

1 502

1 472

1 720

1 720

CD3

2 137

2 085

2 604

2 604

3 6

CD4

2 021

1 937

2 440

2 440

1 3 1015

CD5

2 973

2 838

3 648

3 648

20

CD6

2 544

2 425

3 113

3 113

i j

NP

1, i = j
tij =
( j - i) 0.3 + 1, i < j
1

15

GSO

GSO

CD1

1010

[88]

{1 0001 000}

CD2

1010

[610]

{1 000600}

CD3

1515

[1012]

{1 2001 000}

CD4

1515

[1215]

{1 000800}

CD5

2020

[1518]

{1 2001 000}

CD6

2020

[1620]

{1 000800}

VC++ CPU Pentium

GSO

[1] McWilliams D LStanfield P M.The parcel hub scheduling

problema simulation-based solution approach[J].Computers &
Industrial Engineering200549393-412.

E22002 GB Windows XP

[2] Chen FLee C Y.Minimizing the makespan in a two-machine

cross-docking flow shop problem[J].European Journal of Op-

SN = 50 MCN = 5 000 = 0.8 = 0.05 l 0 = 0.5 = 0.65

nt = 45 = 0.45 c1 = 0.3 c 2 = 0.15 6

erational Research2009193159-72.

51