Setting the Configuration Parameters of the Algorithm for the Periodic Vehicle Routing Problem by HPC Power

Abstract

The quality of an opt imal solut ion of the Vehicle Rout ing Problem is st rongly depended on the sett ing of the configurat ion parameters of the algorithm. The paper is focused on the int roduct ion of hyperparameter search for solving the Vehicle Rout ing Problem using a HyperLoom plat form for defining and execut ing scient ific pipelines in a dist ributed environment . To give a concrete example, we focused on Periodic Vehicle Rout ing Problem for the waste collect ion. HyperLoom plat form was used to define and execute the hyperparameters sweep pipeline. The heurist ic algorithm was tested on a real benchmark of the waste collect ion in Ostrava, Czech Republic. The aim of our ca se was to effect ively combine the minimizat ion of the total t ravelled distance and the opt imizat ion of the fairness of the routes in terms of the standard deviat ion of a tour length. The waste collect ion problem was very extensive and computat ionally demanding, so it was necessary to use high performance comput ing architecture for test ing a large number of different sett ings of configurat ion parameters. The experiments were run on the supercomputer Salomon operated by IT4Innovations Nat ional Supercomput ing Center in the Czech Republic.