VRPy Documentation

VRPy is a python framework for solving instances of different types of Vehicle Routing Problems (VRP) including:

• the Capacitated VRP (CVRP),

• the CVRP with resource constraints,

• the CVRP with time windows (CVRPTW),

• the CVRP with simultaneous distribution and collection (CVRPSDC),

• the CVRP with heterogeneous fleet (HFCVRP).

Check out section Vehicle Routing Problems to find more variants and options.

VRPy relies on the well known NetworkX package (graph manipulation), as well as on cspy, a library for solving the resource constrained shortest path problem.

Disclaimer

There is no guarantee that VRPy returns the optimal solution. See section Mathematical Background for more details, and section Performance profiles for performance comparisons with OR-Tools.

Authors

Romain Montagné (r.montagne@hotmail.fr)

David Torres Sanchez (d.torressanchez@lancs.ac.uk)

Contributors

@Halvaros

Table of contents

User Guide

• Getting started
  • Installation
  • Requirements
• Using VRPy
• Vehicle Routing Problems
  • Capacitated Vehicle Routing Problem (CVRP)
  • CVRP with resource constraints
  • CVRP with Time Windows (CVRPTW)
  • CVRP with Simultaneous Distribution and Collection (CVRPSDC)
  • CVRP with Pickup and Deliveries (VRPPD)
  • Periodic CVRP (PCVRP)
  • CVRP with heterogeneous fleet (HFCVRP)
  • VRP options
  • Other VRPs
• Solving Options
  • Setting initial routes for a search
  • Returning solution from initial heuristic
  • Locking routes
  • Setting a time limit
  • Linear programming or dynamic programming
  • Pricing strategy
  • A greedy randomized heuristic
• Examples
  • A simple example
  • An example borrowed from ortools
• API
  • vrpy.VehicleRoutingProblem
  • Notes
• Mathematical Background
  • A column generation approach
  • Does VRPy return an optimal solution?
  • TO DO
• Performance profiles
  • CVRP
  • CVRPTW
• Bibliography

• Index

• Search Page