The Need for Route Optimisation

Route optimisation is required to ensure that clients' planning requirements are met efficiently. For this purpose, Shipsy’s optimiser tackles a complex challenge known as the Vehicle Routing Problem (VRP). VRP is a problem closely connected to supply chain operations, focusing on the movement of goods from one or more depots using a specified fleet of vehicles, each operated by drivers who navigate a designated road network to reach a group of customers. The primary objective of VRP is to determine a set of optimal routes (denoted as S) for each vehicle, commencing and concluding at their respective depots while adhering to all customer demands and operational constraints. This optimisation process aims to minimise overall transportation costs, which can encompass various factors such as monetary expenses, travel distances, or other relevant considerations.

Shipsy’s optimizer possesses the capability to address different types of vehicle routing problems, including:

1. TSP (Travelling Salesman Problem): This problem revolves around finding the shortest route that visits a set of locations exactly once and returns to the starting point.
2. CVRP (Capacitated VRP): In CVRP, the challenge is to plan efficient routes for vehicles while ensuring they do not exceed their capacity constraints.
3. VRPTW (VRP with Time Windows): VRPTW involves the consideration of time constraints, where each customer has a specified time window during which they must be visited.
4. MDHVRPTW (Multi-Depot Heterogeneous Vehicle VRPTW): This problem extends VRPTW by accommodating multiple depots and different types of vehicles with varying capabilities.
5. PDPTW (Pickup-and-Delivery Problem with Time Windows): PDPTW involves not only delivering goods but also picking up items from certain locations, all within specified time windows.