A Petri Net-Based Algorithm for Solving the One-Dimensional Cutting Stock Problem

A Petri Net-Based Algorithm for Solving the One-Dimensional Cutting Stock Problem

This paper addresses the one-dimensional cutting stock problem, focusing on minimizing total stock usage. Most procedures that deal with this problem reside on linear programming methods, heuristics, metaheuristics, and hybridizations. These methods face drawbacks like handling only low-complexity i...

Full description

Bibliographic Details
Main Authors: Irving Barragan-Vite, Joselito Medina-Marin, Norberto Hernandez-Romero, Gustavo Erick Anaya-Fuentes
Format: Article
Language:English
Published: MDPI AG 2024-09-01
Series:Applied Sciences
Subjects:
cutting problem
packing problem
Petri net
reachability tree
beam search
Online Access:https://www.mdpi.com/2076-3417/14/18/8172

Internet

https://www.mdpi.com/2076-3417/14/18/8172

Similar Items