A Polyhedral Study of Mixed 0-1 Set

We consider a variant of the well-known single node fixed charge network flow set with constant capacities. This set arises from the relaxation of more general mixed integer sets such as lot-sizing problems with multiple suppliers. We provide a complete polyhedral characterization of the convex hull of the given set

A Taboo-Search Algorithm for 3D-Binpacking Problem in Containers

One of the biggest challenges facing by logistics companies is the packing of fragile products in containers. These activities, due to the nature of the packaged products, can entail great risks for the company due to the possible losses and the cost of the transporting containers, so-called in literature as binpacking problem. Being this problem of a complex computational nature (NPhard), companies do not have exact technological solutions to establish a positional sequence of the packages that have to be arranged in containers, considering aspects such as fragility, weight, volume, among other aspects. In most cases only the volume and order of dispatch is considered. The application of bio-inspired techniques such as metaheuristics are an appropriate way to obtain approximate solutions to this kind of problems, without the difficulties of complex software implementations. In previous works of the authors, bioinspired algorithms have been developed to solve the problem and in this paper a taboo-search algorithm is proposed to solve the 3D-bin packing variant, which has been compared with the previous algorithms obtaining approximately a waste reduction of 28%. Fundamentally, research has used real data from Peruvian ceramic industry.publishe