Skip to main content
SpringerLink
Log in

Comparison of Meta-heuristic Algorithms for Vehicle Routing Problem with Time Windows

  • Conference paper
  • First Online:
Advanced Computer and Communication Engineering Technology

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 362))

Abstract

This paper proposes three meta-heuristic algorithms, namely cuckoo search, central force optimization, and chemical reaction optimization for solving vehicle routing problem with time windows (VRPTW). A comparison study between different meta-heuristic algorithms aims to identify their respective strengths and weaknesses . The objective of VRPTW is to serve all customers, at different geographic locations, with varying demands and within specific time windows. The performance evaluation is tested on Solomon’s 56 benchmark instances of 100 customer problems, and yielded 24 solutions better than or equal to the best known solution provided by published papers. This paper is also among the first to document the implementation of all the three meta-heuristic algorithms for VRPTW together with their comprehensive results.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Yang, X.-S., Deb, S.: Cuckoo search via Lévy flights. In: World Congress on Nature and Biologically Inspired Computing, pp. 210–214 (2009)

    Google Scholar 

  2. Formato, R.A.: Central force optimization: a new metaheuristic with applications in applied electromagnetics. Prog. Electromag. Res. 77, 425–491 (2007)

    Article  Google Scholar 

  3. Lam, A.Y.S., Li, V.O.K.: Chemical-reaction-inspired metaheuristic for optimization. IEEE Trans. Evol. Comput. 14(3), 381–399 (2010)

    Article  Google Scholar 

  4. Solomon, Marius M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35, 254–265 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  5. Chiang, T.-C., Hsu, W.-H.: A knowledge-based evolutionary algorithm for the multiobjective vehicle routing problem with time windows. Comput. Oper. Res. 45, 25–37 (2014)

    Article  Google Scholar 

Download references

Acknowledgments

The author would like to thank the financial support provided by the Thailand Research Fund through the Royal Golden Jubilee Ph.D. Program (Grant No. PHD/0113/2552) and by the Graduate School, Chiang Mai University, Thailand.

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Chiang Mai University, Chiang Mai, Thailand

    Teerapun Saeheaw & Nivit Charoenchai

Authors
  1. Teerapun Saeheaw
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nivit Charoenchai
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Teerapun Saeheaw .

Editor information

Editors and Affiliations

  1. Universiti Teknikal Malaysia Melaka , Melaka, Malaysia

    Hamzah Asyrani Sulaiman

  2. Universiti Teknikal Malaysia Melaka, Melaka, Malaysia

    Mohd Azlishah Othman

  3. Universiti Teknikal Malaysia Melaka, Melaka, Malaysia

    Mohd Fairuz Iskandar Othman

  4. Universiti Teknikal Malaysia Melaka, Melaka, Malaysia

    Yahaya Abd Rahim

  5. Universiti Teknikal Malaysia Melaka, Melaka, Malaysia

    Naim Che Pee

Appendix A

Appendix A

A comparison of the solutions obtained by proposed algorithms for Solomon’s 56 benchmark instances of 100 customer problems is given below.

Problem

BKS

CS

CFO

CRO

NV

TD

NV

TD

NV

TD

NV

TD

C101

10

828.94

10

828.94

10

828.94

10

828.94

C102

10

828.94

10

828.94

10

828.94

10

828.94

C103

10

828.06

10

828.07

10

828.06

10

828.06

C104

10

824.78

10

824.78

10

824.78

10

824.78

C105

10

828.94

10

828.94

10

828.94

10

828.94

C106

10

828.94

10

828.94

10

828.94

10

828.94

C107

10

828.94

10

828.94

10

828.94

10

828.94

C108

10

828.94

10

828.94

10

828.94

10

828.94

C109

10

828.94

10

828.94

10

828.94

10

828.94

C201

3

591.56

3

591.56

3

591.56

3

591.56

C202

3

591.56

3

591.56

3

591.56

3

591.56

C203

3

591.17

3

591.17

3

