Skip to Content

2,085 Results Found

  • Article
  • Open Access
7 Citations
3,928 Views
27 Pages

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

  • Bonfim Amaro Junior,
  • Marcio Costa Santos,
  • Guilherme Nepomuceno de Carvalho,
  • Luiz Jonatã Pires de Araújo and
  • Placido Rogerio Pinheiro

23 October 2021

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

(This article belongs to the Special Issue Metaheuristic Algorithms in Optimization and Applications 2021)
  • Article
  • Open Access
2 Citations
1,851 Views
8 Pages

1 April 2011

Cutting problem is one of the major problems faced in marble factories. Huge marble blocks coming from marble quarries are first cut into planes according to their depths. Then these planes are sized according to the length and width of the demanded...

  • Article
  • Open Access
5 Citations
2,571 Views
24 Pages

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

  • Irving Barragan-Vite,
  • Joselito Medina-Marin,
  • Norberto Hernandez-Romero and
  • Gustavo Erick Anaya-Fuentes

11 September 2024

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

(This article belongs to the Section Computing and Artificial Intelligence)
  • Article
  • Open Access
4 Citations
2,710 Views
13 Pages

An Actor-Critic Algorithm for the Stochastic Cutting Stock Problem

  • Jie-Ying Su,
  • Jia-Lin Kang and
  • Shi-Shang Jang

13 April 2023

The inventory level has a significant influence on the cost of process scheduling. The stochastic cutting stock problem (SCSP) is a complicated inventory-level scheduling problem due to the existence of random variables. In this study, we applied a m...

(This article belongs to the Section Manufacturing Processes and Systems)
  • Article
  • Open Access
5 Citations
3,300 Views
12 Pages

A Tree-Based Heuristic for the One-Dimensional Cutting Stock Problem Optimization Using Leftovers

  • Glaucia Maria Bressan,
  • Matheus Henrique Pimenta-Zanon and
  • Fabio Sakuray

11 November 2023

