National Repository of Grey Literature 15 records found  previous11 - 15  jump to record: Search took 0.00 seconds. 
Split delivery vehicle routing problem
Marcinko, Tomáš ; Pelikán, Jan (advisor) ; Fábry, Jan (referee)
This thesis focuses on a description of the split delivery vehicle routing problem (SDVRP), in which the restriction that each customer has to be visited exactly once is not assumed, contrary to the classical vehicle routing problem, and split deliveries are allowed. Considering the fact that the split delivery vehicle routing problem in NP-hard, a number of heuristic algorithms proposed in the literature are presented. Computational experiments are reported and the results show that the largest benefits of split deliveries are obtained in case of instances with fairly specific characteristics and also several drawbacks of implemented Tabu Search algorithm (SPLITABU) are point out.

National Repository of Grey Literature : 15 records found   previous11 - 15  jump to record:
Interested in being notified about new results for this query?
Subscribe to the RSS feed.