engleski

Vehicle Routing Problem Solving System as a CRO-GRID Application

Transport logistics and fleet management problems often fall into one class of the optimization problems. Finding an optimal set of routes for group of vehicles in the transport network under defined constraints is known as the Vehicle Routing Problem (VRP). VRP represents the NP hard problem. Solving of the VRP problem can be shortened by parallelization of the time critical steps of the sequential algorithm, decomposition of the problem and distribution of its search space among the processors or by concurrent search with different amounts of synchronism and cooperation among sub-problems. The paper presents the description of the developed VRP solving system Venera/Mars and the discussion of results obtained by the implementation of the heuristic algorithms for solving the practical VRP problems in city logistics.

VRP ; Algorithms ; CRO-GRID

nije evidentirano