Feed on
Posts
Comments

Tag Archive 'traveling salesman'

Routing optimization in a humanitarian context
Routing optimization generally solves the Vehicle Routing Problem (a simple example being the more widely known Traveling Salesman Problem). A more complex example would be the distribution of goods by a fleet of multiple vehicles to dozens of locations, where each vehicle has certain time windows in which it can operate and [...]

Read Full Post »

In a Vehicle Routing Problem (VRP, an example is the Traveling Salesman Problem), we are concerned with finding optimal routes for a fleet of vehicles having to reach given destinations, e.g., in order to deliver goods to customers. Due to its high computational complexity, this task requires dedicated VRP solvers, such as VROOM. In collaboration with [...]

Read Full Post »