IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v10y2022i22p4359-d978225.html
   My bibliography  Save this article

Two-Stage Optimization Methods to Solve the DNA-Sample Allocation Problem

Author

Listed:
  • Diego Noceda-Davila

    (MODES Research Group, Department of Mathematics, Faculty of Computer Science and CITIC Research Centre, University of A Coruña, 15071 A Coruña, Spain
    These authors contributed equally to this work.)

  • Silvia Lorenzo-Freire

    (MODES Research Group, Department of Mathematics, Faculty of Computer Science and CITIC Research Centre, University of A Coruña, 15071 A Coruña, Spain
    These authors contributed equally to this work.)

  • Luisa Carpente

    (MODES Research Group, Department of Mathematics, Faculty of Computer Science and CITIC Research Centre, University of A Coruña, 15071 A Coruña, Spain
    These authors contributed equally to this work.)

Abstract

This paper deals with new methods capable of solving the optimization problem concerning the allocation of DNA samples in plates in order to carry out the DNA sequencing with the Sanger technique. These methods make it possible to work with independent subproblems of lower complexity, obtaining solutions of good quality while maintaining a competitive time cost. They are compared with the ones introduced in the literature, obtaining interesting results. All the comparisons among the methods in the literature and the laboratory results have been made with real data.

Suggested Citation

  • Diego Noceda-Davila & Silvia Lorenzo-Freire & Luisa Carpente, 2022. "Two-Stage Optimization Methods to Solve the DNA-Sample Allocation Problem," Mathematics, MDPI, vol. 10(22), pages 1-31, November.
    • Handle: RePEc:gam:jmathe:v:10:y:2022:i:22:p:4359-:d:978225
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/22/4359/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/10/22/4359/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Emily Henriette & Mondher Feki & Imed Boughzala, 2015. "The shape of digital transformation : a systematic literature review," Grenoble Ecole de Management (Post-Print) hal-02387019, HAL.
    2. Turkcan, Ayten & Zeng, Bo & Muthuraman, Kumar & Lawley, Mark, 2011. "Sequential clinical scheduling with service criteria," European Journal of Operational Research, Elsevier, vol. 214(3), pages 780-795, November.
    3. Delorme, Maxence & Iori, Manuel & Martello, Silvano, 2016. "Bin packing and cutting stock problems: Mathematical models and exact algorithms," European Journal of Operational Research, Elsevier, vol. 255(1), pages 1-20.
    4. van Merode, G. G. & Oosten, M. & Vrieze, O. J. & Derks, J. & Hasman, A., 1998. "Optimisation of the structure of the clinical laboratory," European Journal of Operational Research, Elsevier, vol. 105(2), pages 308-316, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Jean-François Côté & Manuel Iori, 2018. "The Meet-in-the-Middle Principle for Cutting and Packing Problems," INFORMS Journal on Computing, INFORMS, vol. 30(4), pages 646-661, November.
    2. Guo, Hainan & Xie, Yue & Jiang, Bowen & Tang, Jiafu, 2024. "When outpatient appointment meets online consultation: A joint scheduling optimization framework," Omega, Elsevier, vol. 127(C).
    3. Imed Boughzala & Nesrine Ben Yahia & Narjès Bellamine Ben Saoud & Wissem Eljaoued, 2022. "Shape it better than skip it: mapping the territory of quantum computing and its transformative potential," Post-Print hal-03825319, HAL.
    4. de Lima, Vinícius L. & Alves, Cláudio & Clautiaux, François & Iori, Manuel & Valério de Carvalho, José M., 2022. "Arc flow formulations based on dynamic programming: Theoretical foundations and applications," European Journal of Operational Research, Elsevier, vol. 296(1), pages 3-21.
    5. Fatih Gurcan & Gizem Dilan Boztas & Gonca Gokce Menekse Dalveren & Mohammad Derawi, 2023. "Digital Transformation Strategies, Practices, and Trends: A Large-Scale Retrospective Study Based on Machine Learning," Sustainability, MDPI, vol. 15(9), pages 1-23, May.
    6. B. S. C. Campello & C. T. L. S. Ghidini & A. O. C. Ayres & W. A. Oliveira, 2022. "A residual recombination heuristic for one-dimensional cutting stock problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(1), pages 194-220, April.
    7. Becker, Henrique & Buriol, Luciana S., 2019. "An empirical analysis of exact algorithms for the unbounded knapsack problem," European Journal of Operational Research, Elsevier, vol. 277(1), pages 84-99.
    8. Maxence Delorme & Manuel Iori, 2020. "Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems," INFORMS Journal on Computing, INFORMS, vol. 32(1), pages 101-119, January.
    9. John Martinovic & Markus Hähnel & Guntram Scheithauer & Waltenegus Dargie, 2022. "An introduction to stochastic bin packing-based server consolidation with conflicts," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(2), pages 296-331, July.
    10. Dell’Amico, Mauro & Delorme, Maxence & Iori, Manuel & Martello, Silvano, 2019. "Mathematical models and decomposition methods for the multiple knapsack problem," European Journal of Operational Research, Elsevier, vol. 274(3), pages 886-899.
    11. Sierra-Paradinas, María & Soto-Sánchez, Óscar & Alonso-Ayuso, Antonio & Martín-Campo, F. Javier & Gallego, Micael, 2021. "An exact model for a slitting problem in the steel industry," European Journal of Operational Research, Elsevier, vol. 295(1), pages 336-347.
    12. Wuttke, David A. & Heese, H. Sebastian, 2018. "Two-dimensional cutting stock problem with sequence dependent setup times," European Journal of Operational Research, Elsevier, vol. 265(1), pages 303-315.
    13. Shen, Zuo-Jun Max & Xie, Jingui & Zheng, Zhichao & Zhou, Han, 2023. "Dynamic scheduling with uncertain job types," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1047-1060.
    14. Ludvík Eger, 2022. "The demands on competencies for digital transformation and the perception of business students," International Journal of Teaching and Education, European Research Center, vol. 10(1), pages 10-26, April.
    15. Lijun Wei & Zhixing Luo, & Roberto Baldacci & Andrew Lim, 2020. "A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 428-443, April.
    16. César Torres Martín & Christian Acal & Mohammed El Homrani & Ángel Custodio Mingorance Estrada, 2021. "Impact on the Virtual Learning Environment Due to COVID-19," Sustainability, MDPI, vol. 13(2), pages 1-16, January.
    17. Piotr Sawicki & Hanna Sawicka & Marek Karkula & Krzysztof Zajda, 2025. "Combined Rough Sets and Rule-Based Expert System to Support Environmentally Oriented Sandwich Pallet Loading Problem," Energies, MDPI, vol. 18(2), pages 1-48, January.
    18. Zhiling Guo & Jin Li & Ram Ramesh, 2023. "Green Data Analytics of Supercomputing from Massive Sensor Networks: Does Workload Distribution Matter?," Information Systems Research, INFORMS, vol. 34(4), pages 1664-1685, December.
    19. Oliveira, Washington A. & Fiorotto, Diego J. & Song, Xiang & Jones, Dylan F., 2021. "An extended goal programming model for the multiobjective integrated lot-sizing and cutting stock problem," European Journal of Operational Research, Elsevier, vol. 295(3), pages 996-1007.
    20. Renatha Capua & Yuri Frota & Luiz Satoru Ochi & Thibaut Vidal, 2018. "A study on exponential-size neighborhoods for the bin packing problem with conflicts," Journal of Heuristics, Springer, vol. 24(4), pages 667-695, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:10:y:2022:i:22:p:4359-:d:978225. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.