Memetic algorithm for a multi-objective vehicle routing problem with multiple trips

TitreMemetic algorithm for a multi-objective vehicle routing problem with multiple trips
Publication TypeJournal Article
Year of Publication2013
AuthorsAyadi, R, Benadada, Y
JournalInternational Journal of Computer Science and Applications
Volume10
Pagination72-91
Abstract

This paper considers a variant of the vehicle routing problem where vehicles are allowed to take more than one route during the working day. A restricted fleet size is used in order to serve customers' demand. Therefore, vehicles could exceed the time horizon. The objective is to optimize both maximum overtime and routing cost. A mathematical model has been proposed for the VRPM. A memetic algorithm has been developed to solve it by combining a genetic algorithm based on suitable encoding and genetic operators, with a local search procedure. The algorithm is run over a benchmark of the VRPM. Comparing with seven existing algorithms, our approach shows competitive performance and contributes many new best solutions. © Technomathematics Research Foundation.

URLhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84888047908&partnerID=40&md5=8b8db1347e09567c32c9a37e1aa3e164
Revues: 

Partenaires

Localisation


Location map

Suivez-nous sur

  

Contactez-nous

ENSIAS

Avenue Mohammed Ben Abdallah Regragui, Madinat Al Irfane, BP 713, Agdal Rabat, Maroc

Résultat de recherche d'images pour "icone fax" Télécopie : (+212) 5 37 77 72 30

    Compteur de visiteurs:280,168
    Education - This is a contributing Drupal Theme
    Design by WeebPal.