A Note on a Simple Dynamic Programming Approach to the Single-Sink, Fixed-Charge Transportation Problem

Authors:
Bahram Alidaee;Gary A. Kochenberger
Affiliations:
Hearin Center for Enterprise Science, School of Business, University of Mississippi, University, Mississippi 38677;Business School, University of Colorado at Denver, Denver, Colorado 80217
Venue:
Transportation Science
Year:
2005

Citing 0
Cited 5

An acquisition policy for a multi-supplier system with a finite-time horizon

Computers and Operations Research
Algorithms for solving the single-sink fixed-charge transportation problem

Computers and Operations Research
Analysis of some greedy algorithms for the single-sink fixed-charge transportation problem

Journal of Heuristics
The Uncapacitated Time-Space Fixed-Charge Network Flow Problem: An Empirical Investigation of Procedures for Arc Capacity Assignment

INFORMS Journal on Computing
Solving the Single-Sink, Fixed-Charge, Multiple-Choice Transportation Problem by Dynamic Programming

Transportation Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The single-sink, fixed-charge transportation problem has a variety of applications, including supplier selection, product distribution/fleet selection, and process selection. In this paper we present a dynamic programming algorithm for solving this important problem that is very easy to implement and that improves considerably in terms of computational attractiveness on the best methods in the literature.