A memetic algorithm approach for solving the multidimensional multi-way number partitioning problem

DOI10.1016/j.apm.2013.03.075zbMath1427.05025MaRDI QIDQ1792021

Petrică C. Pop, Oliviu Matei

Publication date: 11 October 2018

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2013.03.075

zbMATH Keywords

combinatorial optimizationgenetic algorithmslocal searchmemetic algorithmnumber partitioning

Mathematics Subject Classification ID

05A17: Combinatorial aspects of partitions of integers

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

Related Items

A binary algebraic differential evolution for the multidimensional two-way number partitioning problem, Two metaheuristic approaches for solving multidimensional two-way number partitioning problem, GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem, A mixed-integer linear programming model to solve the multidimensional multi-way number partitioning problem, New mixed-integer linear programming model for solving the multidimensional multi-way number partitioning problem, An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks, A novel matheuristic approach for a two-stage transportation problem with fixed costs associated to the routes

Uses Software

• CPLEX
• Tabu search
• CBMix

Cites Work

• Unnamed Item
• Unnamed Item
• Integer linear programming model for multidimensional two-way number partitioning problem
• A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem
• An effective memetic algorithm for the cumulative capacitated vehicle routing problem
• A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
• A complete anytime algorithm for number partitioning
• Easily searched encodings for number partitioning
• Randomized methods for the number partitioning problem
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• Computing Partitions with Applications to the Knapsack Problem