@inproceedings{579ab2b8930944ddad5965e2d36ba921,
title = "How to generate benchmarks for rich routing problems?",
abstract = "In this paper, we show how to generate challenging benchmark tests for rich vehicle routing problems (VRPs) using a new heuristic algorithm (termed HeBeG{\textemdash}Heuristic Benchmark Generator). We consider a modified VRP with time windows, in which the depot does not define its time window. Additionally, the taxicab metric is utilized to determine the distance between travel points, instead of a standard Euclidean metric. HeBeG was used to create a test set for the qualifying round of Deadline24{\textemdash}an international 24-hour programming marathon. Finally, we compare the best results submitted to the server during the qualifying round of the contest with the routing schedules elaborated using other algorithms, including a new heuristics proposed in this paper.",
keywords = "Benchmark, Heuristics, VRPTW, Vehicle routing problem",
author = "Marcin Cwiek and Jakub Nalepa and Marcin Dublanski",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2016.; 8th Asian Conference on Intelligent Information and Database Systems, ACIIDS 2016 ; Conference date: 14-03-2016 Through 16-03-2016",
year = "2016",
doi = "10.1007/978-3-662-49381-6\_38",
language = "English",
isbn = "9783662493809",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "399--409",
editor = "Nguyen, \{Ngoc Thanh\} and Bogdan Trawinski and Tzung-Pei Hong and Hamido Fujita",
booktitle = "Intelligent Information and Database Systems - 8th Asian Conference, ACIIDS 2016, Proceedings",
address = "Germany",
}