Metaheuristic algorithms for one-dimensional bin-packing problems: A survey of recent advances and applications
The bin-packing problem (BPP) is an age-old NP-hard combinatorial optimization problem, which is defined as the placement of a set of different-sized items into identical bins such that the number of containers used is optimally minimized. Besides, different variations of the problem do exist in pra...
Guardado en:
Autores principales: | Munien Chanaleä, Ezugwu Absalom E. |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
De Gruyter
2021
|
Materias: | |
Acceso en línea: | https://doaj.org/article/88c9fcae61b14dd6a4799716260dacce |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
A Modified Binary Pigeon-Inspired Algorithm for Solving the Multi-dimensional Knapsack Problem
por: Bolaji Asaju La’aro, et al.
Publicado: (2020) -
An Effective Reactive Power Compensation Method and a Modern Metaheuristic Algorithm for Loss Reduction in Distribution Power Networks
por: Thang Trung Nguyen, et al.
Publicado: (2021) -
Metaheuristics for the Minimum Time Cut Path Problem with Different Cutting and Sliding Speeds
por: Bonfim Amaro Junior, et al.
Publicado: (2021) -
Application of Mini-Batch Metaheuristic Algorithms in Problems of Optimization of Deterministic Systems with Incomplete Information about the State Vector
por: Andrei V. Panteleev, et al.
Publicado: (2021) -
Metaheuristics for a Flow Shop Scheduling Problem with Urgent Jobs and Limited Waiting Times
por: BongJoo Jeong, et al.
Publicado: (2021)