Online facility assignment

Abu Reyan Ahmed, Md Saidur Rahman, Stephen G Kobourov

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We consider the online facility assignment problem, with a set of facilities F of equal capacity l in metric space and customers arriving one by one in an online manner. We must assign customer ci to facility fj before the next customer ci+1 arrives. The cost of this assignment is the distance between ci and fj. The total number of customers is at most |F|l and each customer must be assigned to a facility. The objective is to minimize the sum of all assignment costs. We first consider the case where facilities are placed on a line so that the distance between adjacent facilities is the same and customers appear anywhere on the line. We describe a greedy algorithm with competitive ratio 4|F| and another one with competitive ratio |F|. Finally, we consider a variant in which the facilities are placed on the vertices of a graph and two algorithms in that setting.

Original languageEnglish (US)
Title of host publicationWALCOM
Subtitle of host publicationAlgorithms and Computation - 12th International Conference, WALCOM 2018, Proceedings
PublisherSpringer-Verlag
Pages156-168
Number of pages13
ISBN (Print)9783319751719
DOIs
StatePublished - Jan 1 2018
Event12th International Conference and Workshop on Algorithms and Computation, WALCOM 2018 - Dhaka, Bangladesh
Duration: Mar 3 2018Mar 5 2018

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10755 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other12th International Conference and Workshop on Algorithms and Computation, WALCOM 2018
CountryBangladesh
CityDhaka
Period3/3/183/5/18

Fingerprint

Assignment
Customers
Competitive Ratio
Line
Costs
Assignment Problem
Greedy Algorithm
Metric space
Assign
Adjacent
Minimise
Vertex of a graph

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Ahmed, A. R., Rahman, M. S., & Kobourov, S. G. (2018). Online facility assignment. In WALCOM: Algorithms and Computation - 12th International Conference, WALCOM 2018, Proceedings (pp. 156-168). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10755 LNCS). Springer-Verlag. https://doi.org/10.1007/978-3-319-75172-6_14

Online facility assignment. / Ahmed, Abu Reyan; Rahman, Md Saidur; Kobourov, Stephen G.

WALCOM: Algorithms and Computation - 12th International Conference, WALCOM 2018, Proceedings. Springer-Verlag, 2018. p. 156-168 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10755 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ahmed, AR, Rahman, MS & Kobourov, SG 2018, Online facility assignment. in WALCOM: Algorithms and Computation - 12th International Conference, WALCOM 2018, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10755 LNCS, Springer-Verlag, pp. 156-168, 12th International Conference and Workshop on Algorithms and Computation, WALCOM 2018, Dhaka, Bangladesh, 3/3/18. https://doi.org/10.1007/978-3-319-75172-6_14
Ahmed AR, Rahman MS, Kobourov SG. Online facility assignment. In WALCOM: Algorithms and Computation - 12th International Conference, WALCOM 2018, Proceedings. Springer-Verlag. 2018. p. 156-168. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-75172-6_14
Ahmed, Abu Reyan ; Rahman, Md Saidur ; Kobourov, Stephen G. / Online facility assignment. WALCOM: Algorithms and Computation - 12th International Conference, WALCOM 2018, Proceedings. Springer-Verlag, 2018. pp. 156-168 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{f6fd4052738b4fc8899204d500aada09,
title = "Online facility assignment",
abstract = "We consider the online facility assignment problem, with a set of facilities F of equal capacity l in metric space and customers arriving one by one in an online manner. We must assign customer ci to facility fj before the next customer ci+1 arrives. The cost of this assignment is the distance between ci and fj. The total number of customers is at most |F|l and each customer must be assigned to a facility. The objective is to minimize the sum of all assignment costs. We first consider the case where facilities are placed on a line so that the distance between adjacent facilities is the same and customers appear anywhere on the line. We describe a greedy algorithm with competitive ratio 4|F| and another one with competitive ratio |F|. Finally, we consider a variant in which the facilities are placed on the vertices of a graph and two algorithms in that setting.",
author = "Ahmed, {Abu Reyan} and Rahman, {Md Saidur} and Kobourov, {Stephen G}",
year = "2018",
month = "1",
day = "1",
doi = "10.1007/978-3-319-75172-6_14",
language = "English (US)",
isbn = "9783319751719",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer-Verlag",
pages = "156--168",
booktitle = "WALCOM",

}

TY - GEN

T1 - Online facility assignment

AU - Ahmed, Abu Reyan

AU - Rahman, Md Saidur

AU - Kobourov, Stephen G

PY - 2018/1/1

Y1 - 2018/1/1

N2 - We consider the online facility assignment problem, with a set of facilities F of equal capacity l in metric space and customers arriving one by one in an online manner. We must assign customer ci to facility fj before the next customer ci+1 arrives. The cost of this assignment is the distance between ci and fj. The total number of customers is at most |F|l and each customer must be assigned to a facility. The objective is to minimize the sum of all assignment costs. We first consider the case where facilities are placed on a line so that the distance between adjacent facilities is the same and customers appear anywhere on the line. We describe a greedy algorithm with competitive ratio 4|F| and another one with competitive ratio |F|. Finally, we consider a variant in which the facilities are placed on the vertices of a graph and two algorithms in that setting.

AB - We consider the online facility assignment problem, with a set of facilities F of equal capacity l in metric space and customers arriving one by one in an online manner. We must assign customer ci to facility fj before the next customer ci+1 arrives. The cost of this assignment is the distance between ci and fj. The total number of customers is at most |F|l and each customer must be assigned to a facility. The objective is to minimize the sum of all assignment costs. We first consider the case where facilities are placed on a line so that the distance between adjacent facilities is the same and customers appear anywhere on the line. We describe a greedy algorithm with competitive ratio 4|F| and another one with competitive ratio |F|. Finally, we consider a variant in which the facilities are placed on the vertices of a graph and two algorithms in that setting.

UR - http://www.scopus.com/inward/record.url?scp=85043319460&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85043319460&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-75172-6_14

DO - 10.1007/978-3-319-75172-6_14

M3 - Conference contribution

SN - 9783319751719

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 156

EP - 168

BT - WALCOM

PB - Springer-Verlag

ER -