A hybrid genetic algorithm for the k-bounded semi-online bin covering problem in batching machines

B.H.H. Hundscheid; Kay Peeters; Jelle Adan; Tugce G. Martagan; Ivo J.B.F. Adan

doi:10.1109/WSC40007.2019.9004825

A hybrid genetic algorithm for the k-bounded semi-online bin covering problem in batching machines

B.H.H. Hundscheid, Kay Peeters, Jelle Adan, Tugce G. Martagan, Ivo J.B.F. Adan

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

1 Citation (Scopus)

3 Downloads (Pure)

Abstract

The semi-online bin covering problem is a NP-hard problem that occurs in a batching processes in a high-end poultry processing line. The objective is to form batches of items with minimal giveaway, which is the difference between the target and realized batch weight. The items in this process are allocated in the order of arrival, and the weight of the first set of items is assumed to be known. We develop a novel hybrid genetic algorithm, combining a genetic algorithm and several local search methods. Simulation experiments based on real-world data are performed to gain managerial insights. These simulations suggest that the proposed algorithm produces high quality solutions within a reasonable time limit.

Original language	English
Title of host publication	WSC 2019- 2019 Winter Simulation Conference
Editors	N. Mustafee, K.-H.G. Bae, S. Lazarova-Molnar, M. Rabe, C. Szabo, P. Haas, Y.-J. Son
Place of Publication	Piscataway
Publisher	Institute of Electrical and Electronics Engineers
Pages	2142-2153
Number of pages	12
ISBN (Electronic)	978-1-7281-3283-9
DOIs	https://doi.org/10.1109/WSC40007.2019.9004825
Publication status	Published - Dec 2019
Event	2019 Winter Simulation Conference, WSC 2019 - National Harbor, MD, USA, National Harbor, United States Duration: 8 Dec 2019 → 11 Dec 2019 http://meetings2.informs.org/wordpress/wsc2019/

Conference

Conference	2019 Winter Simulation Conference, WSC 2019
Abbreviated title	WSC2019
Country/Territory	United States
City	National Harbor
Period	8/12/19 → 11/12/19
Internet address	http://meetings2.informs.org/wordpress/wsc2019/

Access to Document

10.1109/WSC40007.2019.9004825

Cite this

Hundscheid, B. H. H., Peeters, K., Adan, J., Martagan, T. G., & Adan, I. J. B. F. (2019). A hybrid genetic algorithm for the k-bounded semi-online bin covering problem in batching machines. In N. Mustafee, K-HG. Bae, S. Lazarova-Molnar, M. Rabe, C. Szabo, P. Haas, & Y-J. Son (Eds.), WSC 2019- 2019 Winter Simulation Conference (pp. 2142-2153). [9004825] Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/WSC40007.2019.9004825

Hundscheid, B.H.H. ; Peeters, Kay ; Adan, Jelle ; Martagan, Tugce G. ; Adan, Ivo J.B.F. / A hybrid genetic algorithm for the k-bounded semi-online bin covering problem in batching machines. WSC 2019- 2019 Winter Simulation Conference. editor / N. Mustafee ; K.-H.G. Bae ; S. Lazarova-Molnar ; M. Rabe ; C. Szabo ; P. Haas ; Y.-J. Son. Piscataway : Institute of Electrical and Electronics Engineers, 2019. pp. 2142-2153

@inproceedings{f9bb944a2ea54022b2744de8d617ad8a,

title = "A hybrid genetic algorithm for the k-bounded semi-online bin covering problem in batching machines",

abstract = "The semi-online bin covering problem is a NP-hard problem that occurs in a batching processes in a high-end poultry processing line. The objective is to form batches of items with minimal giveaway, which is the difference between the target and realized batch weight. The items in this process are allocated in the order of arrival, and the weight of the first set of items is assumed to be known. We develop a novel hybrid genetic algorithm, combining a genetic algorithm and several local search methods. Simulation experiments based on real-world data are performed to gain managerial insights. These simulations suggest that the proposed algorithm produces high quality solutions within a reasonable time limit.",

author = "B.H.H. Hundscheid and Kay Peeters and Jelle Adan and Martagan, {Tugce G.} and Adan, {Ivo J.B.F.}",

year = "2019",

month = dec,

doi = "10.1109/WSC40007.2019.9004825",

language = "English",

pages = "2142--2153",

editor = "Mustafee, {N. } and K.-H.G. Bae and S. Lazarova-Molnar and Rabe, {M. } and Szabo, {C. } and P. Haas and Y.-J. Son",

booktitle = "WSC 2019- 2019 Winter Simulation Conference",

publisher = "Institute of Electrical and Electronics Engineers",

address = "United States",

note = "2019 Winter Simulation Conference, WSC 2019, WSC2019 ; Conference date: 08-12-2019 Through 11-12-2019",

url = "http://meetings2.informs.org/wordpress/wsc2019/",

}

