2008
EMSS 2008 Proceeding
A cluster-based optimization approach for the vehicle routing problem with time windows
Authors: Michael Bögl
Abstract
In this paper we describe a simple cluster approach for solving the Vehicle Routing Problem with Time Windows (VRPTW). The idea is to combine heuristic and exact approaches to solve the problem. This is done by decomposing the problem into two sub-problems. The first step consists of building customer clusters, in the second step, those clusters are solved with an exact method. We present computational results for the Solomon benchmark problems.
I3M Scientific Sponsors
I3M Industrial Sponsors
I3M Media Sponsors
