Metaheuristics for the Minimum Time Cut Path Problem with Different Cutting and Sliding Speeds

Metaheuristics for the Minimum Time Cut Path Problem with Different Cutting and Sliding Speeds

The problem of efficiently cutting smaller two-dimensional pieces from a larger surface is recurrent in several manufacturing settings. This problem belongs to the domain of cutting and packing (C&P) problems. This study approached a category of C&P problems called the minimum time cut path...

Full description

Bibliographic Details
Main Authors: Bonfim Amaro Junior, Marcio Costa Santos, Guilherme Nepomuceno de Carvalho, Luiz Jonatã Pires de Araújo, Placido Rogerio Pinheiro
Format: Article
Language:English
Published: MDPI AG 2021-10-01
Series:Algorithms
Subjects:
cut & packing problems
evolutionary computation
cut determination problem
Online Access:https://www.mdpi.com/1999-4893/14/11/305

Internet

https://www.mdpi.com/1999-4893/14/11/305

Similar Items