Pub Date : 1998-05-01DOI: 10.1016/S0966-8349(98)00050-3
J. Brimberg, Henrik Juel
{"title":"A minisum model with forbidden regions for locating a semi-desirable facility in the plane","authors":"J. 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":"","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"12 1","pages":"109-120"},"PeriodicalIF":0.0,"publicationDate":"1998-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80440357","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)00042-4
J. G. Klincewicz
{"title":"HUB LOCATION IN BACKBONE/TRIBUTARY NETWORK DESIGN: A REVIEW","authors":"J. G. Klincewicz","doi":"10.1016/S0966-8349(98)00042-4","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)00042-4","url":null,"abstract":"","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"27 1","pages":"307-335"},"PeriodicalIF":0.0,"publicationDate":"1998-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87007075","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
Francisco Saldanha da Gama, Maria Eugénia Captivo
In this paper a two-phase heuristic approach for the discrete dynamic location problem with establishment and removal costs is presented. The first phase consists of a drop procedure. In the second phase, a local search is performed as an attempt to correct bad decisions that might have been made. Computational tests with random generated data are presented in order to evaluate the heuristic performance, and compare it with a well-known procedure already in existence for solving the problem. Different alternatives analyzed when developing the heuristic are also mentioned. Finally, CPLEX execution times for solving the problem are presented.
{"title":"A heuristic approach for the discrete dynamic location problem","authors":"Francisco Saldanha da Gama, Maria Eugénia Captivo","doi":"10.1016/S0966-8349(98)00061-8","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)00061-8","url":null,"abstract":"<div><p>In this paper a two-phase heuristic approach for the discrete dynamic location problem with establishment and removal costs is presented. The first phase consists of a drop procedure. In the second phase, a local search is performed as an attempt to correct bad decisions that might have been made. Computational tests with random generated data are presented in order to evaluate the heuristic performance, and compare it with a well-known procedure already in existence for solving the problem. Different alternatives analyzed when developing the heuristic are also mentioned. Finally, CPLEX execution times for solving the problem are presented.</p></div>","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"6 1","pages":"Pages 211-223"},"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)00061-8","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72110425","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)00056-4
H. A. Eiselt, G. Laporte
{"title":"Demand allocation functions","authors":"H. A. Eiselt, G. Laporte","doi":"10.1016/S0966-8349(98)00056-4","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)00056-4","url":null,"abstract":"","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"2 1","pages":"175-187"},"PeriodicalIF":0.0,"publicationDate":"1998-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82110767","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)00064-3
G. Wanka
{"title":"A new theorem of the alternative – a location approach","authors":"G. Wanka","doi":"10.1016/S0966-8349(98)00064-3","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)00064-3","url":null,"abstract":"","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"36 1","pages":"417-425"},"PeriodicalIF":0.0,"publicationDate":"1998-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82504576","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)00062-X
Claudio Thombas Bornstein, Hugo Bravo Azlan
{"title":"The use of reduction tests and simulated annealing for the capacitated plant location problem","authors":"Claudio Thombas Bornstein, Hugo Bravo Azlan","doi":"10.1016/S0966-8349(98)00062-X","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)00062-X","url":null,"abstract":"","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"121 1","pages":"67-81"},"PeriodicalIF":0.0,"publicationDate":"1998-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86119752","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)00059-X
Burçin Bozkaya , Barbaros Tansel
We consider the absolute p-center problem on a general network and propose a spanning tree approach which is motivated by the fact that the problem is NP-hard on general networks but solvable in polynomial time on trees. We first prove that every connected network possesses a spanning tree whose p-center solution is also a solution for the network under consideration. Then we propose two classes of spanning trees that are shortest path trees rooted at certain points of the network. We give an experimental study, based on 1440 instances, to test how often these classes of trees include an optimizing tree. We report our computational results on the performance of both types of trees.
{"title":"A spanning tree approach to the absolute p-center problem","authors":"Burçin Bozkaya , Barbaros Tansel","doi":"10.1016/S0966-8349(98)00059-X","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)00059-X","url":null,"abstract":"<div><p>We consider the absolute <em>p</em>-center problem on a general network and propose a spanning tree approach which is motivated by the fact that the problem is NP-hard on general networks but solvable in polynomial time on trees. We first prove that every connected network possesses a spanning tree whose <em>p</em>-center solution is also a solution for the network under consideration. Then we propose two classes of spanning trees that are shortest path trees rooted at certain points of the network. We give an experimental study, based on 1440 instances, to test how often these classes of trees include an optimizing tree. We report our computational results on the performance of both types of trees.</p></div>","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"6 1","pages":"Pages 83-107"},"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)00059-X","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72110415","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
Oded Berman, Dmitry Krass
In this paper we propose a flexible new model for the location of competitive facilities that may derive their demand for service from both special-purpose purchase trips by their customers and from “intercepting” customers passing by a facility while en route to another destination on the network. Our model combines the features of the spatial interaction and flow interception models. An efficient heuristic procedure is developed, with worst case analysis provided. We also develop a tight upper bound and a branch-and-bound scheme for our model. Results of a set of computational experiments are presented.
{"title":"Flow intercepting spatial interaction model: a new approach to optimal location of competitive facilities","authors":"Oded Berman, Dmitry Krass","doi":"10.1016/S0966-8349(98)00047-3","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)00047-3","url":null,"abstract":"<div><p>In this paper we propose a flexible new model for the location of competitive facilities that may derive their demand for service from both special-purpose purchase trips by their customers and from “intercepting” customers passing by a facility while en route to another destination on the network. Our model combines the features of the spatial interaction and flow interception models. An efficient heuristic procedure is developed, with worst case analysis provided. We also develop a tight upper bound and a branch-and-bound scheme for our model. Results of a set of computational experiments are presented.</p></div>","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"6 1","pages":"Pages 41-65"},"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)00047-3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72110418","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)00045-X
G. Andersson, R. L. Francis, Tomas Normark, M. Rayco
{"title":"AGGREGATION METHOD EXPERIMENTATION FOR LARGE-SCALE NETWORK LOCATION PROBLEMS","authors":"G. Andersson, R. L. Francis, Tomas Normark, M. Rayco","doi":"10.1016/S0966-8349(98)00045-X","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)00045-X","url":null,"abstract":"","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"38 1","pages":"25-39"},"PeriodicalIF":0.0,"publicationDate":"1998-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76339187","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}
扫码关注我们
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号