The thesis is aimed at solving classical vehicle routing problems and orienteering problems. Vehicle routing concentrates on constructing routes for particular vehicles to handle customer requests. Classical vehicle routing problems take into account the limited capacities of vehicles and the time windows required for specific delivery and/or pickup requests. Given the limited time or capacity, it may become impossible to satisfy all requests, which is further studied by orienting problems.

Recently, the slack induction by string removals heuristic [1] was proposed as a variant of the large neighborhood search. It allows the solving of large vehicle routing problems efficiently. However, its implementation is not available, and the existence of available open-source implementations for vehicle routing problems is very limited. The thesis will implement this heuristic for representative variants of the classical vehicle routing problem. Furthermore, it will propose and implement its extension to solve representative orienteering problems. Results will be experimentally verified on benchmark problems or through generated problems when no suitable benchmarks exist.