A variable neighborhood search algorithm for the vehicle routing problem with multiple trips - Université Polytechnique des Hauts-de-France
Article Dans Une Revue Electronic Notes in Discrete Mathematics Année : 2015

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
Fichier non déposé

Dates et versions

hal-03401358 , version 1 (25-10-2021)

Identifiants

Citer

Mohamed Cheikh, Mustapha Ratli, Omar Mkaouar, Bassem Jarboui. A variable neighborhood search algorithm for the vehicle routing problem with multiple trips. Electronic Notes in Discrete Mathematics, 2015, 47, pp.277-284. ⟨10.1016/j.endm.2014.11.036⟩. ⟨hal-03401358⟩
13 Consultations
0 Téléchargements

Altmetric

Partager

More