Cutting problems consist of cutting a set of objects available in stock in order to produce the desired items in specified quantities and sizes. The cutting process can generate leftovers (which can be reused in the case of new demand) or losses (whi...

(This article belongs to the Special Issue Monitoring of Cutting Process and Tool Condition of Metal and Metal Composite)
  • Article
  • Open Access
5 Citations
3,647 Views
9 Pages

9 June 2021

We proposed the method that translates the two-dimensional CSP for minimizing the number of cuts to the Ising model. After that, we conducted computer experiments of the proposed model using the benchmark problem. From the above, the following result...

  • Article
  • Open Access
6 Citations
3,286 Views
14 Pages

25 October 2022

The Cutting Stock Problem (CSP) is an optimisation problem that roughly consists of cutting large objects in order to produce small items. The computational effort for solving this problem is largely affected by the number of cutting patterns. In thi...

(This article belongs to the Special Issue Metaheuristics)
  • Article
  • Open Access
16 Citations
5,537 Views
18 Pages

Solution to Solid Wood Board Cutting Stock Problem

  • Min Tang,
  • Ying Liu,
  • Fenglong Ding and
  • Zhengguang Wang

24 August 2021

In the production process for wooden furniture, the raw material costs account for more than 50% of furniture costs, and the utilization rate of raw materials depends mainly on the layout scheme. Therefore, a reasonable layout is an important measure...

(This article belongs to the Topic Machine and Deep Learning)
  • Article
  • Open Access
2,747 Views
17 Pages

Boosted Arc Flow Formulation Using Graph Compression for the Two-Dimensional Strip Cutting Problem

  • Tamer G. Ali,
  • Mehdi Mrad,
  • Ali Balma,
  • Anis Gharbi and ,
  • Ali Samhan and
  • Mohammed A. Louly
  • + 1 author+ 0 author

7 March 2023

Since the requirement for a material cutting process occurs in a wide variety of applied contemporary manufacturing, the cutting stock problem plays a critical role in optimizing the amount of raw material utilized in everyday production operations....

(This article belongs to the Special Issue Computer-Aided Manufacturing Technologies in Mechanical Field)
  • Article
  • Open Access
404 Views
23 Pages

9 September 2026

Although population-based metaheuristic algorithms have been widely applied to the One-Dimensional Cutting Stock Problem (1D-CSP), their performance is often limited by premature convergence and insufficient local search capability. This study presen...

(This article belongs to the Special Issue Optimization Problems: Methods and Applications)
  • Article
  • Open Access
959 Views
18 Pages

28 November 2025

In the manufacturing of iron core for high-power transformers, a cutting stock problem arises where large-width silicon steel coils must be cut into narrower coils, known as strips. Typically, the required length of each strip far exceeds that of a s...

(This article belongs to the Section Advanced Manufacturing)
  • Article
  • Open Access
1 Citations
1,488 Views
23 Pages

24 September 2025

This paper studies a multi-period strip cutting problem motivated by the paper industry. The focus is on multi-cutter slitting machines, which allow the simultaneous production of items with different lengths and provide higher cutting flexibility co...

(This article belongs to the Special Issue Advances in AI and Optimization for Scheduling Problems in Industry)
  • Article
  • Open Access
1,669 Views
18 Pages

28 August 2025

The nurse rostering problem (NRP) has attracted significant research interest in recent decades due to both its practical relevance and computational complexity. While the branch-and-price algorithm has demonstrated effectiveness in solving NRPs, its...

(This article belongs to the Section Systems Practice in Social Science)
  • Article
  • Open Access
4 Citations
1,686 Views
13 Pages

2 November 2023

A relevant problem in the development and improvement of numeric analytical methods for the research of structures, buildings and construction is studying the stress–strain state of structures and construction with boundaries that have complex...

(This article belongs to the Section Mathematical Analysis)
  • Article
  • Open Access
25 Citations
9,652 Views
16 Pages

17 February 2023

It is well known that the one-dimensional cutting stock problem (1DCSP) is a combinatorial optimization problem with nondeterministic polynomial (NP-hard) characteristics. Heuristic and genetic algorithms are the two main algorithms used to solve the...

(This article belongs to the Section E1: Mathematics and Computer Science)
  • Article
  • Open Access
2,162 Views
20 Pages

A novel algorithm was proposed for solving the max-cut problem, which seeks to identify the cut with the maximum weight in a given graph. Our technique is based on the bundle approach, applied to a newly formulated semidefinite relaxation. This resea...

  • Article
  • Open Access
9 Citations
3,517 Views
22 Pages

4 February 2023

The article provides an α-cut-based method that solves linear fractional programming problems with fuzzy variables and unrestricted parameters. The parameters and variables are considered as asymmetric triangular fuzzy numbers, which is a gener...

(This article belongs to the Special Issue Fuzzy Set Theory and Uncertainty Theory)
  • Article
  • Open Access
10 Citations
3,322 Views
42 Pages

Evolutionary Algorithms for Optimization Sequence of Cut in the Laser Cutting Path Problem

  • Bonfim Amaro Junior,
  • Guilherme Nepomuceno de Carvalho,
  • Marcio Costa Santos,
  • Placido Rogerio Pinheio and
  • Joao Willian Lemos Celedonio

8 September 2023

Efficiently cutting smaller two-dimensional parts from a larger surface area is a recurring challenge in many manufacturing environments. This point falls under the cut-and-pack (C&P) problems. This study specifically focused on a specialization...

(This article belongs to the Special Issue Novel Research and Application on Swarm Optimization and Bioinspired Optimization Algorithms)
  • Article
  • Open Access
27 Citations
10,113 Views
20 Pages

22 February 2020

The Max-cut problem is a well-known combinatorial optimization problem, which has many real-world applications. However, the problem has been proven to be non-deterministic polynomial-hard (NP-hard), which means that exact solution algorithms are not...

(This article belongs to the Special Issue Advances and Novel Approaches in Discrete Optimization)
  • Article
  • Open Access
1 Citations
4,534 Views
22 Pages

Algorithmic Advances for 1.5-Dimensional Two-Stage Cutting Stock Problem

  • Antonio Grieco,
  • Pierpaolo Caricato and
  • Paolo Margiotta

27 December 2024

The Cutting Stock Problem (CSP) is an optimization challenge that involves dividing large objects into smaller components while considering various managerial objectives. The problem’s complexity can differ based on factors such as object dimen...

(This article belongs to the Special Issue Optimization Methods for Advanced Manufacturing)
  • Article
  • Open Access
11 Citations
5,177 Views
18 Pages

1 April 2021

The textiles and garment industry plays an important role in Thailand’s economic growth, despite facing competition in product quality and rising production costs. Meeting diverse consumer needs and satisfaction has become increasingly difficult, as...

(This article belongs to the Special Issue Advances in Industrial Waste Reduction)
  • Article
  • Open Access
8 Citations
2,923 Views
16 Pages

15 July 2021

Multiobjective optimization is a common problem in the field of industrial cutting. In actual production settings, it is necessary to rely on the experience of skilled workers to achieve multiobjective collaborative optimization. The process of indus...

(This article belongs to the Special Issue Smart Manufacturing Technology)
  • Article
  • Open Access
2 Citations
2,062 Views
16 Pages

26 July 2024

The thermal-controlled fracture method has been increasingly focused upon in the high-quality cutting of advanced ceramic materials due to its excellent characteristics. The successful application of this method in cutting ceramics mainly depends on...

(This article belongs to the Special Issue Ultra-Precision Machining of Difficult-to-Machine Materials)
  • Article
  • Open Access
8 Citations
5,379 Views
26 Pages

10 June 2020

The research on production, delivery and inventory strategies for perishable products in a two-echelon distribution network integrates the production routing problem (PRP) and two-echelon vehicle routing problem (2E-VRP), which mainly considers the i...

(This article belongs to the Section Sustainable Engineering and Science)
  • Article
  • Open Access
10 Citations
4,898 Views
30 Pages

31 October 2022

Hyper-heuristics are widely used for solving numerous complex computational search problems because of their intrinsic capability to generalize across problem domains. The fair-share iterated local search is one of the most successful hyper-heuristic...

(This article belongs to the Collection Feature Paper in Metaheuristic Algorithms and Applications)
  • Article
  • Open Access
2 Citations
3,234 Views
28 Pages

16 October 2022

The main purpose of the work was examining various methods of decomposition of a network optimization problem of simultaneous routing and bandwidth allocation based on Lagrangian relaxation. The problem studied is an NP-hard mixed-integer nonlinear o...

(This article belongs to the Special Issue Mixed-Integer Linear and Nonlinear Programming Methods for Energy Aware Traffic Control in Stationary Networks and Clouds)
  • Article
  • Open Access
8 Citations
5,160 Views
18 Pages

11 October 2021

The paper presents the Generalized Benders Decomposition (GBD) method, which is now one of the basic approaches to solve big mixed-integer nonlinear optimization problems. It concentrates on the basic formulation with convex objectives and constraint...

(This article belongs to the Special Issue Mixed-Integer Linear and Nonlinear Programming Methods for Energy Aware Traffic Control in Stationary Networks and Clouds)
  • Feature Paper
  • Article
  • Open Access
4 Citations
2,985 Views
18 Pages

A Large Scale Evolutionary Algorithm Based on Determinantal Point Processes for Large Scale Multi-Objective Optimization Problems

  • Michael Aggrey Okoth,
  • Ronghua Shang,
  • Licheng Jiao,
  • Jehangir Arshad and ,
  • Ateeq Ur Rehman and
  • Habib Hamam
  • + 1 author+ 0 author

14 October 2022

Global optimization challenges are frequent in scientific and engineering areas where loads of evolutionary computation methods i.e., differential evolution (DE) and particle-swarm optimization (PSO) are employed to handle these problems. However, th...

(This article belongs to the Section Computer Science & Engineering)
  • Article
  • Open Access
2 Citations
2,000 Views
21 Pages

25 April 2025

The max-cut problem is a well-known topic in combinatorial optimization, with a wide range of practical applications. Given its NP-hard nature, heuristic approaches—such as genetic algorithms, tabu search, and harmony search—have been ext...

(This article belongs to the Special Issue Combinatorial Optimization and Applications)
  • Article
  • Open Access
5 Citations
4,744 Views
19 Pages

Nesting Process Automation in the Footwear Industry: A Hybrid Approach to Minimize Material Waste

  • Eliseo Aguilar-Tortosa,
  • Eduard-Andrei Duta-Costache,
  • Elías Vera-Brazal,
  • José-Luis Sánchez-Romero and ,
  • José Francisco Gómez-Hernández,
  • Antonio Jimeno-Morenilla and
  • Antonio Maciá-Lillo
  • + 2 authors+ 0 author

31 December 2024

In any industry, maximizing the use of raw materials is essential to reduce waste and costs, which also positively impacts the environment. In footwear production, components are typically derived from cutting processes, requiring optimized systems t...

(This article belongs to the Special Issue Digital Technologies Enabling Modern Industries)
  • Article
  • Open Access
1 Citations
2,052 Views
12 Pages

The article deals with the problem of calculating the volume calendar plan of a paper mill. The presented mathematical model and methods make it possible to schedule paper production orders between several paper machines (PM) to even their loading, d...

(This article belongs to the Section Computer Science & Engineering)
  • Article
  • Open Access
2 Citations
1,749 Views
20 Pages

Spectral Graph Compression in Deploying Recommender Algorithms on Quantum Simulators

  • Chenxi Liu,
  • W. Bernard Lee and
  • Anthony G. Constantinides

This follow-up scientific case study builds on prior research to explore the computational challenges of applying quantum algorithms to financial asset management, focusing specifically on solving the graph-cut problem for investment recommendation....

(This article belongs to the Section AI-Driven Innovations)
  • Article
  • Open Access
3 Citations
2,954 Views
10 Pages

3 September 2020

The inverse minimum cut problem is one of the classical inverse optimization researches. In this paper, the inverse minimum cut with a lower and upper bounds problem is considered. The problem is to change both, the lower and upper bounds on arcs so...

(This article belongs to the Special Issue Inverse and Ill-Posed Problems)
  • Article
  • Open Access
4 Citations
6,670 Views
11 Pages

The aim of this study was to identify the problems faced by retailers operating in the cut flower sector and to propose solutions to problems related to the sustainability of the sector. The study material consisted of data obtained by conducting a s...

(This article belongs to the Section Horticultural Economics, Policy, Business Management and Marketing)
  • Article
  • Open Access
1,181 Views
19 Pages

20 October 2025

In graph theory and network design, the minimum cut is a fundamental measure of system connectivity and communication capacity. While prior research has largely focused on computing the minimum cut for a fixed source–sink pair, practical scenar...

  • Article
  • Open Access
2 Citations
2,701 Views
14 Pages

24 February 2021

The loop cutset solving algorithm in the Bayesian network is particularly important for Bayesian inference. This paper proposes an algorithm for solving the approximate minimum loop cutset based on the loop-cutting contribution index. Compared with t...

(This article belongs to the Special Issue Neural Networks and Learning Systems)
  • Article
  • Open Access
5 Citations
5,620 Views
12 Pages

Clustering Improves the Goemans–Williamson Approximation for the Max-Cut Problem

  • Angel E. Rodriguez-Fernandez,
  • Bernardo Gonzalez-Torres,
  • Ricardo Menchaca-Mendez and
  • Peter F. Stadler

MAX-CUT is one of the well-studied NP-hard combinatorial optimization problems. It can be formulated as an Integer Quadratic Programming problem and admits a simple relaxation obtained by replacing the integer “spin” variables xi by unita...

  • Article
  • Open Access
5 Citations
10,095 Views
21 Pages

14 September 2021

This article proposes to examine in detail Aurobindo’s searching—and often quite original—criticisms of Advaita Vedānta, which have not yet received the sustained scholarly attention they deserve. After discussing his early spiritual experiences and...

(This article belongs to the Section Religions and Humanities/Philosophies)
  • Article
  • Open Access
1,167 Views
18 Pages

This paper proposes adaptive sequence-based heuristics for solving rectangular two-dimensional guillotine Cutting and Packing Problems (CPPs). These problems are essential in various industrial sectors, aiming to maximise resource utilisation by sele...

(This article belongs to the Special Issue Operations Research: Trends and Applications)
  • Communication
  • Open Access
17 Citations
5,301 Views
10 Pages

Improvement of Quantum Approximate Optimization Algorithm for Max–Cut Problems

  • Javier Villalba-Diez,
  • Ana González-Marcos and
  • Joaquín B. Ordieres-Meré

30 December 2021

The objective of this short letter is to study the optimal partitioning of value stream networks into two classes so that the number of connections between them is maximized. Such kind of problems are frequently found in the design of different syste...

(This article belongs to the Special Issue JIDOKA. Integration of Human and AI within Industry 4.0 Cyber Physical Manufacturing Systems)
  • Article
  • Open Access
1 Citations
1,368 Views
9 Pages

22 August 2024

In this work, we aim to explore the superconvergence of a modified nonconforming cut finite element method with rectangular meshes for elliptic problems. Boundary conditions are imposed via the Nitsche’s method. The superclose property is prove...

  • Article
  • Open Access
14 Citations
5,300 Views
20 Pages

Implementation of User Cuts and Linear Sensitivity Factors to Improve the Computational Performance of the Security-Constrained Unit Commitment Problem

  • Cristian Camilo Marín-Cano,
  • Juan Esteban Sierra-Aguilar,
  • Jesús M. López-Lezama,
  • Álvaro Jaramillo-Duque and
  • Walter M. Villa-Acevedo

11 April 2019

Power system operators must schedule the available generation resources required to achieve an economical, reliable, and secure energy production in power systems. This is usually achieved by solving a security-constrained unit commitment (SCUC) prob...

(This article belongs to the Special Issue Optimization Methods Applied to Power Systems Ⅱ)
  • Article
  • Open Access
1 Citations
2,959 Views
16 Pages

17 August 2021

A metamodeling technique based on Bivariate Cut High Dimensional Model Representation (Bivariate Cut HDMR) is implemented for a semiconductor packaging design problem with 10 design variables. Bivariate Cut-HDMR constructs a metamodel by considering...

(This article belongs to the Special Issue Simulation and Reliability Assessment of Advanced Packaging)
  • Article
  • Open Access
973 Views
21 Pages

9 April 2026

This paper formulates the “Minimum Vertex Cut with Reachable Set” (MVCRS) problem as an optimization framework to suppress botnet propagation in networked systems, and clarifies its computational complexity and algorithmic solutions. Buil...

(This article belongs to the Special Issue The Forefront of Internet of Things Cybersecurity with Artificial Intelligence)
  • Feature Paper
  • Article
  • Open Access
55 Citations
8,346 Views
22 Pages

17 January 2018

The Small Set Expansion Hypothesis is a conjecture which roughly states that it is NP-hard to distinguish between a graph with a small subset of vertices whose (edge) expansion is almost zero and one in which all small subsets of vertices have expans...

  • Article
  • Open Access
14 Citations
5,553 Views
25 Pages

Selection and Optimization of Hyperparameters in Warm-Started Quantum Optimization for the MaxCut Problem

  • Felix Truger,
  • Martin Beisel,
  • Johanna Barzen,
  • Frank Leymann and
  • Vladimir Yussupov

Today’s quantum computers are limited in their capabilities, e.g., the size of executable quantum circuits. The Quantum Approximate Optimization Algorithm (QAOA) addresses these limitations and is, therefore, a promising candidate for achieving...

(This article belongs to the Special Issue Quantum Computing System Design and Architecture)
  • Article
  • Open Access
4 Citations
3,213 Views
24 Pages

31 August 2022

Heterogeneous Fleet and Multi-Depot Static Bike Rebalancing Problem with Split Load (HFMDSBRP-SD) is an extension of the Static Bike Rebalancing Problem, considering heterogeneous fleet multiple depots, allowing split load. It consists of finding a s...

  • Article
  • Open Access
4 Citations
1,904 Views
34 Pages

20 December 2024

As an effective solution to the first- and last-mile logistics of door-to-door intermodal container transportation, inland container transportation involves transporting containers by truck between terminals, depots, and customers within a local area...

(This article belongs to the Section Transportation and Future Mobility)
  • Article
  • Open Access
9 Citations
3,956 Views
20 Pages

Polymer Waste Recycling of Injection Molding Purges with Softening for Cutting with Fresnel Solar Collector—A Real Problem Linked to Sustainability and the Circular Economy

  • Ma. Guadalupe Plaza,
  • Maria Luisa Mendoza López,
  • José de Jesús Pérez Bueno,
  • Joaquín Pérez Meneses and
  • Alejandra Xochitl Maldonado Pérez

8 April 2024

A plastic injection waste known as “purge” cannot be reintegrated into the recycling chain due to its shape, size, and composition. Grinding these cannot be carried out with traditional mills due to significant variations in size and shap...

(This article belongs to the Special Issue Polymer Waste Recycling and Management II)
  • Article
  • Open Access
26 Citations
7,977 Views
15 Pages

23 July 2020

Reinforcing bars (rebar), which have the most embodied carbon dioxide (CO2) per unit weight in built environments, generate a significant amount of cutting waste during the construction phase. Excessive cutting waste not only increases the constructi...

(This article belongs to the Special Issue Technology and Management for Sustainable Buildings and Infrastructures)

of 42