Search Results - subject:"Bin packing problem"

Improved layout structure with complexity measures for the Manufacturer's pallet loading problem (MPLP) using a Block approach

Aljuhani, Deemah; Papageorgiou, Lazaros - In: Journal of industrial engineering and management : JIEM 14 (2021) 2, pp. 231-249

Purpose: The purpose of this paper is to study the Manufacturers pallet-loading problem (MPLP), by loading identical small boxes onto a rectangle pallet to maximise the pallet utilization percentage while reducing the Complexity of loading. Design/methodology/approach: In this research a Block...

Persistent link: https://www.econbiz.de/10012503203

A hybrid evolutionary algorithm for the offline Bin Packing Problem

Borgulya, Istvan - In: Central European journal of operations research 29 (2021) 2, pp. 425-445

Persistent link: https://www.econbiz.de/10012542943

Multi-period bin packing model and effective constructive heuristics for corridor-based logistics capacity planning

Crainic, Teodor Gabriel; Djeumou Fomeni, Franklin; Rei, … - 2021

Persistent link: https://www.econbiz.de/10012545714

A branch-and-cut and a parallel algorithm for packing two-dimensional rectangles in a circular container

Silva, Allyson; Coelho, Leandro C.; Darvish, Maryam; … - 2021

Persistent link: https://www.econbiz.de/10012615643

Formulations and exact solution approaches for a coupled bin-packing and lot-sizing problem with sequence-dependent setups

Melega, Gislaine Mara; Araujo, Silvio de; Jans, Raf; … - 2021

Persistent link: https://www.econbiz.de/10012650269

An Articulation Point Based Heuristic Algorithm for Minimum Weight Vertex Cover Problem

Mastan, Shaik; Balakrishna, U.; Raju, G. Sankar Sekhar; … - 2021

The minimum weight vertex cover problem (MWVCP) is well known combinatorial optimization problem that has several practical applications and formally defined as: Given an undirected graph with a set of vertices and edges, each vertex is assigned bya positive weight, the MWVCP aims to find a...

Persistent link: https://www.econbiz.de/10014089627

Combinatorial benders decomposition for the two-dimensional bin packing problem

Côté, Jean-François; Haouari, Mohamed; Iori, Manuel - In: INFORMS journal on computing : JOC 33 (2021) 3, pp. 963-978

Persistent link: https://www.econbiz.de/10012631635

Bin packing problem with conflicts and item fragmentation

Ekici, Ali - In: Computers & operations research : and their … 126 (2021), pp. 1-16

Persistent link: https://www.econbiz.de/10012425884

Adaptive large neighborhood search for solving the circle bin packing problem

He, Kun; Tole, Kevin; Ni, Fei; Yuan, Yong; Liao, Linyun - In: Computers & operations research : and their … 127 (2021), pp. 1-13

Persistent link: https://www.econbiz.de/10012432131

Compact integer linear programming formulations for the temporal bin packing problem with fire-ups

Martinovic, John; Strasdat, N.; Selch, M. - In: Computers & operations research : and their … 132 (2021), pp. 1-26

Persistent link: https://www.econbiz.de/10012595681