Vehicle routing problem

From Glossary

Jump to: navigation, search

(VRP). Find optimal delivery routes from one or more depots to a set of geographically scattered points (e.g., population centers). A simple case is finding a route for snow removal, garbage collection, or street sweeping (without complications, this is akin to a shortest path problem). In its most complex form, the VRP is a generalization of the traveling salseman problem, as it can include additional time and capacity constraints, precedence constraints, plus more.

Personal tools