Learn More
Multi-echelon distribution systems are quite common in supply-chain and logistic systems. They are used by public administrations in their transportation and traffic planning strategies as well as by companies to model their distribution systems. In the literature, most of the studies address issues related to the movement of flows throughout the system(More)
One of the main issues in addressing three-dimensional packing problems is finding an efficient and accurate definition of the points where to place the items inside the bins. The performance of exact and heuristic methods is actually strongly influenced by the choice of a placement rule. We introduce the Extreme Point concept and present a new Extreme(More)
We consider the Variable Cost and Size Bin Packing Problem, a generalization of the well-known bin packing problem, where a set of items must be packed into a set of heterogeneous bins characterized by possibly different volumes and fixed selection costs. The objective of the problem is to select bins to pack all items at minimum total bin-selection cost.(More)
In this paper we address the Two-Echelon Vehicle Routing Problem (2E-VRP), an extension of the classical VRP, where the delivery from a single depot to customers is managed by routing and consolidating the freight through intermediate depots that are called satellites. We present a family of Multi-Start heuristics based on separating the depot-to-satellite(More)
In this paper, we address the issue of computing fast lower bounds for the Bin Packing problem, i.e., bounds that have a computational complexity dominated by the complexity of ordering the items by non-increasing values of their volume. We introduce new classes of fast lower bounds with improved asymptotic worst-case performance compared to well-known(More)
This paper addresses the issue of computing the asymptotic worst-case of lower bounds for the Bin Packing Problem. We introduce a general result that allows to bound the asymptotic worst-case performance of any lower bound for the problem and to derive for the first time the asymptotic worst-case of the well-known bound L 3 by Martello and Toth. We also(More)