Other
Vehicle Routing Problem Models
Tonči Carić
Senka Pašagić
Zdenko Lanović
Abstract
The Vehicle Routing Problem cannot always be solved exactly,so that in actual application this problem is solved heuristically.The work describes the concept of several concrete VRPmodels with simplified initial conditions (all vehicles are ofequal capacity and start from a single warehouse), suitable tosolve problems in cases with up to 50 users.
Keywords
Capacitated Vehicle Routing Problem; linear model; graph; transport
Hrčak ID:
102326
URI
Publication date:
25.1.2004.
Visits: 389 *