A variable neighborhood search algorithm for the vehicle routing problem with multiple trips
Résumé
The vehicle routing problem with multiple trips (V RP M T ) is a variant of thestandard (V RP ), where each vehicle can be used more than once during the workingperiod. For this NP-Hard problem, we propose a variable neighborhood searchAlgorithm in which four neighborhood structure are designed to find the planning oftrips. The algorithm was tested over a set of benchmark problems and the obtainedsolutions were compared with five previously proposed algorithms. Encouragingresults are obtained