Solution for the constrained guillotine cutting problem by simulated annealing. Computers and Operations Research, 25(1):37-47, 1998. abstract bibtex Since the Simulated Annealing method was identified as a useful tool for solving optimization problems, several applications have been made in order to study its performance in various problems. This method is especially adequate for problems in which, it is not possible to represent the whole domain of solutions through a set of algebraic equations. In this study the constrained two-dimensional cutting problem is formulated and solved. The formulation of this problem is based on the mapping of a cutting pattern on a binary tree, facilitating the random generation of neighbor solutions. A rigorous numerical analysis establishing the best set of parameters to solve any instance of the problem is accomplished. Further, we present a set of comparative results with other methods that also permit a solution to the problem. © 1997 Elsevier Science Ltd.
@article{0031619229,
abstract = "Since the Simulated Annealing method was identified as a useful tool for solving optimization problems, several applications have been made in order to study its performance in various problems. This method is especially adequate for problems in which, it is not possible to represent the whole domain of solutions through a set of algebraic equations. In this study the constrained two-dimensional cutting problem is formulated and solved. The formulation of this problem is based on the mapping of a cutting pattern on a binary tree, facilitating the random generation of neighbor solutions. A rigorous numerical analysis establishing the best set of parameters to solve any instance of the problem is accomplished. Further, we present a set of comparative results with other methods that also permit a solution to the problem. © 1997 Elsevier Science Ltd.",
number = "1",
year = "1998",
title = "Solution for the constrained guillotine cutting problem by simulated annealing",
volume = "25",
pages = "37-47",
journal = "Computers and Operations Research"
}
Downloads: 0
{"_id":"SSjxpmhQv2YstffNi","bibbaseid":"anonymous-solutionfortheconstrainedguillotinecuttingproblembysimulatedannealing-1998","downloads":0,"creationDate":"2017-03-31T20:15:33.064Z","title":"Solution for the constrained guillotine cutting problem by simulated annealing","author_short":null,"year":1998,"bibtype":"article","biburl":"https://1fichier.com/?j9cpurkmnv","bibdata":{"bibtype":"article","type":"article","abstract":"Since the Simulated Annealing method was identified as a useful tool for solving optimization problems, several applications have been made in order to study its performance in various problems. This method is especially adequate for problems in which, it is not possible to represent the whole domain of solutions through a set of algebraic equations. In this study the constrained two-dimensional cutting problem is formulated and solved. The formulation of this problem is based on the mapping of a cutting pattern on a binary tree, facilitating the random generation of neighbor solutions. A rigorous numerical analysis establishing the best set of parameters to solve any instance of the problem is accomplished. Further, we present a set of comparative results with other methods that also permit a solution to the problem. © 1997 Elsevier Science Ltd.","number":"1","year":"1998","title":"Solution for the constrained guillotine cutting problem by simulated annealing","volume":"25","pages":"37-47","journal":"Computers and Operations Research","bibtex":"@article{0031619229,\n abstract = \"Since the Simulated Annealing method was identified as a useful tool for solving optimization problems, several applications have been made in order to study its performance in various problems. This method is especially adequate for problems in which, it is not possible to represent the whole domain of solutions through a set of algebraic equations. In this study the constrained two-dimensional cutting problem is formulated and solved. The formulation of this problem is based on the mapping of a cutting pattern on a binary tree, facilitating the random generation of neighbor solutions. A rigorous numerical analysis establishing the best set of parameters to solve any instance of the problem is accomplished. Further, we present a set of comparative results with other methods that also permit a solution to the problem. © 1997 Elsevier Science Ltd.\",\n number = \"1\",\n year = \"1998\",\n title = \"Solution for the constrained guillotine cutting problem by simulated annealing\",\n volume = \"25\",\n pages = \"37-47\",\n journal = \"Computers and Operations Research\"\n}\n\n","key":"0031619229","id":"0031619229","bibbaseid":"anonymous-solutionfortheconstrainedguillotinecuttingproblembysimulatedannealing-1998","urls":{},"downloads":0,"html":""},"search_terms":["solution","constrained","guillotine","cutting","problem","simulated","annealing"],"keywords":[],"authorIDs":[],"dataSources":["gKiCRHjjC2iGthGEx"]}