Operations Research Group
The location routing problem (LRP) unites two important challenges in the design of distribution systems. On the one hand, the delivery of goods to customers needs to be planned as effectively as possible, and on the other hand, the location
RoutingSolver is an efficient solver for routing problems. Based entirely on local search and problem-knowledge, it computes high-quality solutions in a few seconds or minutes, while competing with the best algorithms in the field. It can also be applied to
Most popular benchmark sets for the VRP comprise instances of several hundred customers. To foster research in the area of very large scale vehicle routing we developed an additional set of very large scale and realistic benchmark instances. These instances
For many combinatorial optimization problems, heuristics based on either local search or constructive strategies have been demonstrated to provide the best trade-off between solution quality and computation time. In recent years, it has become apparent that the efficiency of a