F. Semet, S. Gelareh, R. Neamatian Monemi

In this presentation, we address the Bounded Cardinality Hub Location Routing with Route Capacity wherein each hub acts as a transshipment node for one directed route. The number of hubs lies between a minimum and a maximum and the hub-level network is a complete subgraph. The transshipment operations take place at
the hub nodes and flow transfer time from a hub-level transporter to a spoke-level vehicle influences spoke-to-hub allocations. We propose a mathematical model and a branch-and-cut algorithm based on Benders decomposition to solve the problem. To accelerate convergence, our solution framework embeds an efficient heuristic producing high-quality solutions in short computation times. In addition, we show how symmetry
can be exploited to accelerate and improve the performance of our algorithm.

Keywords: Hub Location, Benders Decomposition.

Scheduled

T2 Location 1
October 1, 2015  11:30 AM
Salón de actos


Other papers in the same session

Location Routing Problems on Trees

J. Araoz, E. Fernández, S. Rueda

Global optimization for model discrimination with ODEs

R. Blanquero, E. Carrizosa, M. A. Jiménez-Cordero, B. G. Tóth

Heuristic approaches for the facility location problem with Bernoulli demands

M. Albareda Sambola, E. Fernández, F. Saldanha da Gama


Cookie policy

We use cookies in order to be able to identify and authenticate you on the website. They are necessary for the correct functioning of it, and therefore they can not be disabled. If you continue browsing the website, you are agreeing with their acceptance, as well as our Privacy Policy.

Additionally, we use Google Analytics in order to analyze the website traffic. They also use cookies and you can accept or refuse them with the buttons below.

You can read more details about our Cookie Policy and our Privacy Policy.