Skip to content

BlockScience/rideshare-model

Repository files navigation

End-to-End Ride-Sharing Pricing Mechanism Model

This repo acts as an example of how to work through the steps of ideating & conceptualizing, determining system requirements, implementing, and testing a model. It also serves as a practical example of how to use MSML to generate math specs and cadCAD to generate models and run simulations.

Problem Overview

The objective of this project is to optimize the process of matching drivers with riders in a ride-sharing service by using a weighted directed graph model to represent the service area. This model substitutes physical geography with travel times between regions.

Key components include:

Additionally, the project introduces the Discounted Integral Priority Routing (DIPR) algorithm to address congestion. DIPR prioritizes routing based on historical queue lengths, aiming to reduce congestion and optimize routing and pricing dynamically.

The project uses MSML (Model-Specification Markup Language) and cadCAD (Complex Adaptive Dynamics Computer-Aided Design) to generate models and run simulations.

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published