One of the fundamental aspects to take into account when planning logistics for one or more vehicles is to know whether it is necessary to deliver and/or pick up orders within a time slot at each of the service points.
We are all familiar with the problem of distribution, be it medium or long distance or even last mile and the need to consolidate goods in logistics centers as an intermediate step between manufacturing points and final demand points.
Considerations about the problems of Task Sequencing (Scheduling) and Vehicle Routing (Routing), especially in scenarios of continuous production of goods that must be subsequently delivered to customers, surely with very strict time windows.
In goods delivery problems such as, for example, last mile parcel delivery, we have a set of demanding customers and another set of potential locations where to locate warehouses, intermediate warehouses, lockers or similar.
The Travelling Salesman Problem (TSP) answers the following question: given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and at the end returns to the city of origin?
A digital twin is nothing more than a simulation of a real object, which allows us to know its state, interact with it, and ultimately simulate its real behavior. A close example would be that of a commercial aircraft flight simulator.
Logistics operations:Are they really optimized? Who guarantees us that the planning we propose for our fleet cannot be improved? Suppose we have to visit 10 points (customers, warehouses, bars, depots…) starting from our central warehouse (the 11 red points in the first image): What is the optimal order to visit them in such a way […]
