ERRAMI, Najib; QUEIROGA, Eduardo; SADYKOV, Ruslan; UCHOA, Eduardo

Metadatos

Licencia de uso del documento

ERRAMI, Najib
Formulations étendues et méthodes de décomposition pour des problèmes génériques d'optimisation [EDGE]

QUEIROGA, Eduardo
Formulations étendues et méthodes de décomposition pour des problèmes génériques d'optimisation [EDGE]

SADYKOV, Ruslan
Formulations étendues et méthodes de décomposition pour des problèmes génériques d'optimisation [EDGE]

Idioma

Document de travail - Pré-publication

Este ítem está publicado en

2023-04-04

Resumen en inglés

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.< Leer menos

Metadatos

Compartir este ítem

Licencia de uso del documento

VRPSolverEasy: a Python library for the exact solution of a rich vehicle routing problem

Idioma

Este ítem está publicado en

Resumen en inglés

URI

Orígen

Centros de investigación