3.8 Article

PARALLEL COOPERATIVE SAVINGS BASED ANT COLONY OPTIMIZATION - MULTIPLE SEARCH AND DECOMPOSITION APPROACHES

Journal

PARALLEL PROCESSING LETTERS
Volume 16, Issue 3, Pages -

Publisher

WORLD SCIENTIFIC PUBL CO PTE LTD
DOI: 10.1142/S0129626406002691

Keywords

Ant Colony Optimization; Decomposition Approach; Parallel Metaheuristic; Vehicle Routing Problem

Funding

  1. Special Research ProgramAURORA [SFB F011]
  2. Special Research Program Translational Research from the Fonds zur Forderung der wissenschaftlichen Forschung (FWF) [L286-N04]

Ask authors/readers for more resources

In this paper we study different parallel implementations of the Savings based Ant System algorithm developed for solving the Vehicle Routing Problem. We analyze the effects of low-level parallelization, multiple search strategies and domain decomposition approaches. For the different strategies speedup and efficiency as well as solution quality are reported. Different information exchanges are analyzed within the multiple search strategies.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

3.8
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available