A two-level self-adaptive variable neighborhood search algorithm for the prize-collecting vehicle routing problem

This paper proposes a two-level self-adaptive variable neighborhood search (TLSAVNS) algorithm for the prize-collecting vehicle routing problem (PCVRP) based on the fact there are two levels of decisions in the PCVRP, namely the selection of customers to visit and the vehicle scheduling of selected customers. Computational results illustrates the efficiency of the proposed algorithm.