591.17

3

591.17

C204

3

590.60

3

590.60

3

590.60

3

590.60

C205

3

588.88

3

588.88

3

588.88

3

588.88

C206

3

588.49

3

588.49

3

588.49

3

588.49

C207

3

588.29

3

588.29

3

588.29

3

588.29

C208

3

588.32

3

588.32

3

588.32

3

588.32

R101

19

1650.80

20

1643.79

20

1648.34

19

1651.36

R102

17

1486.86

18

1474.28

18

1476.61

18

1474.13

R103

13

1292.67

14

1215.59

14

1213.62

14

1215.59

R104

9

1007.31

11

981.57

11

976.61

11

981.56

R105

14

1377.11

15

1360.78

15

1366.69

15

1360.78

R106

12

1252.03

13

1240.53

13

1254.16

13

1253.56

R107

10

1097.01

11

1083.89

11

1079.78

11

1082.68

R108

9

960.88

10

946.74

10

951.10

10

972.16

R109

11

1194.73

12

1154.73

13

1166.32

12

1169.19

R110

10

1118.84

12

1105.98

12

1087.95

12

1111.71

R111

10

1096.73

11

1054.23

12

1084.56

11

1059.86

R112

9

982.14

10

969.34

10

1007.14

11

978.70

R201

4

1252.37

6

1183.87

7

1158.82

7

1177.47

R202

3

1191.70

5

1074.57

6

1049.50

5

1066.33

R203

3

939.50

4

921.22

6

881.12

4

930.48

R204

2

825.52

4

739.76

4

738.41

3

766.95

R205

3

994.43

5

957.58

5

964.72

5

958.46

R206

3

906.14

5

884.89

4

892.13

4

902.81

R207

2

890.61

4

818.56

3

817.88

4

818.56

R208

2

726.82

4

733.86

4

705.33

4

720.30

R209

3

909.16

5

886.62

5

869.91

5

866.40

R210

3

939.37

5

932.73

5

922.26

4

941.60

R211

2

776.32

3

820.29

4

775.11

3

820.29

RC101

14

1696.95

15

1627.71

16

1642.03

16

1644.45

RC102

12

1554.75

14

1466.44

15

1501.02

14

1466.44

RC103

11

1261.67

12

1285.70

12

1329.89

12

1282.66

RC104

10

1135.48

10

1143.06

11

1170.77

10

1206.99

RC105

13

1629.44

15

1547.44

16

1552.89

15

1533.29

RC106

11

1424.73

13

1379.71

14

1403.96

13

1394.88

RC107

11

1230.48

12

1218.37

13

1254.77

12

1211.11

RC108

10

1139.82

11

1135.87

11

1148.27

11

1150.64

RC201

4

1406.94

7

1280.19

7

1284.29

7

1441.92

RC202

3

1365.64

6

1276.48

8

1095.64

6

1439.79

RC203

3

1049.62

4

952.80

5

932.70

4

952.80

RC204

3

798.46

3

809.42

4

806.57

4

795.48

RC205

4

1297.65

7

1220.22

8

1181.28

6

1258.06

RC206

3

1146.32

5

1108.06

5

1073.38

6

1118.09

RC207

3

1061.14

5

1056.18

6

977.34

5

1003.94

RC208

3

828.14

3

876.83

4

800.31

3

917.99

  1. Notes: BKS is the best known solution provided by published papers. NV is the number of vehicles. TD is the total distance travelled.

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Saeheaw, T., Charoenchai, N. (2016). Comparison of Meta-heuristic Algorithms for Vehicle Routing Problem with Time Windows. In: Sulaiman, H., Othman, M., Othman, M., Rahim, Y., Pee, N. (eds) Advanced Computer and Communication Engineering Technology. Lecture Notes in Electrical Engineering, vol 362. Springer, Cham. https://doi.org/10.1007/978-3-319-24584-3_108

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-24584-3_108

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-24582-9

  • Online ISBN: 978-3-319-24584-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation