Laboratory Samples Allocation Problem

Proceedings

Rodríguez, Luisa Carpente¹  Davila, Diego Noceda²  Freire, Silvia Lorenzo³ 

[1] Author to whom correspondence should be addressed.;MODES Research Group, Department of Mathematics, University of A Coruña, A Coruña 15001, Spain;Presented at the XoveTIC Congress, A Coruña, Spain, 27–28 September 2018.

关键词: optimization;    planning problem;    simulated annealing;    linear programming;    bin packing;   

DOI  :  10.3390/proceedings2181189

学科分类：社会科学、人文和艺术（综合）

来源: mdpi

【 摘 要 】

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.

【 授权许可】

CC BY