![Heuristic and lower bound for a stochastic location-routing problem [An article from: European Journal of Operational Research]](https://www.ebooknetworking.net/books/B00/0PD/bigB000PDSHC0.jpg)
Heuristic and lower bound for a stochastic location-routing problem [An article from: European Journal of Operational Research]
Book Details
PublisherElsevier
ISBN / ASINB000PDSHC0
ISBN-13978B000PDSHC2
MarketplaceUnited Kingdom 🇬🇧
Description
This digital document is a journal article from European Journal of Operational Research, published by Elsevier in 2007. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.
Description:
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.
Description:
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.
