A Pseudo-Polynomial Primal-Dual Algorithm for Globally Solving a Production-Transportation Problem

In this paper, we propose a primal-dual algorithm for solving a class ofproduction-transportation problems. Among m(≥ 2) sources two factoriesexist, which produce given goods at some concave cost and supply them to nterminals. We show that one can globally minimize the total cost ofproduction and tr...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of global optimization Ročník 11; číslo 2; s. 163 - 180
Hlavní autori: Kuno, Takahito, Utsunomiya, Takahiro
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Dordrecht Springer Nature B.V 01.09.1997
Predmet:
Algorithms
Factories
Network management systems
Optimization
Warehouses
ISSN:0925-5001, 1573-2916
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In this paper, we propose a primal-dual algorithm for solving a class ofproduction-transportation problems. Among m(≥ 2) sources two factoriesexist, which produce given goods at some concave cost and supply them to nterminals. We show that one can globally minimize the total cost ofproduction and transportation by solving a Hitchcock transportation problemwith m sources and n terminals and a minimum linear-cost flow problem withm+n nodes. The number of arithmetic operations required by the algorithm ispseudo-polynomial in the problem input length.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0925-5001
1573-2916
DOI:10.1023/A:1008278625289