Heuristic solutions to robust variants of the minimum-cost integer flow problem

Marko Špoljarec () and Robert Manger ()
Additional contact information
Marko Špoljarec: Privredna banka Zagreb
Robert Manger: University of Zagreb

Journal of Heuristics, 2020, vol. 26, issue 4, No 4, 559 pages

Abstract: Abstract This paper deals with robust optimization applied to network flows. We consider two robust variants of the minimum-cost integer flow problem. Thereby, uncertainty in problem formulation is limited to arc costs and expressed by a finite set of explicitly given scenarios. It turns out that both problem variants are NP-hard. To solve the considered variants, we propose several heuristics based on local search or evolutionary computing. We also evaluate our heuristics experimentally on appropriate problem instances.

Keywords: Robust optimization; Network flow; Minimum-cost flow; Heuristic; Local search; Evolutionary computing (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10732-020-09441-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joheur:v:26:y:2020:i:4:d:10.1007_s10732-020-09441-1

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10732

DOI: 10.1007/s10732-020-09441-1

Access Statistics for this article

Journal of Heuristics is currently edited by Manuel Laguna

More articles in Journal of Heuristics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().