The Iterative Algorithm for Solving a 'Transportation Problem Involving Source-Location Optimization'.
Themis optimization research program,
TEXAS A AND M UNIV COLLEGE STATION INST OF STATISTICS
Pagination or Media Count:
The report is a documentation of a computer program implementing the iterative algorithm described in Technical Report No. 42, A Transportation Problem Involving Source-Location Optimization. The general source-location problem under consideration is how to supply J destinations with D sub 1, D sub 2, ..., D sub J units from K possible sources at a minimum cost when the K sources have capacities B sub 1, B sub 2, ..., B sub K, and any subset of the K sources can be located at any one of I locations. A minimal cost solution involves the specification of each sources location and the allocation of the demands D sub 1, D sub 2, ..., D sub J among the sources. The theoretical characteristics and practical performance of the iterative algorithm make the algorithm an attractive method for determining near optimal solutions to such source-location problems. Author
- Operations Research
- Computer Programming and Software