  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.
