Skip to Main content Skip to Navigation
Journal articles

A variable neighborhood search algorithm for the vehicle routing problem with multiple trips

Abstract : 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
Document type :
Journal articles
Complete list of metadata

https://hal-uphf.archives-ouvertes.fr/hal-03401358
Contributor : Mylène Delrue Connect in order to contact the contributor
Submitted on : Monday, October 25, 2021 - 1:02:53 PM
Last modification on : Tuesday, October 26, 2021 - 4:00:35 AM

Identifiers

Collections

Citation

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, Elsevier, 2015, 47, pp.277-284. ⟨10.1016/j.endm.2014.11.036⟩. ⟨hal-03401358⟩

Share

Metrics

Record views

4