Combination and Comparison of Different Genetic Encodings for the Vehicle Routing Problem

Stefan Vonolfen, Andreas Beham, Michael Affenzeller, Stefan Wagner, Andreas Mayr

Publikation: Beitrag in FachzeitschriftArtikelBegutachtung

3 Zitate (Scopus)

Abstract

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.

OriginalspracheEnglisch
Seiten (von - bis)327-334
Seitenumfang8
FachzeitschriftLecture Notes in Computer Science
Jahrgang6927
AusgabenummerPART 1
DOIs
PublikationsstatusVeröffentlicht - Jän. 2012

Fingerprint

Untersuchen Sie die Forschungsthemen von „Combination and Comparison of Different Genetic Encodings for the Vehicle Routing Problem“. Zusammen bilden sie einen einzigartigen Fingerprint.

Zitieren