Filters








139 Hits in 6.0 sec

Characterization of Difficult Bin Packing Problem Instances oriented to Improve Metaheuristic Algorithms

Adriana Mexicano Santoyo, Joaquín Pérez Ortega, Gerardo Reyes Salgado, Nelva Nely Almanza Ortega
2015 Journal of Computacion y Sistemas  
Improving the Performance of Heuristic Algorithms Based on Exploratory Data Analysis. Recent Advances on Hybrid Intelligent Systems, Vol. 451, pp. 361-375. DOI:10.1007/978-3-642-33021-6_29 36.  ...  A grouping genetic algorithm with controlled gene transmission for the bin packing problem. Computers & Operations Research, Vol. 55, pp. 52-64. 35. Quiroz, M., Cruz, L., J.  ...  Conclusiones y trabajos futuros En este trabajo se muestra que la metodología propuesta para la caracterización de instancias difíciles del problema de Bin Packing de una dimensión contribuye a la generación  ... 
doi:10.13053/cys-19-2-1546 fatcat:6irxrb5r2jhq7pkahumul5xshu

A Storage Pattern-Based Heuristic Algorithm for Solving Instances of Hard28 Datasets for the Bin Packing Problem

Joaquín Pérez, Rafael De la Rosa, Hilda Castillo, Darnes Vilariño
2018 Journal of Computacion y Sistemas  
In this paper, we propose a heuristic algorithm that obtains the optimal solution for 5 instances of the set of instances Hard28, for the problem of packing objects in containers of a dimension (1DBPP)  ...  This algorithm is based on storage patterns of objects in containers. To detect how objects are stored in containers, the HGGA-BP algorithm [8] was used.  ...  This work proposes an exploration strategy that uses different approaches to solve the instances of the Bin Packing problem.  ... 
doi:10.13053/cys-22-1-2777 fatcat:t5rmmp7t5fabzfy76zuwir6yxq

An annotated bibliography of combined routing and loading problems

Manuel Iori, Silvano Martello
2013 Yugoslav Journal of Operations Research  
The interest of researchers and practitioners is motivated by the intrinsic difficulty of this research area, which combines two computationally hard problems, and by its practical relevance in important  ...  Transportation problems involving routing and loading at the same time are currently a hot topic in combinatorial optimization.  ...  Two-Dimensional Bin Packing Problem (2BPP): Pack a set of rectangles into the minimum number of large identical rectangles (bins); • Two-Dimensional Strip Packing Problem (2SPP): Pack a set of rectangles  ... 
doi:10.2298/yjor130315032i fatcat:nmrsizitqnf2lkrl2772w7icxe

Algorithm Selection: From Meta-Learning to Hyper-Heuristics [chapter]

