# Definition The VRP is represented as a set of nodes to be visited that are the clients and a set of vehicles initially located in a particular node called a deposit, the objective is to assign routes to the vehicles orderly sequence of nodes, tending to minimize the total cost of transportation. The problem of routes for classic vehicles (VRP) aims to find a set of routes at a minimum cost. Find the shortest path, minimizing the number of vehicles, which starts and ends the route in the warehouse, so that it is fulfilled the known demand of all the nodes. Each node is visited only once, for a single vehicle, and each vehicle has a limited capacity --- # Agent Instructions: Querying This Documentation If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question. Perform an HTTP GET request on the current page URL with the `ask` query parameter: ``` GET https://alfredo-reyes-montero.gitbook.io/metaheuristics/optimization/linear-programing/uses-case/vroute/definitio.md?ask= ``` The question should be specific, self-contained, and written in natural language. The response will contain a direct answer to the question and relevant excerpts and sources from the documentation. Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.