TY - JOUR
T1 - Combination and Comparison of Different Genetic Encodings for the Vehicle Routing Problem
AU - Vonolfen, Stefan
AU - Beham, Andreas
AU - Affenzeller, Michael
AU - Wagner, Stefan
AU - Mayr, Andreas
PY - 2012/1
Y1 - 2012/1
N2 - Unlike for other problems, such as the traveling salesman problem, no widely accepted encodings for the vehicle routing problem have been developed yet. In this work, we examine different encodings and operations for vehicle routing problems. We show, how different encodings can be combined in one algorithm run and compare the individual encodings in terms of runtime and solution quality. Based on those results, we perform extensive test cases on different benchmark instances and show how the combination of different encodings and operations can be beneficial and provide a balance between solution quality and runtime.
AB - Unlike for other problems, such as the traveling salesman problem, no widely accepted encodings for the vehicle routing problem have been developed yet. In this work, we examine different encodings and operations for vehicle routing problems. We show, how different encodings can be combined in one algorithm run and compare the individual encodings in terms of runtime and solution quality. Based on those results, we perform extensive test cases on different benchmark instances and show how the combination of different encodings and operations can be beneficial and provide a balance between solution quality and runtime.
KW - genetic encoding
KW - vehicle routing problem
UR - http://www.scopus.com/inward/record.url?scp=84856827267&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-27549-4_42
DO - 10.1007/978-3-642-27549-4_42
M3 - Article
SN - 0302-9743
VL - 6927
SP - 327
EP - 334
JO - Lecture Notes in Computer Science
JF - Lecture Notes in Computer Science
IS - PART 1
ER -