an aco algorithm for one-dimensional cutting stock problem
Authors
abstract
the one-dimensional cutting stock problem, has so many applications in lots of industrial processes and during the past few years has attracted so many researchers’ attention all over the world. in this paper a meta-heuristic method based on aco is presented to solve this problem. in this algorithm, based on designed probabilistic laws, artificial ants do select various cuts and then select the best patterns. also because of the problem framework, effective improvements has been made to problem solving process. the results of that algorithm in sample problems, show high efficiency of the algorithm in different levels of problems.
similar resources
An ACO algorithm for one-dimensional cutting stock problem
The one-dimensional cutting stock problem, has so many applications in lots of industrial processes and during the past few years has attracted so many researchers’ attention all over the world. In this paper a meta-heuristic method based on ACO is presented to solve this problem. In this algorithm, based on designed probabilistic laws, artificial ants do select various cuts and then select the...
full textAn Algorithm for Two Dimensional Cutting Stock Problems with Demand
In this paper, two-dimensional cutting stock problem with demand has been studied.In this problem, cutting of large rectangular sheets into specific small pieces should be carried out hence, the waste will be minimized. Solving this problem is important to decrease waste materials in any industry that requires cutting of sheets. In most previus studies, the demand of pieces has not been usually...
full textAn Algorithm for Two Dimensional Cutting Stock Problems with Demand
In this paper, two-dimensional cutting stock problem with demand has been studied.In this problem, cutting of large rectangular sheets into specific small pieces should be carried out hence, the waste will be minimized. Solving this problem is important to decrease waste materials in any industry that requires cutting of sheets. In most previus studies, the demand of pieces has not been usually...
full textSolving an one-dimensional cutting stock problem by simulated annealing and tabu search
A cutting stock problem is one of the main and classical problems in operations research that is modeled as Lp < /div> problem. Because of its NP-hard nature, finding an optimal solution in reasonable time is extremely difficult and at least non-economical. In this paper, two meta-heuristic algorithms, namely simulated annealing (SA) and tabu search (TS), are proposed and deve...
full textChoice of Method for General One-Dimensional Cutting Stock Problem
Problems in operations research are often NP complete and optimal solution for larger problems cannot be obtained, therefore heuristic methods have to be used. The boundary between the size of the problem that can be solved optimally and those where heuristic methods should be used is not always clear. To solve this problem we propose a method based on decision trees. The method can be also use...
full textA Local Search Approach for One Dimensional Cutting Stock Problem
One dimensional cutting stock problem (1D-CSP) is one of the representative combinatorial optimization problems, which has many applications in, e.g., steel, paper and fiber industries. To define an instance of 1D-CSP, we are given sufficient number of stock rolls which have the same length L, and m types of products with given lengths (l1, l2, . . . , lm) and demands (d1, d2, . . . , dm). A cu...
full textMy Resources
Save resource for easier access later
Journal title:
journal of industrial engineering, internationalISSN 1735-5702
volume 1
issue 1 2005
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023