2014
DOI: 10.1007/s12205-014-0238-3
|View full text |Cite
|
Sign up to set email alerts
|

Three-step solutions for cutting stock problem of construction steel bars

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
16
0
1

Year Published

2016
2016
2023
2023

Publication Types

Select...
6
3
1

Relationship

0
10

Authors

Journals

citations
Cited by 23 publications
(17 citation statements)
references
References 15 publications
0
16
0
1
Order By: Relevance
“…Well-known examples are the bin-packing problem for the optimal packing of products into a minimum number of containers 23,24 and the one-dimensional cutting-stock problem 24,25 where the objective is the minimization of trim losses. 26 These combinatorial problems also arise when reticular structures are designed to fit given stock element characteristics, for example, cross-sections and lengths. Fujitani and Fujii 27 employed evolutionary algorithms to minimize the weight of plane frames subject to a stock of one-time available cross-sections but without considering limited element lengths.…”
Section: Research Contextmentioning
confidence: 99%
“…Well-known examples are the bin-packing problem for the optimal packing of products into a minimum number of containers 23,24 and the one-dimensional cutting-stock problem 24,25 where the objective is the minimization of trim losses. 26 These combinatorial problems also arise when reticular structures are designed to fit given stock element characteristics, for example, cross-sections and lengths. Fujitani and Fujii 27 employed evolutionary algorithms to minimize the weight of plane frames subject to a stock of one-time available cross-sections but without considering limited element lengths.…”
Section: Research Contextmentioning
confidence: 99%
“…Benjaoran et al (2005) proposed a multi-objective flow shop scheduling model for bespoke precast concrete production planning and used a genetic algorithm for its solution. Benjaoran and Bhokha (2014) developed new solution procedures for finding efficient cutting plans while minimizing trim loss and the number of stocks used for the cutting stock problem of construction steel bars. Pitombeira-Neto and Prata (2019) introduced a mixed integer linear programming model to the one-dimensional cutting stock and scheduling problem, and applied successfully a matheuristic based on a fix-and-optimize strategy hybridized with a random local search to solve it.…”
Section: Related Workmentioning
confidence: 99%
“…Hua [33] proposed a global heuristic two-tier algorithm to solve the cable optimized cutting problem, which saved more than 3% of cable raw materials compared with traditional methods. Benjaoran [34] proposed a hybrid algorithm based on the intensive search algorithm (ISA), genetic algorithm (GA), and the best fit decreasing (BFD) algorithm. Test results showed that the hybrid-generated solutions were superior to the solutions received from the BFD algorithm alone.…”
Section: Introductionmentioning
confidence: 99%