Pub Date : 1998-05-01DOI: 10.1016/S0966-8349(98)00050-3
Jack Brimberg , Henrik Juel
Most facilities in today's technological society may be classified as semi-desirable. That is, the facility provides a benefit or service to society, while adversely affecting the quality of life or social values in a number of possible ways. The paper proposes a location model for a new semi-desirable facility that accounts for the service costs by a standard minisum objective with arbitrary travel distance function. The social costs are imputed by specifying around each demand point or population center a convex forbidden region, also defined by an arbitrary distance metric, in which the new facility may not be located. A general solution algorithm is suggested, and the methodology is applied to circular forbidden regions and special travel distance functions.
{"title":"A minisum model with forbidden regions for locating a semi-desirable facility in the plane","authors":"Jack Brimberg , Henrik Juel","doi":"10.1016/S0966-8349(98)00050-3","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)00050-3","url":null,"abstract":"<div><p>Most facilities in today's technological society may be classified as semi-desirable. That is, the facility provides a benefit or service to society, while adversely affecting the quality of life or social values in a number of possible ways. The paper proposes a location model for a new semi-desirable facility that accounts for the service costs by a standard minisum objective with arbitrary travel distance function. The social costs are imputed by specifying around each demand point or population center a convex forbidden region, also defined by an arbitrary distance metric, in which the new facility may not be located. A general solution algorithm is suggested, and the methodology is applied to circular forbidden regions and special travel distance functions.</p></div>","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"6 1","pages":"Pages 109-120"},"PeriodicalIF":0.0,"publicationDate":"1998-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0966-8349(98)00050-3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72110414","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1998-05-01DOI: 10.1016/S0966-8349(98)00053-9
Horst W. Hamacher , Stefan Nickel
There are several good reasons to introduce classification schemes for optimization models. For instance, the ability to make concise problem statements, as opposed to verbal, often ambiguous, descriptions. Or the possibility of simple data encoding and information retrieval in bibliographical information systems and software libraries. Therefore, in some branches of optimization, such as scheduling and queuing theory, classification is a widely used tool.
The aim of this paper is to propose a 5-position classification that can be used to describe all location models. We provide a list of currently available symbols and indicate their usefulness in a (necessarily non-comprehensive) list of “classical” location models. The classification scheme has been in use since 1992 and has proven to be helpful in research, software development, classroom teaching, and for overview articles.
{"title":"Classification of location models","authors":"Horst W. Hamacher\u0000 , Stefan Nickel","doi":"10.1016/S0966-8349(98)00053-9","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)00053-9","url":null,"abstract":"<div><p>There are several good reasons to introduce classification schemes for optimization models. For instance, the ability to make concise problem statements, as opposed to verbal, often ambiguous, descriptions. Or the possibility of simple data encoding and information retrieval in bibliographical information systems and software libraries. Therefore, in some branches of optimization, such as scheduling and queuing theory, classification is a widely used tool.</p><p>The aim of this paper is to propose a 5-position classification that can be used to describe all location models. We provide a list of currently available symbols and indicate their usefulness in a (necessarily non-comprehensive) list of “classical” location models. The classification scheme has been in use since 1992 and has proven to be helpful in research, software development, classroom teaching, and for overview articles.</p></div>","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"6 1","pages":"Pages 229-242"},"PeriodicalIF":0.0,"publicationDate":"1998-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0966-8349(98)00053-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72110424","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1998-05-01DOI: 10.1016/S0966-8349(98)00058-8
Marvin B. Mandell
Emergency medical services (EMS) systems commonly consist of two types of providers, basic life support (BLS) units and advanced life support (ALS) units, with different capabilities. In contrast to other systems in which multiple vehicle responses are necessary, in EMS systems, the first-arriving unit can begin service prior to the arrival of the second-arriving unit. In this paper, a covering-type model for two-tiered EMS systems is considered. The model, which maximizes the expected number of calls for service that are served adequately, takes server availability into account through a two-dimensional queueing model. Illustrative computational results are provided.
{"title":"Covering models for two-tiered emergency medical services systems","authors":"Marvin B. Mandell","doi":"10.1016/S0966-8349(98)00058-8","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)00058-8","url":null,"abstract":"<div><p>Emergency medical services (EMS) systems commonly consist of two types of providers, basic life support (BLS) units and advanced life support (ALS) units, with different capabilities. In contrast to other systems in which multiple vehicle responses are necessary, in EMS systems, the first-arriving unit can begin service prior to the arrival of the second-arriving unit. In this paper, a covering-type model for two-tiered EMS systems is considered. The model, which maximizes the expected number of calls for service that are served adequately, takes server availability into account through a two-dimensional queueing model. Illustrative computational results are provided.</p></div>","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"6 1","pages":"Pages 355-368"},"PeriodicalIF":0.0,"publicationDate":"1998-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0966-8349(98)00058-8","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72110427","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1998-05-01DOI: 10.1016/S0966-8349(98)00051-5
Richard L. Church , Alan T. Murray , Andres Weintraub
Modeling to support forest management is a complex task. In the public sector, agencies such as the US Forest Service manage millions of acres of land. In the private sector, large forest product companies also own and manage millions of acres. Many countries, like Ireland and Finland, utilize large-scale models to optimize the present value of forest activities and outputs. Forest planning can be viewed as a multi-level management problem. The highest or strategic level involves identifying feasible outputs and goals for long-term operations over decades. The middle or tactical level of analysis is associated with determining specific levels of activities on large tracts of land. At the lowest or operational level, specific stands of timber are slated for harvesting, roads are scheduled to be built or improved, and harvesting systems are designed to minimize the cost of extracting trees across the terrain. Each level of analysis often involves numerous locational decisions. Our objective is to provide a review of forest modeling that highlights many of the locational issues found in forest management.
{"title":"Locational issues in forest management","authors":"Richard L. Church , Alan T. Murray , Andres Weintraub","doi":"10.1016/S0966-8349(98)00051-5","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)00051-5","url":null,"abstract":"<div><p>Modeling to support forest management is a complex task. In the public sector, agencies such as the US Forest Service manage millions of acres of land. In the private sector, large forest product companies also own and manage millions of acres. Many countries, like Ireland and Finland, utilize large-scale models to optimize the present value of forest activities and outputs. Forest planning can be viewed as a multi-level management problem. The highest or strategic level involves identifying feasible outputs and goals for long-term operations over decades. The middle or tactical level of analysis is associated with determining specific levels of activities on large tracts of land. At the lowest or operational level, specific stands of timber are slated for harvesting, roads are scheduled to be built or improved, and harvesting systems are designed to minimize the cost of extracting trees across the terrain. Each level of analysis often involves numerous locational decisions. Our objective is to provide a review of forest modeling that highlights many of the locational issues found in forest management.</p></div>","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"6 1","pages":"Pages 137-153"},"PeriodicalIF":0.0,"publicationDate":"1998-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0966-8349(98)00051-5","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72116185","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1998-05-01DOI: 10.1016/S0966-8349(98)00047-3
O. Berman, D. Krass
{"title":"Flow intercepting spatial interaction model: a new approach to optimal location of competitive facilities","authors":"O. Berman, D. Krass","doi":"10.1016/S0966-8349(98)00047-3","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)00047-3","url":null,"abstract":"","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"21 1","pages":"41-65"},"PeriodicalIF":0.0,"publicationDate":"1998-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74000670","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1998-05-01DOI: 10.1016/S0966-8349(98)00046-1
V. Filho, R. D. Galvão
{"title":"A tabu search heuristic for the concentrator location problem","authors":"V. Filho, R. D. Galvão","doi":"10.1016/S0966-8349(98)00046-1","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)00046-1","url":null,"abstract":"","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"26 1 1","pages":"189-209"},"PeriodicalIF":0.0,"publicationDate":"1998-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79900273","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1998-05-01DOI: 10.1016/S0966-8349(98)00044-8
Michael P. Johnson, A. P. Hurter
{"title":"An optimization model for location of subsidized housing in metropolitan areas","authors":"Michael P. Johnson, A. P. Hurter","doi":"10.1016/S0966-8349(98)00044-8","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)00044-8","url":null,"abstract":"","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"7 1","pages":"257-279"},"PeriodicalIF":0.0,"publicationDate":"1998-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84463114","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1998-05-01DOI: 10.1016/S0966-8349(98)00054-0
T. Drezner, Z. Drezner
{"title":"FACILITY LOCATION IN ANTICIPATION OF FUTURE COMPETITION.","authors":"T. Drezner, Z. Drezner","doi":"10.1016/S0966-8349(98)00054-0","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)00054-0","url":null,"abstract":"","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"26 1","pages":"155-173"},"PeriodicalIF":0.0,"publicationDate":"1998-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74556433","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1998-05-01DOI: 10.1016/S0966-8349(98)00060-6
Gülcan N. Yeşilkökçen, G. O. Wesolowsky
{"title":"A BRANCH-AND-BOUND ALGORITHM FOR THE SUPPLY CONNECTED LOCATION- ALLOCATION PROBLEM ON NETWORKS.","authors":"Gülcan N. Yeşilkökçen, G. O. Wesolowsky","doi":"10.1016/S0966-8349(98)00060-6","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)00060-6","url":null,"abstract":"","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"105 1","pages":"395-415"},"PeriodicalIF":0.0,"publicationDate":"1998-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80645153","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1998-05-01DOI: 10.1016/S0966-8349(98)00061-8
F. S. D. Gama, M.E. Captivo
{"title":"A HEURISTIC APPROACH FOR THE DISCRETE DYNAMIC LOCATION PROBLEM.","authors":"F. S. D. Gama, M.E. Captivo","doi":"10.1016/S0966-8349(98)00061-8","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)00061-8","url":null,"abstract":"","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"72 1","pages":"211-223"},"PeriodicalIF":0.0,"publicationDate":"1998-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86279172","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}