Hundscheid, BHH, Peeters, K, Adan, J , Martagan, TG & Adan, IJBF 2019, A hybrid genetic algorithm for the k-bounded semi-online bin covering problem in batching machines. in N Mustafee, K-HG Bae, S Lazarova-Molnar, M Rabe, C Szabo, P Haas & Y-J Son (eds), WSC 2019- 2019 Winter Simulation Conference., 9004825, Institute of Electrical and Electronics Engineers, Piscataway, pp. 2142-2153, 2019 Winter Simulation Conference, WSC 2019, National Harbor, Maryland, United States, 8/12/19. https://doi.org/10.1109/WSC40007.2019.9004825

A hybrid genetic algorithm for the k-bounded semi-online bin covering problem in batching machines. / Hundscheid, B.H.H.; Peeters, Kay; Adan, Jelle ; Martagan, Tugce G.; Adan, Ivo J.B.F.

WSC 2019- 2019 Winter Simulation Conference. ed. / N. Mustafee; K.-H.G. Bae; S. Lazarova-Molnar; M. Rabe; C. Szabo; P. Haas; Y.-J. Son. Piscataway : Institute of Electrical and Electronics Engineers, 2019. p. 2142-2153 9004825.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - A hybrid genetic algorithm for the k-bounded semi-online bin covering problem in batching machines

AU - Hundscheid, B.H.H.

AU - Peeters, Kay

AU - Adan, Jelle

AU - Martagan, Tugce G.

AU - Adan, Ivo J.B.F.

PY - 2019/12

Y1 - 2019/12

N2 - The semi-online bin covering problem is a NP-hard problem that occurs in a batching processes in a high-end poultry processing line. The objective is to form batches of items with minimal giveaway, which is the difference between the target and realized batch weight. The items in this process are allocated in the order of arrival, and the weight of the first set of items is assumed to be known. We develop a novel hybrid genetic algorithm, combining a genetic algorithm and several local search methods. Simulation experiments based on real-world data are performed to gain managerial insights. These simulations suggest that the proposed algorithm produces high quality solutions within a reasonable time limit.

AB - The semi-online bin covering problem is a NP-hard problem that occurs in a batching processes in a high-end poultry processing line. The objective is to form batches of items with minimal giveaway, which is the difference between the target and realized batch weight. The items in this process are allocated in the order of arrival, and the weight of the first set of items is assumed to be known. We develop a novel hybrid genetic algorithm, combining a genetic algorithm and several local search methods. Simulation experiments based on real-world data are performed to gain managerial insights. These simulations suggest that the proposed algorithm produces high quality solutions within a reasonable time limit.

UR - http://www.scopus.com/inward/record.url?scp=85081125697&partnerID=8YFLogxK

U2 - 10.1109/WSC40007.2019.9004825

DO - 10.1109/WSC40007.2019.9004825

M3 - Conference contribution

SP - 2142

EP - 2153

BT - WSC 2019- 2019 Winter Simulation Conference

A2 - Mustafee, N.

A2 - Bae, K.-H.G.

A2 - Lazarova-Molnar, S.

A2 - Rabe, M.

A2 - Szabo, C.

A2 - Haas, P.

A2 - Son, Y.-J.

PB - Institute of Electrical and Electronics Engineers

CY - Piscataway

T2 - 2019 Winter Simulation Conference, WSC 2019

Y2 - 8 December 2019 through 11 December 2019

ER -

Hundscheid BHH, Peeters K, Adan J , Martagan TG , Adan IJBF. A hybrid genetic algorithm for the k-bounded semi-online bin covering problem in batching machines. In Mustafee N, Bae K-HG, Lazarova-Molnar S, Rabe M, Szabo C, Haas P, Son Y-J, editors, WSC 2019- 2019 Winter Simulation Conference. Piscataway: Institute of Electrical and Electronics Engineers. 2019. p. 2142-2153. 9004825 https://doi.org/10.1109/WSC40007.2019.9004825

A hybrid genetic algorithm for the k-bounded semi-online bin covering problem in batching machines

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this