Cooperative Parallel Metaheuristics based Penguin Optimization Search for Solving the Vehicle Routing Problem

Cooperative Parallel Metaheuristics based Penguin Optimization Search for Solving the Vehicle Routing Problem

Meryem Ammi, Salim Chikhi
Copyright: © 2016 |Pages: 18
DOI: 10.4018/IJAMC.2016010101
OnDemand:
(Individual Articles)
Available
$37.50
Current Special Offers
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

In this work the authors present a new approach based on the cooperation of many variants of metaheuristics in order to solve the large existing benchmark instances of the capacitated vehicle routing problem (CVRP). The proposed method follows the parallel pattern of the generalized island model (GIM). Consequently, the used metaheuristics, namely genetic algorithm (GA), the ant colony optimization (ACO), and the first application of the penguin optimization search (PEO) have been used to handle the large size of the CVRP. These optimization processes have been put over numerous islands that communicate via the process of exchanging solutions. Comparative studies as well as tests over the existing benchmark instances have been reported to prove the efficiency of the proposed approach.
Article Preview
Top

The state-of-the-art relevant to the works reported in the literature for solving the VRPs covers many types of methods. In this section, an outlook of the most remarkable works will be presented.

Complete Article List

Search this Journal:
Reset
Volume 15: 1 Issue (2024)
Volume 14: 1 Issue (2023)
Volume 13: 4 Issues (2022): 2 Released, 2 Forthcoming
Volume 12: 4 Issues (2021)
Volume 11: 4 Issues (2020)
Volume 10: 4 Issues (2019)
Volume 9: 4 Issues (2018)
Volume 8: 4 Issues (2017)
Volume 7: 4 Issues (2016)
Volume 6: 4 Issues (2015)
Volume 5: 4 Issues (2014)
Volume 4: 4 Issues (2013)
Volume 3: 4 Issues (2012)
Volume 2: 4 Issues (2011)
Volume 1: 4 Issues (2010)
View Complete Journal Contents Listing