The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
A Least-Loss Algorithm for a Bi-Objective One-Dimensional Cutting-Stock Problem
|
|
Author(s): Hesham K. Alfares (King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia)and Omar G. Alsawafy (King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia)
Copyright: 2019
Volume: 6
Issue: 2
Pages: 19
Source title:
International Journal of Applied Industrial Engineering (IJAIE)
Editor(s)-in-Chief: Sadaya Kubo (Setsunan University, Japan)
DOI: 10.4018/IJAIE.2019070101
Purchase
|
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.
Related Content
|
Vejn Sredic.
© 2023.
17 pages.
|
|
Murtadha Albuali.
© 2021.
6 pages.
|
|
Jae-Dong Hong.
© 2021.
20 pages.
|
|
Brian J. Galli.
© 2021.
16 pages.
|
|
Ali Keshavarz Panahi, Sohyung Cho, Chris Gordon.
© 2021.
16 pages.
|
|
Norman Gwangwava.
© 2021.
14 pages.
|
|
Brian J. Galli.
© 2020.
27 pages.
|
|
|