A New Formulation Approach for Location-Routing Problems
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/21241
Networks and Spatial Economics
- Research Paper 
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.
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 ...
Adaptive schemes for location update generation in execution location-dependent continuous queries Lam, K.-Y.; Ulusoy O. (2006)An important feature that is expected to be owned by today's mobile computing systems is the ability of processing location-dependent continuous queries on moving objects. The result of a location-dependent query depends ...
Calik H.; Tansel, B.C. (2013)We give a review of existing methods for solving the absolute and vertex restricted p-center problems on networks and propose a new integer programming formulation, a tightened version of this formulation and a new method ...