A hybrid VNS matheuristic for a bin packing problem with a color constraint
We study a new variant of the bin packing problem with a color constraint. Given a finite set of items, each item has a set of colors. Each bin has a color capacity, the total number of colors for a bin is the unification of colors for its items and cannot exceed the bin capacity. We need to pack al...
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Artigo |
| Lenguaje: | Inglês |
| Publicado: |
University of Belgrade
2021-01-01
|
| Colección: | Yugoslav Journal of Operations Research |
| Materias: | |
| Acceso en línea: | http://www.doiserbia.nb.rs/img/doi/0354-0243/2021/0354-02432100009K.pdf |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|