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.

翻译：我们引入了BROUTE,这是车辆路线优化算法的基准套件。我们定义了传统上用于车辆路线优化的算法选择,它们捕捉了与不同应用领域的优化算法相关的基本特征,如本地搜索移动评价、记忆分配、动态编程,或从列表中插入和删除。每种算法都是决定性的。我们使用一些编程语言和不同的数据结构来实施这些基准算法。BROUTE是自由、开放的源码,可用于为涉及编程的项目的早期决策提供信息,例如使用何种语言。