Full Program »
A Taboo-Search algorithm for 3D-Binpacking problem in containers
One of the biggest challenges facing 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. Being a NP-hard problem, in the present investigation we developed a Taboo-Search metaheuristic to solve the 3D-Binpacking problem and we showed the superiority of the results compared to a previously developed genetic algorithm.