The goal is to find optimal routes for a fleet of vehicles to visit the pickup and drop-off locations. VRPPD (Vehicle Routing Problem with Pickup and Delivery) : A number of goods need to be moved from certain pickup locations to other delivery locations.VRPTW (Vehicle Routing Problem with Time Windows) : The delivery locations have time windows within the deliveries (or visits) must be made.CVRP (Capacitated Vehicle Routing Problem) : Vehicles have a limited carrying capacity of the goods that must be delivered. There are many variants of vehicle routing problem. The vehicle routing problem (VRP) is a combinatorial and integer programming which ask “What is the optimal set of routes for a fleet of vehicles in order to deliver to a given set of customers?” It generalizes the well-known traveling salesman problem (TSP).
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |