A dynamic domain contraction algorithm for nonconvex piecewise linear network flow problems (Q5928210): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1023/a:1026502220076 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1591038343 / rank | |||
Normal rank |
Latest revision as of 11:34, 30 July 2024
scientific article; zbMATH DE number 1582185
Language | Label | Description | Also known as |
---|---|---|---|
English | A dynamic domain contraction algorithm for nonconvex piecewise linear network flow problems |
scientific article; zbMATH DE number 1582185 |
Statements
A dynamic domain contraction algorithm for nonconvex piecewise linear network flow problems (English)
0 references
22 July 2002
0 references
We consider the Nonconvex Piecewise Linear Network Flow Problem (NPLNFP) which is known to be NP-hard. Although exact methods such as branch and bound have been developed to solve the NPLNFP, their computational requirements increase exponentially with the size of the problem. Hence, an efficient heuristic approach is in need to solve large scale problems appearing in many practical applications including transportation, production-inventory management, supply chain, facility expansion and location decision, and logistics. In this paper, we present a new approach for solving the general NPLNFP in a continuous formulation by adapting a dynamic domain contraction. A dynamic domain contraction algorithm is presented and preliminary computational results on a wide range of test problems are reported. The results show that the proposed algorithm generates solutions within 0 to \(0.94\%\) of optimality in all instances that the exact solutions are available from a branch and bound method.
0 references
flow problems
0 references
algorithms
0 references
convergence
0 references