Loading...
Loading...

Go to the content (press return)

When centers can fail: a close second opportunity

Author
Albareda-Sambola, M.; Hinojosa , Y.; Marín, A.; Puerto Albandoz, J.
Type of activity
Journal article
Journal
Computers & operations research
Date of publication
2015-10-01
Volume
62
First page
145
Last page
156
DOI
https://doi.org/10.1016/j.cor.2015.01.002 Open in new window
Project funding
Models and methods of mathematical programming and applications
Repository
http://hdl.handle.net/2117/76239 Open in new window
URL
http://www.sciencedirect.com/science/article/pii/S0305054815000076 Open in new window
Abstract
This paper presents the p-next center problem, which aims to locate p out of n centers so as to minimize the maximum cost of allocating customers to backup centers. In this problem it is assumed that centers can fail and customers only realize that their closest (reference) center has failed upon arrival. When this happens, they move to their backup center, i.e., to the center that is closest to the reference center. Hence, minimizing the maximum travel distance from a customer to its backup cen...
Citation
Albareda-Sambola, M., Hinojosa , Y., Marín, A., Puerto Albandoz, J. When centers can fail: a close second opportunity. "Computers & operations research", 01 Octubre 2015, p. 145-156.
Keywords
Discrete location, Integer programming, p-center
Group of research
GNOM - Mathematical Optimization Group

Participants

  • Albareda Sambola, Maria  (author)
  • Hinojosa, Yolanda  (author)
  • Marín Pérez, Alfredo  (author)
  • Puerto Albandoz, Justo  (author)

Attachments