Back to search

UNF Digital Commons

An Efficient Implementation of the Transportation Problem

Abstract

dc:description.abstract

The transportation problem is a special type of linear program in which the objective is to minimize the total cost of shipping a single commodity from a number of sources (m) to a number of destinations or sinks (n). Because of the special structure of the transportation problem, a special algorithm can be designed to find an optimal solution efficiently. Due to the large amount of information in the problem, judicious storage and management of the data are essential requirements of any viable implementation of the transportation algorithm. Using sparse matrix techniques to store the solution array, and a rooted tree as the labeling method for handling the associated information provides a viable method to solve the transportation problem. A difficult test problem was designed to test the computer program and demonstrate its efficiency. We were able to successfully implement the transportation algorithm for problems involving one million possible shipping routes. The FORTRAN code developed is included, as well as the results of several runs of the test problem.

Degree

thesis:*
Name thesis:degree_name
Master of Science in Mathematical Sciences (MS)
Discipline thesis:degree_discipline
Mathematics & Statistics
Grantor dc:publisher
UNF Digital Commons

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Sustarsic, Alissa Michele
Contributors dc:contributor
  • Dr. Adel Boules
  • Dr. Champak Panchal
  • Dr. Mei-Qin Zhan

Subjects

dc:subject × 4

Rights

dc:rights

Identifiers

dc:identifier.*
Repository record dc:identifier
https://digitalcommons.unf.edu/etd/81

Chain of custody

source
Harvested from
University of North Florida
Base URL
digitalcommons.unf.edu/do/oai/
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
citation

Sustarsic, Alissa Michele. An Efficient Implementation of the Transportation Problem. UNF Digital Commons, https://digitalcommons.unf.edu/etd/81