Tammy Drezner
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Tammy Drezner has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Zvi Drezner
College of Business and Economics, California State University-Fullerton
14 shared publications - Pawel Kalczynski
College of Business and Economics, California State University-Fullerton, Fullerton, USA
5 shared publications - Dawit Zerom
College of Business and Economics, California State University-Fullerton, Fullerton, USA
3 shared publications - H. A. Eiselt
University of New Brunswick
3 shared publications - Morton E. O'Kelly
The Ohio State University
1 shared publication - Said Salhi
University of Kent
1 shared publication
Latest Publications
- 1 October 2023
- Published by Springer Nature in Networks and Spatial Economics
- Vol. 23 (4) , 885-903
The Obnoxious Competitive Facility Location Model
- 1 October 2023
- Published by Springer Nature in Networks and Spatial Economics
- Vol. 23 (4) , 885-903
The Obnoxious Competitive Facility Location Model
- 21 September 2023
- Published by Springer Nature
- p. 107-127
Stochastic Components of the Attraction Function in Competitive Facilities Location
- 21 September 2023
- Published by Springer Nature
- p. 107-127
Stochastic Components of the Attraction Function in Competitive Facilities Location
- Open Access
- 19 January 2023
- Published by Springer Nature in Research Square
The Obnoxious Competitive Facility Location Model
In this paper we propose a new competitive location model that considers the possible negative impact generated by competing facilities (such as cannabis dispensaries) on surrounding communities. The facilities cannot be located too close to the communities. Therefore, when distances are Euclidean, the facilities must be located at a point outside a set of circles centered at the communities. After formulating the model, a specially designed efficient algorithm that solves the single facility location problem within a given relative accuracy of optimality is constructed. A total of 128 instances are solved in a relatively short time. The largest instance of 10 existing competing facilities and 20,000 demand points was solved in less than 15 minutes of computer time. This new model opens avenues for future research by designing similar new models. Also, the algorithm designed in this paper can be applied to solving other location problems with outside of a set of circles constraints.
- 19 January 2023
- Published by Springer Nature in Research Square
Open AccessThe Obnoxious Competitive Facility Location Model
In this paper we propose a new competitive location model that considers the possible negative impact generated by competing facilities (such as cannabis dispensaries) on surrounding communities. The facilities cannot be located too close to the communities. Therefore, when distances are Euclidean, the facilities must be located at a point outside a set of circles centered at the communities. After formulating the model, a specially designed efficient algorithm that solves the single facility location problem within a given relative accuracy of optimality is constructed. A total of 128 instances are solved in a relatively short time. The largest instance of 10 existing competing facilities and 20,000 demand points was solved in less than 15 minutes of computer time. This new model opens avenues for future research by designing similar new models. Also, the algorithm designed in this paper can be applied to solving other location problems with outside of a set of circles constraints.
- 10 September 2022
- Published by Springer Nature in Annals of Operations Research
- Vol. 321 (1-2) , 191-208
Multipurpose shopping trips and location
- 10 September 2022
- Published by Springer Nature in Annals of Operations Research
- Vol. 321 (1-2) , 191-208
Multipurpose shopping trips and location
- 1 January 2021
- Published by Springer Nature in Computational Management Science
- Vol. 18 (1) , 25-47
Directional approach to gradual cover: the continuous case
- 1 January 2021
- Published by Springer Nature in Computational Management Science
- Vol. 18 (1) , 25-47
Directional approach to gradual cover: the continuous case
- 26 August 2020
- Published by Springer Nature in Networks and Spatial Economics
- Vol. 20 (4) , 915-934
Facility Dependent Distance Decay in Competitive Location
- 26 August 2020
- Published by Springer Nature in Networks and Spatial Economics
- Vol. 20 (4) , 915-934
Facility Dependent Distance Decay in Competitive Location
- Open Access
Directional approach to gradual cover: the continuous case
The objective of the cover location models is covering demand by facilities within a given distance. The gradual (or partial) cover replaces abrupt drop from full cover to no cover by defining gradual decline in cover. In this paper we use a recently proposed rule for calculating the joint cover of a demand point by several facilities termed "directional gradual cover". Contrary to all gradual cover models, the joint cover depends on the facilities' directions. In order to calculate the joint cover, existing models apply the partial cover by each facility disregarding their direction. We develop a genetic algorithm to solve the facilities location problem and also solve the problem for facilities that can be located anywhere in the plane. The proposed modifications were extensively tested on a case study of covering Orange County, California.
Open AccessDirectional approach to gradual cover: the continuous case
The objective of the cover location models is covering demand by facilities within a given distance. The gradual (or partial) cover replaces abrupt drop from full cover to no cover by defining gradual decline in cover. In this paper we use a recently proposed rule for calculating the joint cover of a demand point by several facilities termed "directional gradual cover". Contrary to all gradual cover models, the joint cover depends on the facilities' directions. In order to calculate the joint cover, existing models apply the partial cover by each facility disregarding their direction. We develop a genetic algorithm to solve the facilities location problem and also solve the problem for facilities that can be located anywhere in the plane. The proposed modifications were extensively tested on a case study of covering Orange County, California.
- 18 March 2020
- Published by Springer Nature in OR Spectrum
- Vol. 42 (2) , 333-354
Gradual cover competitive facility location
- 18 March 2020
- Published by Springer Nature in OR Spectrum
- Vol. 42 (2) , 333-354
Gradual cover competitive facility location