A matheuristic for the cell formation problem

DOI10.1007/s11590-017-1200-3zbMath1401.90197OpenAlexW2755223745MaRDI QIDQ1744631

Rian Gabriel S. Pinheiro, Fábio Protti, Luiz Satoru Ochi, Ivan César Martins

Publication date: 19 April 2018

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-017-1200-3

zbMATH Keywords

combinatorial optimizationgroup technologyhybrid heuristicsmatheuristicscellular manufacturing

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• On solving manufacturing cell formation via bicluster editing
• A hybrid algorithm for a class of vehicle routing problems
• A hybrid genetic-variable neighborhood search algorithm for the cell formation problem based on grouping efficacy
• Variable neighborhood search
• Greedy randomized adaptive search procedures
• Matheuristics
• Set Partitioning: A survey
• A set‐partitioning‐based exact algorithm for the vehicle routing problem
• Efficient algorithms for cluster editing

This page was built for publication: A matheuristic for the cell formation problem