BROUTE: a benchmark suite for the implementation of standard vehicle routing algorithms

TL;DR

BROUTE is an open-source benchmark suite designed to evaluate standard vehicle routing algorithms across multiple programming languages and data structures, aiding decision-making in project development.

Contribution

It introduces a comprehensive, deterministic benchmark suite for vehicle routing algorithms, facilitating comparison and informed language and data structure choices.

Findings

Implemented algorithms in various languages and data structures.

Provides a standardized platform for early project decision-making.

Highlights the importance of algorithm implementation choices.

Abstract

We introduce BROUTE, a benchmark suite for vehicle routing optimization algorithms. We define a selection of algorithms traditionally used in vehicle routing optimization. They capture essential features that are also relevant in optimization algorithms for different application domains, like local search move evaluation, memory allocation, dynamic programming, or insertion and deletion from a list. Each algorithm is deterministic. We implement these benchmark algorithms using a selection of programming languages and different data structures. BROUTE is free, open-source, and can be used to inform early decisions in projects that involve programming, such as which language to use.