Swarm algorithms to solve selected problems of discrete and combinatorial optimization

From MaRDI portal





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.











This page was built for publication: Swarm algorithms to solve selected problems of discrete and combinatorial optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802891)