Table 4 Numerical results for the 20 small-scale instances.

From: A hybrid multi-level ant colony optimization framework for integrated production scheduling and vehicle routing

Problem instances

Objective by ACS-HMLO

LINGO

RD1 (%)

Solving time (minutes)

k

h

n

i

Max

Min

Average

St. dev

LINGO

ACS-HMLO

2

2

4

1

2452

2452

2452

0

2452

0.00

0.29

0.03

2

1169

1169

1169

0

1169

0.00

0.24

0.03

3

2078

2078

2078

0

2078

0.00

0.29

0.03

4

689

689

689

0

689

0.00

0.07

0.03

5

1002

1002

1002

0

1002

0.00

0.24

0.03

6

1156

1156

1156

0

1156

0.00

0.13

0.03

7

974

974

974

0

974

0.00

0.17

0.03

8

1325

1325

1325

0

1325

0.00

0.14

0.03

9

1645

1645

1645

0

1645

0.00

0.31

0.03

10

784

784

784

0

784

0.00

0.31

0.03

5

1

706

706

706

0

706

0.00

2.00

0.35

2

1079

1041

1045.7

11.42

1041

0.00

1.66

0.34

3

571

539

542.2

9.6

539

0.00

0.68

0.34

4

1659

1659

1659

0

1659

0.00

6.68

0.34

5

447

447

447

0

447

0.00

0.04

0.36

6

1521

1521

1521

0

1521

0.00

6.35

0.33

7

508

466

482.8

11

466

0.00

0.19

0.36

8

618

618

618

0

618

0.00

0.15

0.36

9

1055

1055

1055

0

1055

0.00

2.80

0.34

10

417

388

400.5

12.58

388

0.00

0.19

0.44