An algebraic approach for the search space of permutations with repetition

DOI10.1007/978-3-030-43680-3_2zbMath1486.90163OpenAlexW3015449785MaRDI QIDQ2057112

Alfredo Milani, Marco Baioletti, Valentino Santucci

Publication date: 8 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-43680-3_2

zbMATH Keywords

algebraic approachdiscrete evolutionary algorithmspermutations with repetition

Mathematics Subject Classification ID

Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• A generalized permutation approach to job shop scheduling with genetic algorithms
• Variable neighborhood algebraic differential evolution: an application to the linear ordering problem with cumulative costs
• An advanced tabu search algorithm for the job shop problem
• Solving permutation flowshop scheduling problems with a discrete differential evolution algorithm
• Tackling Permutation-based Optimization Problems with an Algebraic Particle Swarm Optimization Algorithm
• MOEA/DEP: An Algebraic Decomposition-Based Evolutionary Algorithm for the Multiobjective Permutation Flowshop Scheduling Problem
• A binary algebraic differential evolution for the multidimensional two-way number partitioning problem

This page was built for publication: An algebraic approach for the search space of permutations with repetition