Two genetic algorithms to solve a layout problem in the fashion industry

DOI10.1016/S0377-2217(02)00706-3zbMath1099.90564OpenAlexW1981708558MaRDI QIDQ1420438

Jurgen Martens

Publication date: 2 February 2004

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00706-3

zbMATH Keywords

integer programminggenetic algorithmslayout problemproblem formulation

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Case-oriented studies in operations research (90B90) Discrete location and assignment (90B80)

Related Items (3)

Ant colony optimization for solving an industrial layout problem ⋮ Layout optimisation for an installation port of an offshore wind farm ⋮ Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry

Cites Work

• Unnamed Item
• Unnamed Item
• A genetic algorithm for the multidimensional knapsack problem
• Alternative formulations for a layout problem in the fashion industry
• Constraint handling in genetic algorithms: the set partitioning problem
• A Mixed Integer Programming Model for Solving a Layout Problem in the Fashion Industry

This page was built for publication: Two genetic algorithms to solve a layout problem in the fashion industry