Search for dissertations about: "Multi-Depot Vehicle-Routing problem"

Found 1 swedish dissertation containing the words Multi-Depot Vehicle-Routing problem.

2. 1. Probabilistic and Experimental Analysis of Heuristic Algorithms for the Multiple-Depot Vehicle-Routing Problem

   Author : Libertad Tansini; Chalmers tekniska högskola; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; probabilistic analysis; Multi-Depot Vehicle-Routing problem; heuristics; Time-Windows;

   Abstract : The aim of this thesis is to analyze different heuristic algorithms for solving the Multi-Depot Vehicle-Routing problem (MDVRP) with k depots and n points to be serviced (customers). The objective is to produce a set of service routes which minimizes the total distance traveled. Heuristic approaches are essential since the problem is NP-hard. READ MORE