One-Dimensional Bin Packing Problem: An Experimental Study of Instances Difficulty and Algorithms Performance-Reference-Cited by-同舟云学术

One-Dimensional Bin Packing Problem: An Experimental Study of Instances Difficulty and Algorithms Performance

Published:2021 Issue: Volume: Page:171-201
ISSN:1860-949X
Container-title:Fuzzy Logic Hybrid Extensions of Neural and Optimization Algorithms: Theory and Applications
language:
Short-container-title:

Author:

Carmona-Arroyo Guadalupe,Vázquez-Aguirre Jenny Betsabé,Quiroz-Castellanos Marcela

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-68776-2_10

Reference19 articles.

1. Basse, S. 1998. Computer Algorithms. Introduction to Design and Analysis: Editorial Addison-Wesley Publishing Company.

2. Buljubašić, M., and M. Vasquez. 2016. Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing. Computers & Operations Research 76: 12–21.

3. Chiarandini, M., L. Paquete, M. Preuss, and E. Ridge. 2007. Experiments on metaheuristics: Methodological overview and open issues. Technical Report DMF-2007-03-003, The Danish Mathematical Society.

4. Cruz, L. 2004. Caracterización de Algoritmos Heuísticos Aplicados al Diseño de Bases de Datos Distribuidas. PhD Thesis, Centro Nacional de Investigación y Desarrollo Tecnológico, Cuernavaca, Morelos, México.

5. Delorme, M., M. Iori, and S. Martello. 2016. Bin packing and cutting stock problems: Mathematical models and exact algorithms. European Journal of Operational Research 255 (1): 1–20.

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Causal Analysis to Explain the Performance of Algorithms: A Case Study for the Bin Packing Problem;Mathematical and Computational Applications;2024-08-28

2. Deterministic Parameter Control Applied to the Grouping Genetic Algorithm with Controlled Gene Transmission;2023 10th International Conference on Soft Computing & Machine Intelligence (ISCMI);2023-11-25