Probabilistic tree-based representation for solving minimum cost integer flow problems with nonlinear non-convex cost functions

doi:10.1016/j.asoc.2019.105951

2020-01-01

Behrooz Ghasemishabankareh *

李小冬 (Xiaodong Li)

Melih Özlen

Frank Neumann

DOI：10.1016/j.asoc.2019.105951

原文链接

查看原文

摘要

En 中文

The minimum cost flow problem (MCFP) is the most generic variation of the network flow problem which aims to transfer a commodity throughout the network to satisfy demands. The problem size (in terms of the number of nodes and arcs) and the shape of the cost function are the most critical factors when considering MCFPs. Existing mathematical programming techniques often assume the cost functions to be linear or convex. Unfortunately, the linearity and convexity assumptions are too restrictive for modelling many real-world scenarios. In addition, many real-world MCFPs are large-scale, with networks having a large number of nodes and arcs. In this paper, we propose a probabilistic tree-based genetic algorithm (PTbGA) for solving large-scale minimum cost integer flow problems with nonlinear non-convex cost functions. We first compare this probabilistic tree-based representation scheme with the priority-based representation scheme, which is the most commonly-used representation for solving MCFPs. We then compare the performance of PTbGA with that of the priority-based genetic algorithm (PrGA), and two state-of-the-art mathematical solvers on a set of MCFP instances. Our experimental results demonstrate the superiority and efficiency of PTbGA in dealing with large-sized MCFPs, as compared to the PrGA method and the mathematical solvers. (C) 2019 Elsevier B.V. All rights reserved.

Keyword:

Minimum cost flow problem

Genetic algorithm

Representation scheme

Mixed integer nonlinear programming

Taguchi experimental design