We consider a one dimensional storage system where each container can store a bounded amount of capacity as well as a bounded number of items k ≥ 2. This defines the (standard)...
We consider a classic multidimensional generalization of the bin packing problem, namely, packing d-dimensional rectangles into the minimum number of unit cubes. Our two results a...
The vehicle routing problem consists in determining a group of optimal delivery routes that allow satisfaction of the demand from customers spread along a network, which can be re...
Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....
This paper presents two variants of Genetic Algorithms (GAs) for solving the Multiple Container Packing Problem (MCPP), which is a combinatorial optimization problem comprising sim...