A Bio-Inspired Method for the Constrained Shortest Path Problem

Table 3

Paths and their attributes.

Order	Handler and Zang’s method			Proposed method
	𝑘 shortest path	Delay	Cost	Important path	Delay	Cost
1	1-4-11-17-20-23	54.1798	48.7660	1-4-11-17-20-23	54.1798	48.7660
2	1-3-8-13-19-22-23	54.1798	48.7660	1-3-8-13-19-15-18-23	56.3484	78.8668
3	1-4-11-17-21-23	57.8418	55.6264	1-4-7-10-17-21-23	64.6681	69.9845
4	1-4-11-14-21-23	58.1237	61.0144	1-2-6-9-16-20-23	64.6681	69.9845
5	1-4-7-10-16-20-23	52.0383	61.7379	1-3-8-13-19-22-23	44.0553	74.5885
6	1-4-7-10-17-20-23	61.0060	63.1241
7	1-4-7-11-17-20-23	61.3472	63.2659
8	1-5-12-15-18-23	49.6080	64.2027
9	1-5-11-17-20-23	54.6178	66.0392
10	1-5-12-14-21-23	51.9017	69.8593
11	1-5-8-13-19-22-23	48.6006	71.7413
12	1-3-8-13-19-22-23	44.0553	74.5885