A New Formulation Approach for Location-Routing Problems
Networks and Spatial Economics
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/21241
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 arc-based product-flow (Arc-BPF) approach in the literature. We associate product amounts to the nodes of the network resulting in a node-based product-flow (Node-BPF) formulation. Our main objective is to develop LRP models with fewer constraints and variables, which can be solved more efficiently. To introduce the proposed approach, we reformulate a complex four-index Arc-BPF LRP model from the literature as a three-index Node-BPF model, which computationally outperforms the former. We then introduce a heuristic method. © 2012 Springer Science+Business Media, LLC.
- Research Paper 
Showing items related by title, author, creator and subject.
Çnar, Y.; Yaman H. (2011)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 ...
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 ...
Yilmaz E.; Elbasi S.; Ferhatosmanoglu H. (Association for Computing Machinery, 2017)Deriving meaningful insights from location data helps businesses make better decisions. One critical decision made by a business is choosing a location for its new facility. Optimal location queries ask for a location to ...