A Compact Linearisation of Euclidean Single Allocation Hub Location Problems

https://doi.org/10.1016/j.endm.2016.03.006Get rights and content

Abstract

Hub location problems are strategic network planning problems. They formalise the challenge of mutually exchanging shipments between a large set of depots. The aim is to choose a set of hubs (out of a given set of possible hubs) and connect every depot to a hub so that the total transport costs for exchanging shipments between the depots are minimised. In classical hub location problems, the unit cost for transport between hubs is proportional to the distance between the hubs. Often these distances are Euclidean distances: Then it is possible to replace the quadratic cost term for hub-hub-transport in the objective function by a linear term and a set of linear inequalities. The resulting model can be solved by a row generation scheme. The strength of the method is shown by solving all AP instances to optimality.

References (6)

There are more references available in the full text version of this article.

Cited by (7)

  • Stochastic single-allocation hub location

    2021, European Journal of Operational Research
    Citation Excerpt :

    One such variation is the multiple allocation problem where the flow of the same spoke node can be routed through different hubs, i.e. the node is allocated to multiple hubs (Campbell, 1996; Ernst & Krishnamoorthy, 1998). Alternatively, the single allocation problem assigns each spoke node to exactly one hub and accordingly routes the flow (Campbell, 1996; Meier, Clausen, Rostami, & Buchheim, 2016; O’Kelly, 1987; Rostami, Buchheim, Meier, & Clausen, 2016). Furthermore, each of these variations can be classified as capacitated or uncapacitated depending on the type of capacity restriction.

  • Reliable single allocation hub location problem under hub breakdowns

    2018, Computers and Operations Research
    Citation Excerpt :

    O’Kelly (1987) proposed the first quadratic integer programming formulation for classic uncapacitated, single allocation p-hub median problem where the number of hubs, denoted by p, is given (the so-called p-Hub Median Problem). Since then, many exact and heuristic algorithms have been proposed in the literature, dealing with locating both a fixed and a variable number of hubs, e.g., by Campbell (1994), Ernst and Krishnamoorthy (1996), Skorin-Kapov et al. (1996), Contreras et al. (2011), Meier et al. (2016), and Ilić et al. (2010). Due to the quadratic nature of the problem, many attempts have been made to linearize the objective function so that the resulting lower bound is strong enough to be used in a branch-and-bound algorithm.

  • Optimization of the p-hub median problem via artificial immune systems

    2019, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
View all citing articles on Scopus
1

This research has been funded by the German Research Foundation (DFG) within the project “Lenkung des Güterflusses in durch Gateways gekoppelten Logistik-Service-Netzwerken mittels quadratischer Optimierung” (CL 318/14 and BU 2313/2)

View full text