A Bio-Inspired Method for the Constrained Shortest Path Problem

Table 5

Computational results.

Nodes	Handler and Zang’s method [14]	Proposed method
	Av. computer time (s)	Av. computer time (s)
100
1	0.0147	0.236
2	0.0513	0.048
3	0.00559	0.0363
4	0.00575	0.0259
Av. time for 100 nodes	0.0193	0.0866
300
1	0.0163	0.353
2	0.0189	1.009
3	0.0229	1.171
4	0.0148	0.231
Av. time for 300 nodes	0.0182	0.691
500
1	0.038	1.278
2	0.037	1.14
3	0.039	1.298
4	0.039	1.346
Av. time for 500 nodes	0.0383	1.266
700
1	0.733	3.989
2	0.0689	4.107
3	0.0791	5.563
4	0.069	3.775
Av. time for 700 nodes	0.238	4.359
1000
1	0.121	17.34
2	0.126	24.531
3	0.143	20.135
4	0.135	42.846
Av. time for 1000 nodes	0.13125	26.213
Global Av.	0.0890	6.523