Complexity of strict robust integer minimum cost flow problems: An overview and further results
Introduction
The underlying structure of many real world problems forms a graph, for example supply chain optimization, designing IT networks or evacuation planning. In these problems different commodities, information or persons need to be moved across the graph. These movements are usually summarized as flows. Many of these real world problems can be modeled and solved as a minimum cost flow (MCF) problem. The goal of the MCF problem is to find a flow through a graph with minimal costs. The classic version of the minimum cost flow problem is well studied and can be solved very efficiently (Ahuja, Magnanti, Orlin, 1993, Goldberg, 1990). However, for some problems it is necessary to add additional constraints to the model to make it applicable for real world problems. An important requirement is to restrict the flow to be integral since the moved commodities may be indivisible, for example, for evacuation planning if buses have to be moved through the network (Cova, Johnson, 2003, Hamacher, Tjandra, Hoppe, Tardos, 1994).
The interest in robust optimization has been constantly growing during the last two decades. The seminal papers of Ben-Tal and A. (2000); Ben-Tal, Nemirovski, 1998, Ben-Tal, Nemirovski, 1999 and Bertsimas, Sim, 2003, Bertsimas, Sim, 2004 have built the foundation for the research of robust optimization. The goal of robust optimization is to find mathematical models which are applicable even if the input data is affected by uncertainty. Since uncertainty can affect the problem in many different ways, different concepts have been developed to handle the circumstances in question (Ben-Tal, Bertsimas, Brown, 2010, Ben-Tal, Goryashko, Guslitzer, Nemirovski, 2004, Liebchen, Lübbecke, Möhring, Stiller, 2009). In almost all concepts, one defines a so called uncertainty set which resembles the parameter realizations which have to be taken into account by the robust model. In the classic version of robust optimization, it is required that the solution is feasible for all realizations of the uncertainty set. Further, the value of a solution is defined as the worst case performance guarantee among all realizations from the uncertainty set.
Robust optimization has already been applied in evacuation planning. Different concepts and uncertainty sets have been considered to approach the modeling of evacuation. Do Chung et al. (2011) and Yao et al. (2009) discuss demand uncertainty where the number of people is not known exactly. Demand uncertainty is also assumed in Goerigk and Grün (2014). In this paper, the authors do not consider individual evacuation but an evacuation by public transportation by using buses. Besides demand, uncertainty can also occur in other parameters like travel time or capacity. In Boginski et al. (2009) they consider arc failure in a network, i.e., when the capacity of an arc becomes zero. Uncertain travel times are dealt with in Goerigk et al. (2015) again with focus on bus evacuation. In general, evacuation planning is modeled by the usage of dynamic network flows. It is well known that for even for dynamic network flows, static network flow problem are useful, in particular the MCF (see Ford Jr. and Fulkerson (1958)).
Since MCF problems can be used to define various real world problems and most of these problems are affected by uncertainty, it is not surprising that different robust versions of the MCF problem have already been studied. In Bertsimas et al. (2013), the problem is studied in a variant in which arcs may fail. It is shown that the maximum flow problem, which is closely related to the MCF, is still tractable in this setting. However, if one searches for an adaptive solution, the problem becomes -complete. Furthermore, in Bertsimas and Sim (2003), the MCF problem is studied for the case the cost vector is affected by uncertainty. The authors use the bounded uncertainty sets introduced in Bertsimas and Sim (2004) and define a combinatorial, polynomial algorithm for the resulting problem.
In our paper, we study a similar problem. Instead of the bounded uncertainty set, we assume to have a finite uncertainty set. Especially in the context of evacuation planning considering a finite uncertainty set does make sense. For instance, different and finitely many flood scenarios lead to various conditions on the streets and thus, on the underlying mathematical network. Those scenarios, will be use in the following. Moreover, we require the flow to be integral which makes the problem far more challenging from a computational point of view. As mentioned before, especially for evacuation planning, the assumption of integral flows is important. In general, people, cars and buses cannot be separated and must be considered as a unit. Whereas for the continuous minimum cost flow problem (Bertsimas and Sim, 2003) have shown that this problem can be solved in polynomial time, the integer version is known to be NP-hard (see Yu and Yang (1998) and Kouvelis and Yu (1997)). In this paper we focus in the complexity results of the min-max IMCF. We distinguish further between strongly and weakly NP-hardness for different problem variants. Some of those results are known from literature and other we contribute. In particular, we present two pseudopolynomial algorithms for the min-max IMCF on acyclic and series-parallel graphs, respectively. However, there are still some open problems in this field as we will see in the following sections.
The paper is structured as follows. The definitions and notations used throughout the paper are defined in Section 2. In Section 3, we give an overview on already existing complexity results concerning the min-max integer minimum cost flow problem. Moreover, we extend those results by discussing further special cases on the underlying graph structure. Here, a focus is placed on acyclic graphs and how to solve robust integer MCFs on those kind of networks with bounded number of scenarios and a bounded flow value which has to be sent over the network. For series parallel graphs with unbounded number of scenarios, we show that this problem is still strongly NP-hard. Moreover, we develop a pseudopolynomial procedure also for a bounded scenario number but this time we allow the flow value to be unbounded. A combinatorial algorithm for acyclic graphs, whose idea is already discussed in Section 3, is continued and further improved in Section 4. To verify those improvements, we present computational experiments in Section 5. We summarize the paper in Section 6 and pose further research questions.
Section snippets
Notations and definitions
The classic integer minimum cost flow (IMCF) problem is defined by a network with node set V and arc set A of the underlying graph, a cost vector a capacity vector and a supply/demand vector . The problem can be represented by the following integer programming (IP) formulation.where () denotes the set of all outgoing (incoming) edges of node v. Without loss of generality one can restrict this
Complexity of the min-max IMCF
In this section, we study the computational complexity of the min-max IMCF problem. We analyze in detail different variants of the problem depending on the flow value F, the number of scenarios K, and the class of the underlying graph. First, we present a general overview of the known results from the literature. Most variants are easily seen to be weakly -complete. However, it is an interesting question to determine if these problems are strongly -complete or if pseudo-polynomial
Combinatorial algorithms for the min-max IMCF problem on acyclic graphs
In this section, we consider the algorithmic implications of the reformulation procedure presented in Section 3.2. We show how the theoretic reformulation scheme can be used to define efficient algorithms for solving the min-max IMCF problem on acyclic graphs.
In Section 3.2.1, we have seen that it is possible to deduce an optimal flow f in G from an optimal path pF in GF. However, since GF might become quite large we show next that it is not necessary to build the complete network for
Computational results
Both, Algorithm 3 and 6 can be used for solving (2). Conceptually, both algorithms are similar. However, Algorithm 6 is closely tailored for the min-max problem. By using the A*-search and introducing a lower bound on each label we can apply a different stopping criterion on the while-loop, which should lead to an earlier termination of the procedure. By the introduction of UB, we safe some computation time by excluding needless labels a priori.
We have implemented both algorithms to compare
Conclusions
In this paper, we give an overview on some complexity results of the min-max IMCF. Even though we could fill some gaps in Table 1 by proving strongly NP-hardness or developing a pseudo-polynomial algorithm, there still remain some open problems for general and also acyclic graphs that need to be solved. Our main contribution is the development of pseudo-polynomial algorithms for series-parallel and acyclic networks. On series-parallel networks, we exploit the recursive structure of those graphs
Acknowledgments
The authors would like to thank the anonymous reviewers for their insightful comments and suggestions, Partially supported by the Federal Ministry of Education and Research, project RobEZiS, grant number 13N13198.
References (40)
- et al.
Min max and min max regret versions of combinatorial optimization problems: a survey
Eur. J. Oper. Res.
(2009) - et al.
Robust solutions of uncertain linear programs
Oper. Res. Lett.
(1999) - et al.
A bicriteria approach to robust optimization
Comput. Oper. Res.
(2016) - et al.
A network flow model for lane-based evacuation routing
Transp. Res. Part A Policy Pract.
(2003) Parallel recognition of series-parallel graphs
Inf. Comput.
(1992)- et al.
A two-stage robustness approach to evacuation planning with buses
Transp. Res. Part B Methodol.
(2015) - et al.
An aggregate label setting policy for the multi-objective shortest path problem
Eur. J. Oper. Res.
(2010) On a multicriteria shortest path problem
Eur. J. Oper. Res.
(1984)- et al.
A comparison of solution strategies for bi-objective shortest path problems
Comput. Oper. Res.
(2009) - et al.
On the robust shortest path problem
Comput. Oper. Res.
(1998)
Network Flozws: Theory, Algorithms, and Applications
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
A. robust solutions of linear programming problems contaminated with uncertain data
Math Prog.
A soft robust model for optimization under ambiguity
Oper. Res.
Adjustable robust solutions of uncertain linear programs
Math. Prog.
Robust convex optimization
Math. Oper. Res.
Robust and adaptive network flows
Oper. Res
Robust discrete optimization and network flows
Math Prog.
The price of robustness
Oper. Res.
Polynomial-time identification of robust network flows under uncertain arc failures
Optim. Lett.
Cited by (5)
Two-stage matching-and-scheduling algorithm for real-time private parking-sharing programs
2021, Computers and Operations ResearchA Rasch model analysis of poster-based learning on network flow problem to students' visual communication ability
2021, AIP Conference ProceedingsFlow Optimization in Dynamic Networks on Time Scales
2021, Journal of Physics: Conference SeriesBiobjective Scheduling for Joint Parallel Machines with Sequence-Dependent Setup by Taking Pareto-Based Approach
2021, Modelling and Simulation in EngineeringAn Efficient Algorithm for Solving Minimum Cost Flow Problem with Complementarity Slack Conditions
2020, Mathematical Problems in Engineering