Upper bounds minimum-cost for single-source uncapacitated concave network flow problems

• Type: Article in International Scientific Journal
• Date: 2003

Authors

Dalila B.M.M. Fontes (Author) FEP; Hadjiconstantinou, E (Author) Other; Christofides, N (Author) Other

Journal

Title: Networks

Vol. 41

Pages: 221-228

ISSN: 0028-3045

Publisher: Wiley-Blackwell

Indexing

ISI Web of Knowledge - 12 Citations

Scopus - 14 Citations

Other information

Authenticus ID: P-000-G52

DOI: 10.1002/net.10076

Abstract (EN): In this paper, we describe a heuristic algorithm based on local search for the Single-Source Uncapacitated (SSU) concave Minimum-Cost Network Flow Problem (MCNFP). We present a new technique for creating different and informed initial solutions to restart the local search, thereby improving the quality of the resulting feasible solutions (upper bounds). Computational results on different classes of test problems indicate the effectiveness of the proposed method in generating basic feasible solutions for the SSU concave MCNFP very near to a global optimum. A maximum upper bound percentage error of 0.07% is reported for all problem instances for which an optimal solution has been found by a branch-and-bound method. (C) 2003 Wiley Periodicals, Inc.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 8