Laboratory Samples Allocation Problem

Laboratory Samples Allocation Problem

This work aims to solve the optimization problem associated with the allocation of laboratory samples in plates. The processing of each of these plates is costly both in time and money, therefore the main objective is to minimize the number of plates used. The characteristics of the problem are remi...

Full description

Bibliographic Details
Main Authors: Diego Noceda Davila, Luisa Carpente Rodríguez, Silvia Lorenzo Freire
Format: Article
Language:English
Published: MDPI AG 2018-09-01
Series:Proceedings
Subjects:
optimization
planning problem
simulated annealing
linear programming
bin packing
Online Access:http://www.mdpi.com/2504-3900/2/18/1189
id doaj-67837937f94a4a38a03ccadab8f98420
record_format Article
spelling doaj-67837937f94a4a38a03ccadab8f984202020-11-25T00:47:13ZengMDPI AGProceedings2504-39002018-09-01218118910.3390/proceedings2181189proceedings2181189Laboratory Samples Allocation ProblemDiego Noceda Davila0Luisa Carpente Rodríguez1Silvia Lorenzo Freire2MODES Research Group, Department of Mathematics, University of A Coruña, A Coruña 15001, SpainMODES Research Group, Department of Mathematics, University of A Coruña, A Coruña 15001, SpainMODES Research Group, Department of Mathematics, University of A Coruña, A Coruña 15001, SpainThis work aims to solve the optimization problem associated with the allocation of laboratory samples in plates. The processing of each of these plates is costly both in time and money, therefore the main objective is to minimize the number of plates used. The characteristics of the problem are reminiscent of the well-known bin packing problem, an NP-Hard problem that, although it is feasible to model as a linear programming problem, it cannot be solved at a reasonable cost. This work, proposes the implementation of a heuristic algorithm that provides good results at a low computational cost.http://www.mdpi.com/2504-3900/2/18/1189optimizationplanning problemsimulated annealinglinear programmingbin packing
collection DOAJ
language English
format Article
sources DOAJ
author Diego Noceda Davila
Luisa Carpente Rodríguez
Silvia Lorenzo Freire
spellingShingle Diego Noceda Davila
Luisa Carpente Rodríguez
Silvia Lorenzo Freire
Laboratory Samples Allocation Problem
Proceedings
optimization
planning problem
simulated annealing
linear programming
bin packing
author_facet Diego Noceda Davila
Luisa Carpente Rodríguez
Silvia Lorenzo Freire
author_sort Diego Noceda Davila
title Laboratory Samples Allocation Problem
title_short Laboratory Samples Allocation Problem
title_full Laboratory Samples Allocation Problem
title_fullStr Laboratory Samples Allocation Problem
title_full_unstemmed Laboratory Samples Allocation Problem
title_sort laboratory samples allocation problem
publisher MDPI AG
series Proceedings
issn 2504-3900
publishDate 2018-09-01
description This work aims to solve the optimization problem associated with the allocation of laboratory samples in plates. The processing of each of these plates is costly both in time and money, therefore the main objective is to minimize the number of plates used. The characteristics of the problem are reminiscent of the well-known bin packing problem, an NP-Hard problem that, although it is feasible to model as a linear programming problem, it cannot be solved at a reasonable cost. This work, proposes the implementation of a heuristic algorithm that provides good results at a low computational cost.
topic optimization
planning problem
simulated annealing
linear programming
bin packing
url http://www.mdpi.com/2504-3900/2/18/1189
work_keys_str_mv AT diegonocedadavila laboratorysamplesallocationproblem
AT luisacarpenterodriguez laboratorysamplesallocationproblem
AT silvialorenzofreire laboratorysamplesallocationproblem
_version_ 1725261226038001664

Similar Items