A compilation of OR tools for the Stochastic-Dynamic perishable Inventory Routing Problem.
-
Updated
Mar 31, 2024 - Jupyter Notebook
#
sequential-decision-problem
Here are 4 public repositories matching this topic...
This simulator uses a proposed non-myopic cost function approximation policy to allow passengers to have synchronized transfers within a ride-pooling system.
dynamic-routing transfers ride-sharing-simulator ride-sharing dial-a-ride pickup-and-delivery ride-pool ridepooling sequential-decision-problem cfa-policy ridepooling-with-transfers
-
Updated
Apr 12, 2024 - Java
Core library for optimizing CUDA+MPI programs as sequential decision problems.
-
Updated
Mar 4, 2022 - C++
NOMAD-RPS is a dynamic ride-pooling simulator that uses a non-myopic cost function approximation policy to make sequential decisions and find the best matches between riders and vehicles in the system
dynamic-routing ride-sharing-simulator ride-sharing dial-a-ride pickup-and-delivery ride-pool ridepooling sequential-decision-problem cfa-policy
-
Updated
Apr 15, 2024 - Java
Improve this page
Add a description, image, and links to the sequential-decision-problem topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the sequential-decision-problem topic, visit your repo's landing page and select "manage topics."