Solving a leader–follower facility problem via parallel evolutionary approaches

A leader–follower facility problem is considered in this paper. The objective is to maximize the profit obtained by a chain (the leader) knowing that a competitor (the follower) will react by locating another single facility after the leader locates its own facility. A subpopulation-based evolutiona...

Full description

Saved in:
Bibliographic Details
Published in:The Journal of supercomputing Vol. 70; no. 2; pp. 600 - 611
Main Authors: Arrondo, A. G., Redondo, J. L., Fernández, J., Ortigosa, P. M.
Format: Journal Article
Language:English
Published: Boston Springer US 01.11.2014
Subjects:
Algorithms
Chains
Compilers
Computation
Computer Science
Evolutionary
Interpreters
Mathematical models
Optimization
Parallel processing
Processor Architectures
Programming
Programming Languages
Distributed memory
Nonlinear bi-level programming problem
High performance computing
Shared memory
Evolutionary algorithm
ISSN:0920-8542, 1573-0484
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A leader–follower facility problem is considered in this paper. The objective is to maximize the profit obtained by a chain (the leader) knowing that a competitor (the follower) will react by locating another single facility after the leader locates its own facility. A subpopulation-based evolutionary algorithm called TLUEGO was recently proposed to cope with this hard-to-solve global optimization problem. However, it requires high computational effort, even to manage small-size problems. In this work, three parallelizations of TLUEGO are proposed, a distributed memory programming algorithm, a shared memory programming algorithm, and a hybrid of the two previous algorithms, which not only allow us to obtain the solution faster, but also to solve larger instances.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0920-8542
1573-0484
DOI:10.1007/s11227-014-1106-0