OPTIMIZATION THE PROBLEM OF PACKING RECTANGULAR SHAPES BY USING IMPERIALIST COMPETITIVE ALGORITHM

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

KARGAR MOTAHREH; PAYVANDY PEDRAM

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: PRODUCTION AND OPERATIONS MANAGEMENT Year:2018 | Volume:9 | Issue:1 (16) Page(s): 161-180

Download Full-Text

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Verion

View:

1,144

Download:

333

Cites:

Information Journal Paper

Title

OPTIMIZATION THE PROBLEM OF PACKING RECTANGULAR SHAPES BY USING IMPERIALIST COMPETITIVE ALGORITHM

Author(s)

KARGAR MOTAHREH | PAYVANDY PEDRAM | Issue Writer Certificate

Keywords

IMPERIALIST COMPETITIVE ALGORITHMQ1

GENETIC ALGORITHMQ2

PACKING ALGORITHMSQ1

OPTIMIZATIONQ2

PACKING PROBLEMSQ1

Abstract

Packing is one of the well-known problems in operation research, especially in production planning. The main objective of studying the packing problem is to reduce the wastes of cutting through OPTIMIZATION of packing of pieces. Packing is a kind of NP-hard problem that the precise methods are not able to solve it. In this paper, in order to achieve an optimal packing of Non-guillotine cutting problems, the meta-heuristic emerging IMPERIALIST COMPETITIVE ALGORITHM was used and the results were compared with the output of the GENETIC ALGORITHM, which is the typical algorithm in solving PACKING PROBLEMS. To achieve better solutions, the parameters of all meta-heuristics were calibrated with Taguchi experiment method. The efficacy of the proposed approach was tested on a set of instances, taken from the literature, and the results of the proposed algorithm were tested statistically by ANOVA. The results of this study showed that the meta-heuristic emerging IMPERIALIST COMPETITIVE ALGORITHM is more efficient and faster in solving PACKING PROBLEMS.

Cites

No record.

References

No record.

Cite

APA: Copy

KARGAR, MOTAHREH, & PAYVANDY, PEDRAM. (2018). OPTIMIZATION THE PROBLEM OF PACKING RECTANGULAR SHAPES BY USING IMPERIALIST COMPETITIVE ALGORITHM. PRODUCTION AND OPERATIONS MANAGEMENT, 9(1 (16) ), 161-180. SID. https://sid.ir/paper/217527/en

Vancouver: Copy

KARGAR MOTAHREH, PAYVANDY PEDRAM. OPTIMIZATION THE PROBLEM OF PACKING RECTANGULAR SHAPES BY USING IMPERIALIST COMPETITIVE ALGORITHM. PRODUCTION AND OPERATIONS MANAGEMENT[Internet]. 2018;9(1 (16) ):161-180. Available from: https://sid.ir/paper/217527/en

IEEE: Copy

MOTAHREH KARGAR, and PEDRAM PAYVANDY, “OPTIMIZATION THE PROBLEM OF PACKING RECTANGULAR SHAPES BY USING IMPERIALIST COMPETITIVE ALGORITHM,” PRODUCTION AND OPERATIONS MANAGEMENT, vol. 9, no. 1 (16) , pp. 161–180, 2018, [Online]. Available: https://sid.ir/paper/217527/en

Related Journal Papers