Classification of Location Models and Location Softwares
According to the importance and advantages of classification, the first section of this chapter is dedicated to some presented classifications of location models, which help in having more disciplined understanding of location models. In the second section, some location softwares will be introduced briefly.
Nowadays, with the increasing development of science in all branches, need for a systematic arrangement or proposing a classification scheme for easy access to scientific researches seems necessary. Location science is a branch of optimization science, which formally introduce by Alfred Weber in 1909. It has been growing so rapidly for years that now without a systematic classification of models, continuing the procedure of researches would be so difficult. Therefore, several efforts in classifying location models have been made that, some of them will be mentioned in this section.
- Bender T, Hennes H, Kalcsics J, Melo MT, Nickel S (2002) Location software and interface with GIS and supply chain management. In: Drezner Z, Hammacher H (eds) Facility location: applications and theory. Berlin, SpringerGoogle Scholar
- Carrizosa EJ, Conde E, Munoz M, Puerto J (1995) The generalized weber problem with expected distances. RAIRO 29:35–57Google Scholar
- Daskin MS (2002) SITATION-facility location software. Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL. http://users.iems.northwestern.edu/~msdaskin/
- Eliosoff J, Unger R (1998). MEC – minimum enclosing circle applet. http://www.cs.mcgill.ca/~cs507/projects/1998/jacob/welcome.html
- Francis RL, White JA (1974) Facility layout and location: an analytical approach. Prentice-Hall, Englewood CliffsGoogle Scholar
- Hamacher HW, Klamroth K, Nickel S, Schoebel A (1996) Library of location algorithms. University of Kaiserslautern. http://www.mathematik.uni-kl.de/lola/
- Handler GY, Mirchandani PB (1979) Location on networks theory and algorithms. MIT Press, CambridgeGoogle Scholar
- Kendall D (1951) Some problems in the theory of queues. J R Stat Soc 13:151–153Google Scholar
- Mihelic J (2004) Jure Mihelic k-center algorithms. Department of Computer and Information Science, University of LjubljanaGoogle Scholar
- Sirigos S, Photis YN (2005) S-distance software. Department of Planning and Regional Development (DPRD), University of Thessaly, GreeceGoogle Scholar
- Tansel BC, Francis RL, Lowe TJ (1983) Location on networks: a survey. Part I: the p-center and p-median problems. Manage Sci 29:482–497Google Scholar
- Tiefelsdorf M, Boots B (1997) GAMBINI multiplicative weighted voronoi diagrams. http://www.wlu.ca/wwwgeog/special/download/gambini.htm