TSP: Traveling Salesman Problem and VRP: Vehicle Routing Problem

Students of Computer Science have to be familiar with the "Traveling Salesman Problem".

Link for image below:

• As per Wikipedia link, TSP (Traveling Salesman Problem) askes the 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 returns to the origin city?"
• As per Wikipedia link: VRP (Vehicle Routing Problem) is a combinatorial optimization and integer programming problem which asks "What is the optimal set of routes for a fleet of vehicles to traverse in order to deliver to a given set of customers?". It generalises the well-known travelling salesman problem (TSP)
• Interesting article at the link: "Scientists Solve Most Complex Traveling Salesman Problem Ever". Details: A new AI processor has extended the traveling salesman solution from 16 nodes to 22. The traveling salesman is an age-old exercise in optimization, studied in school and relevant to real life. Rearranging how data feeds through the processor allows more than one thread to compute at a time.