2019
DOI: 10.1007/978-981-13-8311-3_16
|View full text |Cite
|
Sign up to set email alerts
|

Apache Spark as a Tool for Parallel Population-Based Optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
4
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
2
1
1

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 18 publications
0
4
0
Order By: Relevance
“…In [188], Spark is used for developing a Particle Swarm Optimization and a Differential Evolution algorithm. Finally, authors of [189] introduce a parallel population-based optimization algorithm with Spark. Another interesting work along this line is [190], in which a scalable Genetic Algorithm is developed using Apache Spark.…”
Section: Bio-inspired Computation For Data Processing and Learningmentioning
confidence: 99%
“…In [188], Spark is used for developing a Particle Swarm Optimization and a Differential Evolution algorithm. Finally, authors of [189] introduce a parallel population-based optimization algorithm with Spark. Another interesting work along this line is [190], in which a scalable Genetic Algorithm is developed using Apache Spark.…”
Section: Bio-inspired Computation For Data Processing and Learningmentioning
confidence: 99%
“…Spark-based ant colony optimization algorithm for solving the TSP was proposed in [13]. A Sparkbased version of the population learning metaheuristic applied, among others, to job-shop scheduling problem (JSSP) can be found in [14]. Some extensive reviews of developments in the field of parallel metaheuristics can be found in [15], [16], and [17].…”
Section: Introductionmentioning
confidence: 99%
“…Distributed ant colony optimization algorithm for solving the TSP was proposed in [25]. Parallel version of the population learning metaheuristic applied, among other, to TSP can be found in [26].…”
Section: Introductionmentioning
confidence: 99%
“…Performance of the so far developed algorithms and methods for solving TSP and JSSP still leaves a room for improvements in terms of both minimization of computation error and computation time; The idea of employing a set of simple asynchronous agents exploring the solution space and trying to improve currently encountered solutions has already proven successful in numerous applications of the authors (see for example [26,38,39]).…”
mentioning
confidence: 99%