A heuristic approach for large scale discrete stochastic transportation-location problems

12Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

An effective heuristic for determining plant locations and shipments to customers is described. It is assumed that there are a discrete number of possible locations and that the demand at each destination is a random variable. Thus the problem is to minimize expected holding and shortage costs, in addition to linear shipping costs and fixed costs of construction. The algorithm uses dual variables to guide the determination of whether each plant should be opened or not. © 1977.

Cite

CITATION STYLE

APA

LeBlanc, L. J. (1977). A heuristic approach for large scale discrete stochastic transportation-location problems. Computers and Mathematics with Applications, 3(2), 87–94. https://doi.org/10.1016/0898-1221(77)90060-8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free