ROUTE PLANNING

Route plan that the dispatcher understands and approves.
The algorithm proposes, the human decides.

Scheduled pickups go to routes, vehicles and drivers. The algorithm proposes an order taking into account payload and time windows. The dispatcher corrects the plan on the board and approves it before departure.

Key features: Route planning

Proposed order of collection stops

Nearest neighbor method with local improvement 2-opt shortens the trip. It takes into account the vehicle's load capacity and point time windows.

Dispatcher board

Drag collections between routes. Change a vehicle or driver in a single action.

Payload warning

If the combined collection weights exceed vehicle capacity, the board displays a warning before approval.

Human approval

The proposal does not change the plan itself. The dispatcher checks it and the approval is recorded in the history.

Reassignment after a breakdown

Uncompleted points go to another vehicle. Completed collections are not counted twice.

Route on the map

The plan is displayed on a MapLibre map with OpenStreetMap data. Points without coordinates are indicated separately.

REAL SCREENS

This is what it looks like
in the working version.

  • Dispatcher boardDrag pickup to another route. The system will check the record version and vehicle capacity.
  • Operational mapLocations, route plans and fleet positions. Actual positions require a GPS connection.
  • Collection calendarCycles, exceptions and holidays for addresses and waste streams.
Actual product screens: Dispatcher board. Click on the screen to see the next one.
HOW IT WORKS
  1. 01Generate collections

    The calendar creates collections from cycles for subsequent weeks, without point-waste stream-date duplicates.

  2. 02Assign to routes

    The dispatcher divides pickups into routes and assigns a vehicle and driver.

  3. 03Ask for a proposal

    The algorithm sorts the points and shows its limitations.

  4. 04Correct and confirm

    The dispatcher moves collections on the board, checks warnings and approves the plan.

  5. 05Completion

    The driver sees the approved order in the NexaWaste Operator app.

SCOPE IN PILOT VERSION

What works today,
and what requires configuration.

Running on the system
  • Order proposal: nearest neighbor and 2-opt, payload, time windows
  • Dispatcher board with dragging and swapping resources
  • Overload warnings
  • Manual approval of plan with history
  • Reassign unfinished collections without double counting
Requires your or provider details
  • Road routing provider with travel times
  • Live traffic data
  • Road restrictions, driver breaks and transhipment points – under development

Frequently asked questions

Does the system calculate the route on roads?

No. Distances are counted in a straight line between points. Road routing and live traffic require a map provider to be connected.

Is this a full VRP solver?

No. This is a nearest neighbor heuristic with 2-opt improvement, payload and time windows. It serves as a starting point for the dispatcher, not as a ready-made plan.

Can the algorithm change the plan itself?

No. The proposal requires approval from the dispatcher. Every change of plan goes down in history.

LET'S START WITH YOUR NEEDS

A cleaner city.
A more efficient team.
Let’s talk.

Choose a product and a conversation topic. The request will receive a number and go to the service center; We will respond to the address provided.

Presentation of real screensScope tailored to processesClear stages and acceptance criteria

Operational contact does not require marketing consent.