TOP

, Volume 18, Issue 1, pp 203–222

The ordered capacitated facility location problem

  • Jörg Kalcsics
  • Stefan Nickel
  • Justo Puerto
  • Antonio M. Rodríguez-Chía
Original Paper

DOI: 10.1007/s11750-009-0089-0

Cite this article as:
Kalcsics, J., Nickel, S., Puerto, J. et al. TOP (2010) 18: 203. doi:10.1007/s11750-009-0089-0

Abstract

In this paper, we analyze flexible models for capacitated discrete location problems with setup costs. We introduce a major extension with regards to standard models which consists of distinguishing three different points of view of a location problem in a logistics system. We develop mathematical programming formulations for these models using discrete ordered objective functions with some new features. We report on the computational behavior of these formulations tested on a randomly generated battery of instances.

Keywords

Discrete location Mixed integer programming Strategic planning 

Mathematics Subject Classification (2000)

90B80 90B06 90C11 

Copyright information

© Sociedad de Estadística e Investigación Operativa 2009

Authors and Affiliations

  • Jörg Kalcsics
    • 1
  • Stefan Nickel
    • 1
  • Justo Puerto
    • 2
  • Antonio M. Rodríguez-Chía
    • 3
  1. 1.Institute for Operations ResearchUniversität Karlsruhe (TH)KarlsruheGermany
  2. 2.Dpto. Estadística e Investigación OperativaUniversidad de SevillaSevillaSpain
  3. 3.Dpto. Estadística e Investigación OperativaUniversidad de CádizPuerto RealSpain

Personalised recommendations