{"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":null,"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.0000,"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":"113","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Location Science","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0966834998000473","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 113
Abstract
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.