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.
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.

Nearest neighbor method with local improvement 2-opt shortens the trip. It takes into account the vehicle's load capacity and point time windows.
Drag collections between routes. Change a vehicle or driver in a single action.
If the combined collection weights exceed vehicle capacity, the board displays a warning before approval.
The proposal does not change the plan itself. The dispatcher checks it and the approval is recorded in the history.
Uncompleted points go to another vehicle. Completed collections are not counted twice.
The plan is displayed on a MapLibre map with OpenStreetMap data. Points without coordinates are indicated separately.
The calendar creates collections from cycles for subsequent weeks, without point-waste stream-date duplicates.
The dispatcher divides pickups into routes and assigns a vehicle and driver.
The algorithm sorts the points and shows its limitations.
The dispatcher moves collections on the board, checks warnings and approves the plan.
The driver sees the approved order in the NexaWaste Operator app.
No. Distances are counted in a straight line between points. Road routing and live traffic require a map provider to be connected.
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.
No. The proposal requires approval from the dispatcher. Every change of plan goes down in history.
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.