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...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Bonfim Amaro Junior, Marcio Costa Santos, Guilherme Nepomuceno de Carvalho, Luiz Jonatã Pires de Araújo, Placido Rogerio Pinheiro
Formato:	article
Lenguaje:	EN
Publicado:	MDPI AG 2021
Materias:	cut & packing problems evolutionary computation cut determination problem Industrial engineering. Management engineering T55.4-60.8 Electronic computers. Computer science QA75.5-76.95
Acceso en línea:	https://doaj.org/article/20e44d3344f8454da7194fe4fad662c7
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:20e44d3344f8454da7194fe4fad662c7
record_format	dspace
spelling	oai:doaj.org-article:20e44d3344f8454da7194fe4fad662c72021-11-25T16:12:56ZMetaheuristics for the Minimum Time Cut Path Problem with Different Cutting and Sliding Speeds10.3390/a141103051999-4893https://doaj.org/article/20e44d3344f8454da7194fe4fad662c72021-10-01T00:00:00Zhttps://www.mdpi.com/1999-4893/14/11/305https://doaj.org/toc/1999-4893The 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 (MTCP) problem, which aims to identify a sequence of cutting and sliding movements for the head device to minimize manufacturing time. Both cutting and slide speeds (just moving the head) vary according to equipment, despite their relevance in real-world scenarios. This study applied the MTCP problem on the practical scope and presents two metaheuristics for tackling more significant instances that resemble real-world requirements. The experiments presented in this study utilized parameter values from typical laser cutting machines to assess the feasibility of the proposed methods compared to existing commercial software. The results show that metaheuristic-based solutions are competitive when addressing practical problems, achieving increased performance regarding the processing time for 94% of the instances.Bonfim Amaro JuniorMarcio Costa SantosGuilherme Nepomuceno de CarvalhoLuiz Jonatã Pires de AraújoPlacido Rogerio PinheiroMDPI AGarticlecut & packing problemsevolutionary computationcut determination problemIndustrial engineering. Management engineeringT55.4-60.8Electronic computers. Computer scienceQA75.5-76.95ENAlgorithms, Vol 14, Iss 305, p 305 (2021)
institution	DOAJ
collection	DOAJ
language	EN
topic	cut & packing problems evolutionary computation cut determination problem Industrial engineering. Management engineering T55.4-60.8 Electronic computers. Computer science QA75.5-76.95
spellingShingle	cut & packing problems evolutionary computation cut determination problem Industrial engineering. Management engineering T55.4-60.8 Electronic computers. Computer science QA75.5-76.95 Bonfim Amaro Junior Marcio Costa Santos Guilherme Nepomuceno de Carvalho Luiz Jonatã Pires de Araújo Placido Rogerio Pinheiro Metaheuristics for the Minimum Time Cut Path Problem with Different Cutting and Sliding Speeds
description	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 (MTCP) problem, which aims to identify a sequence of cutting and sliding movements for the head device to minimize manufacturing time. Both cutting and slide speeds (just moving the head) vary according to equipment, despite their relevance in real-world scenarios. This study applied the MTCP problem on the practical scope and presents two metaheuristics for tackling more significant instances that resemble real-world requirements. The experiments presented in this study utilized parameter values from typical laser cutting machines to assess the feasibility of the proposed methods compared to existing commercial software. The results show that metaheuristic-based solutions are competitive when addressing practical problems, achieving increased performance regarding the processing time for 94% of the instances.
format	article
author	Bonfim Amaro Junior Marcio Costa Santos Guilherme Nepomuceno de Carvalho Luiz Jonatã Pires de Araújo Placido Rogerio Pinheiro
author_facet	Bonfim Amaro Junior Marcio Costa Santos Guilherme Nepomuceno de Carvalho Luiz Jonatã Pires de Araújo Placido Rogerio Pinheiro
author_sort	Bonfim Amaro Junior
title	Metaheuristics for the Minimum Time Cut Path Problem with Different Cutting and Sliding Speeds
title_short	Metaheuristics for the Minimum Time Cut Path Problem with Different Cutting and Sliding Speeds
title_full	Metaheuristics for the Minimum Time Cut Path Problem with Different Cutting and Sliding Speeds
title_fullStr	Metaheuristics for the Minimum Time Cut Path Problem with Different Cutting and Sliding Speeds
title_full_unstemmed	Metaheuristics for the Minimum Time Cut Path Problem with Different Cutting and Sliding Speeds
title_sort	metaheuristics for the minimum time cut path problem with different cutting and sliding speeds
publisher	MDPI AG
publishDate	2021
url	https://doaj.org/article/20e44d3344f8454da7194fe4fad662c7
work_keys_str_mv	AT bonfimamarojunior metaheuristicsfortheminimumtimecutpathproblemwithdifferentcuttingandslidingspeeds AT marciocostasantos metaheuristicsfortheminimumtimecutpathproblemwithdifferentcuttingandslidingspeeds AT guilhermenepomucenodecarvalho metaheuristicsfortheminimumtimecutpathproblemwithdifferentcuttingandslidingspeeds AT luizjonatapiresdearaujo metaheuristicsfortheminimumtimecutpathproblemwithdifferentcuttingandslidingspeeds AT placidorogeriopinheiro metaheuristicsfortheminimumtimecutpathproblemwithdifferentcuttingandslidingspeeds
_version_	1718413244386770944

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

Ejemplares similares