Bi-objective load balancing multiple allocation hub location: a compromise programming approach

Rahimeh Neamatian Monemi, Shahin Gelareh, Anass Nagih, Dylan Jones

Research output: Contribution to journalArticlepeer-review

49 Downloads (Pure)

Abstract

In this paper we address unbalanced spatial distribution of hub-level flows in an optimal hub-and-spoke network structure of median-type models. Our study is based on a rather general variant of the Multiple Allocation Hub Location Problems with fixed setup costs for hub nodes and hub edges in both capacitated and uncapacitated variants wherein the number of hub nodes traversed along origin-destination pairs is not constrained to one or two as in the classical models. From the perspective of an infrastructure owner, we
want to make sure that there exists a choice of design for the hub-level sub-network (hubs and hub edges) that considers both objectives of minimizing cost of transportation and balancing spatial distribution of flow across the hub-level network. We propose a bi-objective (transportation cost and hub-level flow variance) mixed integer non-linear programming formulation and handle the bi-objective model via a compromise programming framework. We exploit the structure of the problem and propose a second-order conic reformulation
of the model along with a very efficient matheuristics algorithm for larger size instances.
Original languageEnglish
Number of pages44
JournalAnnals of Operations Research
Early online date28 Jan 2020
DOIs
Publication statusEarly online - 28 Jan 2020

Keywords

  • hub-and-spoke network design
  • load balancing
  • traffic engineering
  • matheuristic

Fingerprint

Dive into the research topics of 'Bi-objective load balancing multiple allocation hub location: a compromise programming approach'. Together they form a unique fingerprint.

Cite this