Python(编程语言)
车辆路径问题
计算机科学
软件
整数规划
布线(电子设计自动化)
软件工程
算法
程序设计语言
嵌入式系统
作者
Najib Errami,Eduardo Queiroga,Ruslan Sadykov,Eduardo Uchôa
出处
期刊:Informs Journal on Computing
日期:2023-12-28
标识
DOI:10.1287/ijoc.2023.0103
摘要
The optimization community has made significant progress in solving vehicle routing problems (VRPs) to optimality using sophisticated branch-cut-and-price (BCP) algorithms. VRPSolver is a BCP algorithm with excellent performance in many VRP variants. However, its complex underlying mathematical model makes it hardly accessible to routing practitioners. To address this, VRPSolverEasy provides a Python interface to VRPSolver that does not require any knowledge of mixed integer programming modeling. Instead, routing problems are defined in terms of familiar elements, such as depots, customers, links, and vehicle types. VRPSolverEasy can handle several popular VRP variants and arbitrary combinations of them. History: Accepted by Ted Ralphs, Area Editor for Software Tools. This paper has been accepted for the INFORMS Journal on Computing Special Issue on Software Tools for Vehicle Routing. Funding: This work was supported by Faperj [Grant E-26/202.887/2017] and Conselho Nacional de Desenvolvimento Científico e Tecnológico [Grant 305684/2022-1]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2023.0103 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2023.0103 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
科研通智能强力驱动
Strongly Powered by AbleSci AI