Capacitated single allocation hub location problem-A bi-criteria approach

  • Authors:

  • Maria da Graça Costa;Maria Eugénia Captivo;João Clímaco

  • Affiliations:

  • Escola Superior de Ciencias Empresariais, Instituto Politécnico de Setúbal and Centro de Investigação Operacional, Campus do IPS, Estefanilha, 2914-503 Setúbal, Portugal;Universidade de Lisboa, Faculdade de Ciencias and Centro de Investigaçao Operacional Campo Grande, Bloco C6, Piso 4, 1749-016 Lisboa, Portugal;Faculdade de Economia da Universidade de Coimbra and INESC - Coimbra, Av. Dias da Silva, 165 3004-512 Coimbra, Portugal

  • Venue:
  • Computers and Operations Research
  • Year:
  • 2008

Quantified Score

Hi-index 0.01

Visualization

Abstract

A different approach to the capacitated single allocation hub location problem is presented. Instead of using capacity constraints to limit the amount of flow that can be received by the hubs, we introduce a second objective function to the model (besides the traditional cost minimizing function), that tries to minimize the time to process the flow entering the hubs. Two bi-criteria single allocation hub location problems are presented: in a first model, total time is considered as the second criteria and, in a second model, the maximum service time for the hubs is minimized. To generate non-dominated solutions an interactive decision-aid approach developed for bi-criteria integer linear programming problems is used. Both bi-criteria models are tested on a set of instances, analyzing the corresponding non-dominated solutions set and studying the reasonableness of the hubs flow charge for these non-dominated solutions. The increased information provided by the non-dominated solutions of the bi-criteria model when compared to the unique solution given by the capacitated hub location model is highlighted.