Swarm algorithms to solve selected problems of discrete and combinatorial optimization (Q2802891)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Swarm algorithms to solve selected problems of discrete and combinatorial optimization |
scientific article; zbMATH DE number 6574383
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Swarm algorithms to solve selected problems of discrete and combinatorial optimization |
scientific article; zbMATH DE number 6574383 |
Statements
27 April 2016
0 references
swarm optimization
0 references
ant colony optimization
0 references
bees algorithm
0 references
firefly algorithms
0 references
cuckoo search
0 references
cockroach swarm optimization
0 references
discrete optimization
0 references
combinatorial optimization
0 references
0.8941207
0 references
0.89122564
0 references
0.8846345
0 references
Swarm algorithms to solve selected problems of discrete and combinatorial optimization (English)
0 references
This small monograph, in Polish, describes a number of swarm optimization algorithms: ant colony optimization (ACO), particle swarm optimization (PSO), bees algorithm (BA), firefly algorithms (FA), cuckoo search (CS), cockroach swarm optimization (CSO), and conducts studies on their use in discrete and combinatorial optimization. In particular, the The author adapts these algorithms to solve scheduling problems, quadratic assignment problems, travelling salesman problem and optimizations problems of queueing systems and networks. The existence of libraries with test instances and reference solutions allows to examine the quality of the implemented methods.
0 references