A memetic approach to vehicle routing problem with dynamic requests

Jacek Mańdziuk , Adam Żychowski

Abstract

The paper presents an effective algorithm for solving Vehicle Routing Problem with Dynamic Requests based on memetic algorithms. The proposed method is applied to a widely-used set of 21 benchmark problems yielding 14 new best-know results when using the same numbers of fitness function evaluations as the comparative methods. Apart from encouraging numerical outcomes, the main contribution of the paper is investigation into the importance of the so-called starting delay parameter, whose appropriate selection has a crucial impact on the quality of results. Another key factor in accomplishing high quality results is attributed to the proposed effective mechanism of knowledge transfer between partial solutions developed in consecutive time slices. While particular problem encoding and memetic local optimization scheme were already presented in the literature, the novelty of this work lies in their innovative combination into one synergetic system as well as their application to a different problem than in the original works.
Author Jacek Mańdziuk ZSIMO
Jacek Mańdziuk,,
- Department of Artificial Intelligence and Computational Methods
, Adam Żychowski
Adam Żychowski,,
-
Journal seriesApplied Soft Computing, ISSN 1568-4946
Issue year2016
Vol48
Pages522-534
Publication size in sheets0.6
Keywords in EnglishVehicle routing, Memetic algorithm, Optimization under uncertainty, Scheduling, Dynamic optimization
Abstract in PolishPraca przedstawia efektywny algorytm rozwiązywania wariantu problemu transportowego z dynamicznymi zamówieniami (ang. Vehicle Routing Problem with Dynamic Requests, w skrócie VRP-DR) w oparciu o algorytmy memetyczne. Skuteczność zaproponowanego algorytmu została zweryfikowana eksperymentalnie na zbiorze powszechnie wykorzystywanych w literaturze 21 problemów testowych prowadząc do poprawienia najlepszych znanych dotychczas wyników w przypadku 14 z nich. Obok uzyskania wyżej wspomnianych najlepszych znanych rozwiązań części problemow benchmarkowych głównym osiągnięciem pracy jest zbadanie istotności doboru głównych parametrów modelu VRP-DR (liczba przedziałów czasowych oraz maksymalny czas opóźnienia wyjazdu ciężarówek).
DOIDOI:10.1016/j.asoc.2016.06.032
URL http://www.sciencedirect.com/science/article/pii/S156849461630312X
Languageen angielski
Score (nominal)40
ScoreMinisterial score = 40.0, 28-11-2017, ArticleFromJournal
Ministerial score (2013-2016) = 40.0, 28-11-2017, ArticleFromJournal
Publication indicators WoS Impact Factor: 2016 = 3.541 (2) - 2016=3.811 (5)
Citation count*0
Cite
Share Share



* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.
Back