Adaptive cooperation in parallel memetic algorithms for rich vehicle routing problems Online publication date: Tue, 01-May-2018
by Jakub Nalepa; Miroslaw Blocho
International Journal of Grid and Utility Computing (IJGUC), Vol. 9, No. 2, 2018
Abstract: Designing and implementing cooperation schemes for parallel algorithms has become a very important task recently. The scheme, which defines the cooperation topology, frequency and strategies for handling transferred solutions, has a tremendous influence on the algorithm search capabilities, and can help balance the exploration and exploitation of the vast solution space. In this paper, we present both static and dynamic schemes - the former are selected before the algorithm execution, whereas the latter are dynamically updated on the fly to better respond to the optimisation progress. To understand the impact of such cooperation approaches, we applied them in the parallel memetic algorithms for solving rich routing problems, and performed an extensive experimental study using well-known benchmark sets. This experimental analysis is backed with the appropriate statistical tests to verify the importance of the retrieved results.
Online publication date: Tue, 01-May-2018
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Grid and Utility Computing (IJGUC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email email@example.com