Tackling permutation-based optimization problems with an algebraic particle swarm optimization algorithm

DOI10.3233/FI-2019-1812MaRDI QIDQ5223210zbMATH OpenOpenAlexWikidataFDO

Authors Valentino Santucci, Marco Baioletti, Alfredo Milani

Publication date 17 July 2019

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2019-1812

zbMATH Keywords

permutation problemsalgebraic particle swarm optimizationpermutation search space

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A hybrid particle swarm optimization algorithm for the permutation flowshop scheduling problem
• A Particle Swarm Approach to Quadratic Assignment Problems
• scientific article; zbMATH DE number 2159383
• A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan
• Different approaches to particle swarm optimization for discrete systems

Cited in

(1)

• An algebraic approach for the search space of permutations with repetition

This page was built for publication: Tackling permutation-based optimization problems with an algebraic particle swarm optimization algorithm

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