CFP last date
22 April 2024
Call for Paper
May Edition
IJCA solicits high quality original research papers for the upcoming May edition of the journal. The last date of research paper submission is 22 April 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Computational Geometry for Continuous Resource Location Model in a Competitive Environment

by Monika Mangla, Deepak Garg
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 27 - Number 5
Year of Publication: 2011
Authors: Monika Mangla, Deepak Garg
10.5120/3300-4508

Monika Mangla, Deepak Garg . Computational Geometry for Continuous Resource Location Model in a Competitive Environment. International Journal of Computer Applications. 27, 5 ( August 2011), 1-4. DOI=10.5120/3300-4508

@article{ 10.5120/3300-4508,
author = { Monika Mangla, Deepak Garg },
title = { Computational Geometry for Continuous Resource Location Model in a Competitive Environment },
journal = { International Journal of Computer Applications },
issue_date = { August 2011 },
volume = { 27 },
number = { 5 },
month = { August },
year = { 2011 },
issn = { 0975-8887 },
pages = { 1-4 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume27/number5/3300-4508/ },
doi = { 10.5120/3300-4508 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:12:56.952861+05:30
%A Monika Mangla
%A Deepak Garg
%T Computational Geometry for Continuous Resource Location Model in a Competitive Environment
%J International Journal of Computer Applications
%@ 0975-8887
%V 27
%N 5
%P 1-4
%D 2011
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Resource location has become a fundamental question to be answered in the day today life. It has found its place in the life for over hundred years from the smallest application like where to locate any electric appliance in a kitchen to opening a new departmental store by a company. Depending upon the context in which the location model is being used, various objective functions may be designed while main features will always remain same [1]. Here in this paper, we have studied the continuous resource location model where competing resources are already known to exist in the system under study. The newly located resources compete for its share of customer demands with the pre-existing resources in the system and with each other also [2]. The paper also discusses how the applications of computational geometry relate to this spatial problem.

References
  1. C.S. ReVelle, H.A. Eiselt, M.S. Daskin, “A bibliography for some fundamental problem categories in discrete location science”, Proc. European Journal of Operational Research184, pp 817-848, 2008.
  2. Robert Aboolian, Oded Berman, Dmitry Krass, “Competitive facility location and design problem”, Proc. European Journal of Operational Research182, pp 40-62, 2007.
  3. Zvi Drezner,Horst W. Hamacher, “Facility Location: Applications and Theory”, Springer- verlag, first edition 2001, ISBN 3-540-21345-7.
  4. Mark S. Daskin. Network and Discrete Location Models, Algorithms, and Applications, wiley- intersciences, ISBN 0-471-01897-X
  5. Zhishuang yao, Loo hay lee, Wikrom jaruphongsa, Vicky Tan, Chen Fei Hui, “Multi-source facality location-allocation and inventory problem”, Proc. European Journal of Operational Research 207, pp 750-762, 2010.
  6. Kuban Altınel , Engin Durmaz, Necati Aras, Kerem Can Ozkısacık, “A location–allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations”, Proc. European Journal of Operational Research 198, pp 790-799, 2009.
  7. H.A. Eiselt, G. Laporte, Demand allocation functions, Location Science 6 (1998) 175–187
  8. S.L. Hakimi, Locations with spatial interactions: Competitive locations and games, in: P.B. Mirchandani, R.L. Francis (Eds.),Discrete Location Theory, Wiley Interscience, 1990.
  9. Eduardo Conde, “Minmax regret location–allocation problem on a network under uncertainty”, Proc. European Journal of Operational Research 179, pp 1025–1039,2007
  10. Martin Bischoff, Kerstin Dachert, “Allocation search methods for a generalized class of location–allocation problems”, Proc. European Journal of Operational Research 192, pp 793–807, 2009
  11. Joseph Harkness, Charles ReVelle, “Facility location with increasing production costs”, Proc. European Journal of Operational Research145, pp 1-13, 2003.
  12. Elena Fernandez, Justo Puerto, “Multiobjective solution of the uncapacitated plant location problem”, Proc. European Journal of Operational Research145, pp 509-529, 2003.
  13. Tammy Drezner, Zvi Drezner , Said Salhi, “Solving the multiple competitive facilities location problem”, Proc. European Journal of Operational Research 142, pp 138-151,2002
  14. Mark de Berg, Otfried Cheong, Marc van Kreveld, Mark overmars, “Computational Geometry- Algorithms and Applications” ,Springer-Verlag, Third edition, 2008
  15. Joseph O’ Rourke, “Computational Geometry in C”, Cambride University, second edition, 1997
  16. G. Albers, L.J Guibas, J.S.B.Mitchell, and T. Roos, “Voronoi diagrams of moving points”, Presented at Intl. Journal on Computational Geometry and Applications, vol. 8, no. 3, pp.365-380, 1998.
Index Terms

Computer Science
Information Sciences

Keywords

Computational Geometry Competitive Environment

Powered by PhDFocusTM