Constraint handling in genetic algorithms: the set partitioning problem

DOI10.1023/A:1008668508685MaRDI QIDQ2567866zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

combinatorial optimisationcrew schedulinggenetic algorithmsset partitioning

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 1054926
• Constraint handling in genetic algorithms using a gradient-based repair method
• An efficient constraint handling method for genetic algorithms
• Adaptive Penalty Methods for Genetic Optimization of Constrained Combinatorial Problems
• Solving the timetable problem with multiple constraints using genetic algorithms

Cited in

(23)

• Improving Benders decomposition using a genetic algorithm
• A dynamic programming based algorithm for the crew scheduling problem.
• Two genetic algorithms to solve a layout problem in the fashion industry
• A concurrent processing framework for the set partitioning problem
• Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs
• Modelling transfer line design problem via a set partitioning problem
• Inequality constraint handling in genetic algorithms using a boundary simulation method
• An evolutionary heuristic for the index tracking problem.
• A genetic algorithm for the vehicle routing problem
• A population heuristic for constrained two-dimensional non-guillotine cutting
• A variable neighborhood search approach to solve the order batching problem with heterogeneous pick devices
• Sequential testing in batches
• A new modeling and solution approach for the set-partitioning problem
• A relax-and-cut algorithm for the set partitioning problem
• Constraint handling in genetic algorithms using a gradient-based repair method
• Infeasibility handling in genetic algorithm using nested domains for production planning
• VERY STRONGLY CONSTRAINED PROBLEMS: AN ANT COLONY OPTIMIZATION APPROACH
• scientific article; zbMATH DE number 1054926 (Why is no real title available?)
• A hybrid soft computing approach for subset problems
• Valid Inequalities and Separation Algorithms for the Set Partitioning Problem
• A new genetic algorithm encoding for coalition structure generation problems
• Scatter search and bionomic algorithms for the aircraft landing problem
• A dual ascent procedure for the set partitioning problem

Describes a project that uses

Uses Software

• OR-Library

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2567866)