Home▸Articles▸AI & Machine Learning

Microtransit Dispatch 2D: Cheapest-Insertion Routing

A practical application of optimization algorithms in urban transportation systems.

mysimulator teamUpdated June 2026≈ 3 min read▶ Open the simulation

What is Microtransit Dispatch 2D?

Microtransit dispatch 2D is a simulation that models the operation of a fleet of shared shuttles serving live pickup and dropoff requests. The system uses the cheapest-insertion heuristic to determine the most efficient route for each shuttle, balancing between minimizing travel time and maximizing passenger satisfaction.

This simulation provides insights into urban transportation challenges such as reducing traffic congestion and improving public transit efficiency through dynamic routing strategies.

How Does Cheapest-Insertion Work?

The cheapest-insertion heuristic is a method used to solve the vehicle routing problem (VRP) by iteratively adding new pickup or dropoff requests to existing routes. The algorithm calculates the cost of inserting each request into all possible positions in the current route and selects the position with the lowest additional cost.

By continuously updating routes based on real-time demand, this heuristic ensures that shuttles can serve multiple passengers efficiently without significantly increasing overall travel time.

live demo · related simulation● LIVE

Why Does It Matter?

Optimizing microtransit dispatch is crucial for urban planners and transportation companies as it helps reduce operational costs, improve service quality, and enhance the overall user experience. Efficient routing can lead to lower emissions and reduced traffic congestion in densely populated areas.

Moreover, real-time adjustments based on demand patterns allow transit systems to adapt quickly to changing conditions, providing a more flexible and responsive service.

Real-World Applications

The principles of microtransit dispatch 2D are applicable in various scenarios such as university campuses, corporate parks, and urban neighborhoods. For instance, a university might use this system to manage shuttle services between dormitories, classrooms, and dining halls.

In cities, similar strategies can be employed for on-demand bus or van services, enhancing the efficiency of public transportation networks.

Frequently asked questions

How does the simulation handle multiple pickup requests?

The cheapest-insertion heuristic evaluates each new request and inserts it into the current route at a position that minimizes the total travel cost, ensuring efficient use of available shuttles.

Can users customize their own routes in real-time?

Yes, by clicking on the map to drop off pickup and dropoff points, users can insert their own requests into the simulation, observing how the system adjusts the routes in real-time.

What are the benefits of using shared shuttles over individual vehicles?

Shared shuttles reduce operational costs and environmental impact by maximizing passenger capacity per vehicle. This approach also helps alleviate traffic congestion and improves overall transportation efficiency.

How does this simulation help in urban planning?

By providing insights into how different parameters affect route optimization, the simulation aids urban planners in designing more efficient transit systems that can handle varying levels of demand and traffic conditions.

Try it live

Everything above runs in your browser — open Microtransit Dispatch 2D — Cheapest-Insertion Routing and change the parameters while it is running. Nothing is installed, nothing is uploaded, the whole model lives in one tab.

▶ Open Microtransit Dispatch 2D — Cheapest-Insertion Routing simulation

What did you find?

Add reproduction steps (optional)