The vendor location problem
Computers and Operations Research
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/21710
The vendor location problem is the problem of locating a given number of vendors and determining the number of vehicles and the service zones necessary for each vendor to achieve at least a given profit. We consider two versions of the problem with different objectives: maximizing the total profit and maximizing the demand covered. The demand and profit generated by a demand point are functions of the distance to the vendor. We propose integer programming models for both versions of the vendor location problem. We then prove that both are strongly NP-hard and we derive several families of valid inequalities to strengthen our formulations. We report the outcomes of a computational study where we investigate the effect of valid inequalities in reducing the duality gaps and the solution times for the vendor location problem. © 2011 Elsevier Ltd. All rights reserved.
- Research Paper 
Showing items related by title, author, creator and subject.
A distance-limited continuous location-allocation problem for spatial planning of decentralized systems Gokbayrak K.; Kocaman A.S. (Elsevier Ltd, 2017)We introduce a new continuous location-allocation problem where the facilities have both a fixed opening cost and a coverage distance limitation. The problem has wide applications especially in the spatial planning of water ...
Mahmutogullari A.I.; Kara B.Y. (Elsevier, 2016)Hubs are consolidation and dissemination points in many-to-many flow networks. Hub location problem is to locate hubs among available nodes and allocate non-hub nodes to these hubs. The mainstream hub location studies focus ...
Toyoglu H.; Karasan O.E.; Kara, B.Y. (2012)A Location-Routing Problem (LRP) combines two difficult problems, facility location and vehicle routing, and as such it is inherently hard to solve. In this paper, we propose a different formulation approach than the common ...