HEURISTIC APPROACH FOR LARGE SCALE DISCRETE STOCHASTIC TRANSPORTATION-LOCATION PROBLEMS

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.

• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/issn/08981221
• Corporate Authors:

  Pergamon Press, Incorporated

  Maxwell House, Fairview Park
  Elmsford, NY  United States  10523
• Authors:
  • LeBlanc, L J
• Publication Date: 1977

Media Info

• Features: References;
• Pagination: p. 87-94
• Serial:
  • Computers and Mathematics with Applications
  • Volume: 3
  • Issue Number: 2
  • Publisher: Elsevier
  • ISSN: 0898-1221

Subject/Index Terms

• TRT Terms: Cost finding; Decision making; Logistics; Marketing; Mathematical models; Physical distribution; Traffic managers; Warehouses
• Uncontrolled Terms: Shippers
• Subject Areas: Finance; Freight Transportation; Railroads; Terminals and Facilities;

Filing Info

• Accession Number: 00167939
• Record Type: Publication
• Source Agency: Engineering Index
• Files: TRIS
• Created Date: Dec 27 1977 12:00AM