The Multiple Terminal Delivery Problem with Probabilistic Demands

Frank A. Tillman
Additional contact information
Frank A. Tillman: Department of Industrial Engineering, Kansas State University, Manhattan, Kansas

Transportation Science, 1969, vol. 3, issue 3, 192-204

Abstract: A heuristic approach is presented for solving the multiterminal delivery problem with constraints on the system and probabilistic demands. The algorithm is basically the same whether a commodity is being collected or delivered. This is a practical method that results in “near optimal” solutions to a difficult problem.

Date: 1969
References: Add references at CitEc
Citations: View citations in EconPapers (36)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.3.3.192 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:3:y:1969:i:3:p:192-204

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().