A binary algebraic differential evolution for the multidimensional two-way number partitioning problem

DOI10.1007/978-3-030-16711-0_2zbMath1525.68214OpenAlexW2937650549MaRDI QIDQ6084514

Valentino Santucci, Alfredo Milani, Gabriele di Bari, Marco Baioletti

Publication date: 1 December 2023

Published in: Evolutionary Computation in Combinatorial Optimization (Search for Journal in Brave)

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

zbMATH Keywords

variable neighborhood descentbinary algebraic differential evolutionmultidimensional two-way number-partitioning problem

Mathematics Subject Classification ID

Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (1)

An algebraic approach for the search space of permutations with repetition

Cites Work

• Two metaheuristic approaches for solving multidimensional two-way number partitioning problem
• Integer linear programming model for multidimensional two-way number partitioning problem
• Differential evolution. A practical approach to global optimization. With CD-ROM.
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem
• A memetic algorithm approach for solving the multidimensional multi-way number partitioning problem
• Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problem
• Solving permutation flowshop scheduling problems with a discrete differential evolution algorithm
• MOEA/DEP: An Algebraic Decomposition-Based Evolutionary Algorithm for the Multiobjective Permutation Flowshop Scheduling Problem
• Unnamed Item

This page was built for publication: A binary algebraic differential evolution for the multidimensional two-way number partitioning problem