SolveRoutes
Traveling Salesman Problem (TSP)
Overview: The Traveling Salesman Problem involves finding the shortest possible route that visits a set of locations and returns to the starting location.
How It Works:
- Input:
- Users can choose locations by clicking on the map.
- Alternatively, users can upload an Excel file containing latitude and longitude for each location.(The browsing box is situated beneath the map)
- Then click optimize to get the job done.
- Output: The optimized route that minimizes the total distance traveled.
Input Image
Choose locations on the map
or upload an Excel file
The Excel file should contain 2 columns: latitude and longitude of the location.
Output Image
Vehicle Routing Problem (VRP)
Overview: The Vehicle Routing Problem involves finding the shortest possible route that visits a set of locations and returns to the starting location.(The browsing box is situated beneath the map)
How It Works:
- Input:
- Users can choose locations by clicking on the map.
- Alternatively, users can upload an Excel file containing latitude and longitude for each location.
- The click on optimize shows a form to insert the number of vehicles.
- Then click optimize to get the job done.
- Output: The optimized route that minimizes the total distance traveled.
Input Image
Choose locations on the map
or upload an Excel file
The Excel file should contain 2 columns: latitude and longitude of the location.
Output Image
Capacitated Vehicle Routing Problem (CVRP)
Overview: The Capacitated Vehicle Routing Problem is an extension of VRP with vehicle capacity constraints.
How It Works:
- Input:
- Users can choose locations by clicking on the map.
- Alternatively, users can upload an Excel file containing latitude and longitude and demand for each location.(The browsing box is situated beneath the map)
- Fill the form on the left with the number of vehicles and the capacity of each vehicle.
- Click optimize to get the job done.
- Output: The optimized route that minimizes the total distance traveled.
Input Image
Choose locations on the map
or upload an Excel file
The Excel file should contain 3 columns: latitude, longitude, and demand of that location.
Output Image
Vehicle Routing Problem with Time Windows (VRPTW)
Overview: The VRPTW extends VRP by incorporating time windows for each location.
How It Works:
- Input:
- Users can choose locations by clicking on the map and enter the start time and end time for each location.(The browsing box is situated beneath the map)
- Alternatively, users can upload an Excel file containing latitude and longitude for each location.
- Click on optimize; a form shows up to insert the number of vehicles.
- Click optimize to get the job done.
- Output: The optimized route that minimizes the total distance traveled.
Input Image
Choose locations on the map
or upload an Excel file
The Excel file should contain 4 columns: latitude, longitude, start time, and end time.
Output Image
