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

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

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 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
Publication statusAccepted/In press - 2019

Fingerprint

Bins
Genetic algorithms
Poultry
Computational complexity
Processing
Experiments
Local search (optimization)

Cite this

Hundscheid, B. H. H., Peeters, K., Adan, J., Martagan, T. G., & Adan, I. J. B. F. (Accepted/In press). 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
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. 2019.
@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",
language = "English",
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",

}

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.

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. 2019.

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-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

Y1 - 2019

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.

M3 - Conference contribution

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.

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. 2019