vrp#

Vehicle Routing Problem with Fair Profits and Time Windows (VRP-FPTW)#

Notebooks > Vehicle Routing Problem with Fair Profits and Time Windows (VRP-FPTW)
vrp_fptw.ipynb Open In Colab Open In Deepnote Open In Kaggle Open In Gradient Open In SageMaker Studio Lab
Description: This notebook implements and solves the Vehicle Routing Problem with Fair Profits and Time Windows (VRP-FPTW), a realistic and recent extension of the classical VRP problem.
Tags: amplpy, routing, vrp, time-windows, mp, cuopt, highs, gurobi, research, automatic-reformulation, benchmark
Author: Aitor Lopez (1 notebook) <aitor.lopez@urjc.es>, Marcos Dominguez Velad (31 notebooks) <marcos@ampl.com>