This tutorial shows how to find the best routes for a fleet of vehicles,
operated by a distribution company, to deliver goods from a distribution
center to a set of 25 grocery stores. Each store has a specific quantity
of demand for the goods, and each truck has a limited capacity for
carrying the goods. The main objective is to assign trucks in the fleet a
subset of the stores to service and to sequence the deliveries in a way
that minimizes the overall transportation costs.
This can be achieved by solving a vehicle routing problem (VRP). Once
the delivery sequence is determined, you will generate the turn-by-turn
directions for the resulting routes, which can be electronically distributed or printed and given to the drivers to make the deliveries.
Негізгі бет Networking Analysis: Servicing a set of orders with a fleet of vehicles
Пікірлер