Welcome to the InfoSci Platform
Reference Hub7
A Least-Loss Algorithm for a Bi-Objective One-Dimensional Cutting-Stock Problem

A Least-Loss Algorithm for a Bi-Objective One-Dimensional Cutting-Stock Problem

Hesham K. Alfares, Omar G. Alsawafy
Copyright: © 2019 |Volume: 6 |Issue: 2 |Pages: 19
ISSN: 2155-4153|EISSN: 2155-4161|EISBN13: 9781522567639|DOI: 10.4018/IJAIE.2019070101
Cite Article Cite Article

MLA

Alfares, Hesham K., and Omar G. Alsawafy. "A Least-Loss Algorithm for a Bi-Objective One-Dimensional Cutting-Stock Problem." IJAIE vol.6, no.2 2019: pp.1-19. http://doi.org/10.4018/IJAIE.2019070101

APA

Alfares, H. K. & Alsawafy, O. G. (2019). A Least-Loss Algorithm for a Bi-Objective One-Dimensional Cutting-Stock Problem. International Journal of Applied Industrial Engineering (IJAIE), 6(2), 1-19. http://doi.org/10.4018/IJAIE.2019070101

Chicago

Alfares, Hesham K., and Omar G. Alsawafy. "A Least-Loss Algorithm for a Bi-Objective One-Dimensional Cutting-Stock Problem," International Journal of Applied Industrial Engineering (IJAIE) 6, no.2: 1-19. http://doi.org/10.4018/IJAIE.2019070101

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

This article presents a new model and an efficient solution algorithm for a bi-objective one-dimensional cutting-stock problem. In the cutting-stock—or trim-loss—problem, customer orders of different smaller item sizes are satisfied by cutting a number of larger standard-size objects. After cutting larger objects to satisfy orders for smaller items, the remaining parts are considered as useless or wasted material, which is called “trim-loss.” The two objectives of the proposed model, in the order of priority, are to minimize the total trim loss, and the number of partially cut large objects. To produce near-optimum solutions, a two-stage least-loss algorithm (LLA) is used to determine the combinations of small item sizes that minimize the trim loss quantity. Solving a real-life industrial problem as well as several benchmark problems from the literature, the algorithm demonstrated considerable effectiveness in terms of both objectives, in addition to high computational efficiency.