Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 179, Issue 3, Pages 940-955Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ejor.2005.04.051
Keywords
location-routing; stochastic programming
Ask authors/readers for more resources
In this article a stochastic location-routing problem is defined and cast as a two-stage model. In a first stage the set of plants and a family of routes are determined; in a second stage a recourse action is applied to adapt these routes to the actual set of customers to visit, once they are known. A two-phase heuristic is developed. An initial feasible solution is built by solving a sequence of subproblems, and an improvement phase is then applied. A lower bound based on bounding separately different parts of the cost of any feasible solution is also developed. Computational results are reported. (c) 2006 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available