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 proceedingConference contributionAcademicpeer-review

2 Citations (Scopus)
4 Downloads (Pure)


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 languageEnglish
Title of host publicationWSC 2019- 2019 Winter Simulation Conference
EditorsN. Mustafee, K.-H.G. Bae, S. Lazarova-Molnar, M. Rabe, C. Szabo, P. Haas, Y.-J. Son
Place of PublicationPiscataway
PublisherInstitute of Electrical and Electronics Engineers
Number of pages12
ISBN (Electronic)978-1-7281-3283-9
Publication statusPublished - Dec 2019
Event2019 Winter Simulation Conference, WSC 2019 - National Harbor, MD, USA, National Harbor, United States
Duration: 8 Dec 201911 Dec 2019


Conference2019 Winter Simulation Conference, WSC 2019
Abbreviated titleWSC2019
Country/TerritoryUnited States
CityNational Harbor
Internet address


Dive into the research topics of 'A hybrid genetic algorithm for the k-bounded semi-online bin covering problem in batching machines'. Together they form a unique fingerprint.

Cite this