LES DERNIÈRES INFORMATIONS
Memetic algorithm for a multi-objective vehicle routing problem with multiple trips
Titre | Memetic algorithm for a multi-objective vehicle routing problem with multiple trips |
Publication Type | Journal Article |
Year of Publication | 2013 |
Authors | Ayadi, R, Benadada, Y |
Journal | International Journal of Computer Science and Applications |
Volume | 10 |
Pagination | 72-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.
|
URL | https://www.scopus.com/inward/record.uri?eid=2-s2.0-84888047908&partnerID=40&md5=8b8db1347e09567c32c9a37e1aa3e164 |
Compteur de visiteurs:374,498
Education - This is a contributing Drupal Theme
Design by
WeebPal.