Optimization Online


A Compact Linearisation of Euclidean Single Allocation Hub Location Problems

J. Fabian Meier (meier***at***itl.tu-dortmund.de)
Uwe Clausen (clausen***at***itl.tu-dortmund.de)
Borzou Rostami (brostami***at***mathematik.tu-dortmund.de)
Christoph Buchheim (christoph.buchheim***at***tu-dortmund.de)

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 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.

Keywords: Hub Location, Euclidean Distance, Row Generation

Category 1: Applications -- OR and Management Sciences (Production and Logistics )

Category 2: Integer Programming (0-1 Programming )

Category 3: Network Optimization

Citation: Electronic Notes in Discrete Mathematics 2015 (accepted)


Entry Submitted: 11/28/2014
Entry Accepted: 11/28/2014
Entry Last Modified: 02/04/2015

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society