Laura Cruz-Reyes, Claudia Gmez-Santilln, Joaqun Prez-Ortega, Vanesa Landero, Marcela Quiroz, Alberto Ocho
2012 Intelligent Systems  
This phenomenon is most pronounced among algorithms for solving NP-Hard problems, because runtimes for these algorithms are often highly variable from instance to instance of a problem (Leyton-Brown et  ...  Instead we are likely to attain better results, on average, across many different classes of a problem, if we tailor the selection of an algorithm to the characteristics of the problem instance (Smith-Miles  ...  Algorithms for the solution of the Bin Packing Problem The Bin Packing Problem (BPP) is an NP-hard combinatorial optimization problem, in which the objective is to determine the smallest number of bins  ... 
doi:10.5772/36710 fatcat:7br3tmxzqbggvn3z6v7m63pb3y

Applying the big bang-big crunch metaheuristic to large-sized operational problems

Yousef K. Qawqzeh, Ghaith Jaradat, Ali Al-Yousef, Anmar Abu-Hamdah, Ibrahim Almarashdeh, Mutasem Alsmadi, Mohammed Tayfour, Khalid Shaker, Firas Haddad
2020 International Journal of Electrical and Computer Engineering (IJECE)  
The BBBC is tested on three different classes of combinatorial optimization problems; namely, quadratic assignment, bin packing, and job shop scheduling problems.  ...  In this study, we present an investigation of comparing the capability of a big bang-big crunch metaheuristic (BBBC) for managing operational problems including combinatorial optimization problems.  ...  BPP Bin-oriented FFD+B2F: Bin-oriented (improved) first-fit-decreasing (iterated items packing into the bin of the smallest index with sufficient capacity) with best-2-fit (iterated FFD until the bin is  ... 
doi:10.11591/ijece.v10i3.pp2484-2502 fatcat:eofxrlsjrvc7vm7ihwjxrshmle

Dealing with Nonregular Shapes Packing

Bonfim Amaro Júnior, Plácido Rogério Pinheiro, Rommel Dias Saraiva, Pedro Gabriel Calíope Dantas Pinheiro
2014 Mathematical Problems in Engineering  
Moreover, a shrinking algorithm is encapsulated into the metaheuristic engine to improve good quality solutions.  ...  This paper addresses the irregular strip packing problem, a particular two-dimensional cutting and packing problem in which convex/nonconvex shapes (polygons) have to be packed onto a single rectangular  ...  Acknowledgments The first and third authors are thankful to Coordination for the Improvement of Higher Level or Education Personnel (CAPES) and the second and fourth authors are thankful to National Counsel  ... 
doi:10.1155/2014/548957 fatcat:gvcvoesdvndlxor4e64eefxqsi

Logic based Benders' decomposition for orthogonal stock cutting problems

Maxence Delorme, Manuel Iori, Silvano Martello
2017 Computers & Operations Research  
To the best of our knowledge, Jakobs [12] was the first to propose a metaheuristic (genetic) algorithm for the SPP.  ...  The algorithm makes use of preprocessing techniques, dominance criteria, and a powerful lower bound based on a problem oriented continuous relaxation.  ...  Acknowledgements We are grateful to Mutsunori Yagiura for useful discussions. We thank him and his coauthors for providing a working copy of their computer code developed for [18] .  ... 
doi:10.1016/j.cor.2016.09.009 fatcat:pvik5wmqnjbzngpuqguueonjd4

Heuristic algorithms for the three-dimensional bin packing problem

Andrea Lodi, Silvano Martello, Daniele Vigo
2002 European Journal of Operational Research  
The Three-Dimensional Bin Packing Problem (3BP) consists of allocating, without overlapping, a given set of threedimensional rectangular items to the minimum number of three-dimensional identical finite  ...  Extensive computational results on standard benchmark instances show the effectiveness of the approach with respect to exact and heuristic algorithms from the literature. Ó  ...  Acknowledgements We thank the Ministero dell'Universit a a e della Ricerca Scientifica e Tecnologica (MURST) and the Consiglio Nazionale delle Ricerche (CNR), Italy, for the support given to this project  ... 
doi:10.1016/s0377-2217(02)00134-0 fatcat:e5nf6nvlvbhnhd4ajrl6lcxjgm

A new metaheuristic genetic-based placement algorithm for 2D strip packing

Jaya Thomas, Narendra S. Chaudhari
2014 Journal of Industrial Engineering International  
The position is subject to confinement of no overlapping of blocks. The problem is a complex NP-hard combinatorial optimization, thus a heuristic based on genetic algorithm is proposed to solve it.  ...  Given a container of fixed width, infinite height and a set of rectangular block, the 2D-strip packing problem consists of orthogonally placing all the rectangles such that the height is minimized.  ...  There are various categories in packing which include cutting stock problem, knapsack, bin packing and loading problem.  ... 
doi:10.1007/s40092-014-0047-9 fatcat:qvtswjme5bfprjtfuhbrhoqqyi

Sequence based heuristics for two-dimensional bin packing problems

Filipe Alvelos, T. M. Chan, Paulo Vilaça, Tiago Gomes, Elsa Silva, J. M. Valério de Carvalho
2009 Engineering optimization (Print)  
This conclusion is supported by the gaps of the proposed VND metaheuristic to the optimal values (the average gap is less than 2% for bin packing instances of the four problem variants considered) and  ...  For the small set of instances tested, the proposed VND metaheuristic reduced significantly (from 738 to 648) the number of used bins for instances of one of the companies and slightly (from 3943 to 3926  ... 
doi:10.1080/03052150902835960 fatcat:gw5de2352vd2jlwcy6puxfzvfm

A matheuristic algorithm for the three-dimensional loading capacitated vehicle routing problem (3L-CVRP)

Luis Miguel Escobar-Falcón, David Álvarez-Martínez, Mauricio Granada-Echeverri, John Willmer Escobar, Rubén Augusto Romero-Lázaro
2015 Revista Facultad de Ingeniería  
The computational results indicate that the proposed approach is able to obtain good solutions, improving some of the best-known solutions from the literature.  ...  The proposed algorithm is compared with the most efficient approaches for the 3L-CVRP on the set of benchmark instances considered in the literature.  ...  The former algorithm is able to improve the best-known solutions found by the most effective published algorithms on a set of instances taken from the literature. The paper is organized as follows.  ... 
doi:10.17533/udea.redin.n78a02 fatcat:carbzgqm5bg45ienj52asy7eiu

TS2PACK: A two-level tabu search for the three-dimensional bin packing problem

Teodor Gabriel Crainic, Guido Perboli, Roberto Tadei
2009 European Journal of Operational Research  
We present a two-level tabu search for this problem. The first level aims to reduce the number of bins. The second optimizes the packing of the bins.  ...  Three-dimensional orthogonal bin packing is a problem NP-hard in the strong sense where a set of boxes must be orthogonally packed into the minimum number of three-dimensional bins.  ...  Acknowledgements Partial funding for this project has been provided by the Natural Sciences and Engineering Council of Canada.  ... 
doi:10.1016/j.ejor.2007.06.063 fatcat:octgbu5n2rcwxeuhxj73kvatoe

Benchmarking for Metaheuristic Black-Box Optimization: Perspectives and Open Challenges [article]

Ramses Sala, Ralf Müller
2020 arXiv   pre-print
Besides a huge variety of different evolutionary and metaheuristic optimization algorithms, also a large number of test problems and benchmark suites have been developed and used for comparative assessments  ...  Research on new optimization algorithms is often funded based on the motivation that such algorithms might improve the capabilities to deal with real-world and industrially relevant optimization challenges  ...  are even difficult to relate to other synthetic problem instances.  ... 
arXiv:2007.00541v1 fatcat:ed7b4nhdmbc5jclu7qgx2zbgwm

Benchmarking for Metaheuristic Black-Box Optimization: Perspectives and Open Challenges

Ramses Sala, Ralf Muller
2020 2020 IEEE Congress on Evolutionary Computation (CEC)  
Besides a huge variety of different evolutionary and metaheuristic optimization algorithms, also a large number of test problems and benchmark suites have been developed and used for comparative assessments  ...  Research on new optimization algorithms is often funded based on the motivation that such algorithms might improve the capabilities to deal with real-world and industrially relevant optimization challenges  ...  are even difficult to relate to other synthetic problem instances.  ... 
doi:10.1109/cec48606.2020.9185593 dblp:conf/cec/SalaM20 fatcat:l4cliyfwsve7rdsmevj44f4oza

Metaheuristics "In the Large" [article]

Jerry Swan, Steven Adriaensen, Alexander E. I. Brownlee, Kevin Hammond, Colin G. Johnson, Ahmed Kheiri, Faustyna Krawiec, J. J. Merelo, Leandro L. Minku, Ender Özcan, Gisele L. Pappa, Pablo García-Sánchez (+4 others)
2021 arXiv   pre-print
Following decades of sustained improvement, metaheuristics are one of the great success stories of optimization research.  ...  However, in order for research in metaheuristics to avoid fragmentation and a lack of reproducibility, there is a pressing need for stronger scientific and computational infrastructure to support the development  ...  Problem than for Bin-packing.  ... 
arXiv:2011.09821v4 fatcat:7rmva4ri6fbx7gijsgkhlercry
« Previous Showing results 1 — 15 out of 139 results