Genetic algorithms [5] and heuristic-based

The gap

Evidence profile

Sourced from the synthesized of the source papers, classified as general, drawn from work published between 1990 and 2026, spanning 4 journals.

Supporting evidence — 5 representative gaps

• An integer linear programming formulation and genetic algorithm for the maximum set splitting problem (2012) · Publications de l Institut Mathematique · doi

  Comparative performance evaluation of parallel metaheuristic approaches (genetic algorithms, particle swarm optimization) on Subset Sum is absent; [2] and [4] study these methods on related combinatorial problems (set splitting, knapsack) but [4] reveals convergence failures in set-based PSO, and neither evaluates scalability or parallel efficiency on Subset Sum instances.

  generalsynthesizedevidence 5/5
  Keywords: comparative performance evaluation parallel metaheuristic approaches genetic algorithms
• An integer linear programming formulation and genetic algorithm for the maximum set splitting problem (2012) · Publications de l Institut Mathematique · doi

  Genetic algorithms [5] and heuristic-based parallelization [12] show promise for combinatorial problems, but no work applies genetic algorithms or population-based parallel methods to the subset sum problem specifically, leaving open whether such approaches can compete with exact parallel methods.

  generalsynthesizedevidence 5/5
  Keywords: genetic algorithms heuristic-based parallelization show promise combinatorial problems
• Index Dependent Nested Loops Parallelization with an Even Distributed Number of Steps (2021) · Informatica · doi

  No systematic study of load balancing strategies for nested-loop parallelization of Subset Sum enumeration algorithms; [7] addresses index-dependent nested loop partitioning for even workload distribution, but does not apply this to the specific structure and dependencies of Subset Sum search trees or dynamic programming approaches.

  generalsynthesizedevidence 5/5
  Keywords: systematic study load balancing strategies nested-loop parallelization subset
• Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics (1990) · Management Science · doi

  No exploration of hybrid parallel algorithms combining exact methods (branch-and-bound) with heuristic acceleration for Subset Sum; [8] demonstrates hybrid evolutionary methods for scheduling, but Subset Sum lacks a comparable hybrid framework that leverages both lower bounds from dual relaxations ([6]) and parallel metaheuristic search.

  generalsynthesizedevidence 5/5
  Keywords: exploration hybrid parallel algorithms combining exact methods branch-and-bound
• A hybrid approach to multi-objective unrelated parallel machine scheduling with a new interpretation of job batches and families (2026) · Soft Computing · doi

  Hybrid parallel approaches combining exact and heuristic methods for Subset Sum are not investigated; [8] demonstrates hybrid evolutionary methods for scheduling but does not address Subset Sum, and no paper explores parallel branch-and-bound with parallel metaheuristic lower bounds for Subset Sum.

  generalsynthesizedevidence 4/5
  Keywords: hybrid parallel approaches combining exact heuristic methods subset

Questions about this gap