The DH/KD algorithm: a hybrid approach for unconstrained two-dimensional cutting problems
Article Abstract:
Depth-first search, Hill-climbing and dynamic programming methods were integrated into a hybrid algorithm for solving unconstrained two-dimensional guillotine cutting (UTDGC) problems. The new approach reduced the complexity of large problems for both the weighted and unweighted cases by restricting the depth of the developed tree and deriving lower and upper bounds for each subproblem. This was demonstrated in comparisons with algorithms developed by R. Morabito and colleagues and J.E. Beasley.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1997
User Contributions:
Comment about this article or add new information about this topic:
An LP-based approach to a two-stage cutting stock problem
Article Abstract:
The two-stage cutting stock problem is formulated as a linear programming model to render a solution for a customized steel manufacturer. The model, which was incorporated into an interactive program, enables the generation of cutting pattern and cutting plans as well as procedures to allocate the cutting patterns to the inventory coils. Solved using the column generation method, it explicitly considers only the global trim loss and the number of intermediate rolls in the cost function.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1995
User Contributions:
Comment about this article or add new information about this topic:
Stability analysis for a special interval cutting problem
Article Abstract:
A dynamic programming approach to the interval cutting problem encountered in the textile industry is presented. Specifically, it is shown that a small change to a dynamic programming method for solving the unperturbed instance of the two-parametric discrete optimization problem yields more information about the regions of stability of an optimal solution. In addition, a dynamic programming algorithm for determining the problem's optimal value function is proposed.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1995
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls. A unified heuristic for a large class of Vehicle Routing Problems with Backhauls
- Abstracts: Backtracking of jobs in one-dimensional machine location problems. Optimal models for a multi-stage supply chain system controlled by kanban under just-in-time philosophy
- Abstracts: Issues in the implementation of the DSD algorithm for the traffic assignment problem. A continuous whole-link travel time model with occupancy constraint
- Abstracts: The 'final order' problem. An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem
- Abstracts: Parallel processing for difficult combinatorial optimization problems. A parallel depth first search branch and bound algorithm for the quadratic assignment problem