10:30 AM - 10:55 AM
Cycle Hub Location Problem
In this talk we present the Cycle Hub Location Problem, in which the set of hubs have to be connected by means of a cycle. We propose a branch-and-cut method combined with a GRASP metaheuristic to optimally solve the problem. Computational results on instances with up to 100 nodes are reported and analyzed.
10:55 AM - 11:20 AM
Hub Location with Benefits
In this talk we present the Hub Location Problem with Profits, where it is not necessary to provide service to all demand nodes. A profit is associated with each flow between pair of nodes. The overall goal is the simultaneous optimization of the collected profit, the set-up cost, and the transportation cost. Different classes of applications and modeling approaches are identified and compared.
11:20 AM - 11:45 AM
The Modular Hub location Problem
It has been shown that the common assumption of flow-independent reduced transportation costs in most hub location problems can be an oversimplification. In this talk we present the Modular Hub Location Problem, which explicitly models the flow dependency of costs and considers the design of the hub-and-spoke network as part of the decision process.
11:45 AM - 12:10 PM
An Improved Benders Decomposition Algorithm for the Tree of Hubs Location Problem
The tree of hubs location problem is a variant of hub location problems in which the hubs are connected by means of a tree. In order to solve the problem, a Benders decomposition approach with a new cut selection scheme is presented. Computational results show that the proposed algorithm outperforms two other modern variants of the method.