Constraint handling in genetic algorithms: the set partitioning problem

From MaRDI portal
Publication:2567866

DOI10.1023/A:1008668508685zbMath1071.90573OpenAlexW1567206874MaRDI QIDQ2567866

Yanyan Li

Publication date: 13 October 2005

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008668508685




Related Items (21)

A population heuristic for constrained two-dimensional non-guillotine cuttingSequential testing in batchesInfeasibility handling in genetic algorithm using nested domains for production planningA variable neighborhood search approach to solve the order batching problem with heterogeneous pick devicesExploiting variable associations to configure efficient local search algorithms in large-scale binary integer programsValid Inequalities and Separation Algorithms for the Set Partitioning ProblemA dynamic programming based algorithm for the crew scheduling problem.Two genetic algorithms to solve a layout problem in the fashion industryA hybrid soft computing approach for subset problemsA new modeling and solution approach for the set-partitioning problemA relax-and-cut algorithm for the set partitioning problemA dual ascent procedure for the set partitioning problemModelling transfer line design problem via a set partitioning problemInequality constraint handling in genetic algorithms using a boundary simulation methodConstraint handling in genetic algorithms using a gradient-based repair methodAn evolutionary heuristic for the index tracking problem.VERY STRONGLY CONSTRAINED PROBLEMS: AN ANT COLONY OPTIMIZATION APPROACHImproving Benders decomposition using a genetic algorithmA concurrent processing framework for the set partitioning problemA genetic algorithm for the vehicle routing problemScatter search and bionomic algorithms for the aircraft landing problem


Uses Software



This page was built for publication: Constraint handling in genetic algorithms: the set partitioning problem