Vehicle Routing Algorithms
Wikia - creating communities
Vehicle routing is a combinatorial optimization problem, where a service provider has to service a set of customers at different sites within specified time intervals. The goal is to maximize the number of customers serviced, while satisfying the timing constraints. This is a generalization of the travelling salesman problem.
|
English | ||
|
| ||
|
Started 18 June, 2008 by Arindamp. (current admins) | ||
Click here to see questions about Vehicle Routing Algorithms from 
| ||
