Solving the edge-disjoint paths problem using a two-stage method

doi:10.1111/itor.12544

2018-04-30

PRE

Bernardo Martín *

Ángel Sánchez

Abraham Duarte

DOI：10.1111/itor.12544

原文链接

原文求助

摘要

En 中文

There exists a wide variety of network problems where several connection requests occur simultaneously. In general, each request is attended by finding a route in the network, where the origin and destination of such a route are those hosts that wish to establish a connection for information exchange. As is well documented in the related literature, the exchange of information through disjoint routes increases the effective bandwidth, velocity, and the probability of receiving the corresponding information. The definition of disjoint paths may refer to nodes, edges, or both. One of the most studied variants is the one where disjointness implies not to share edges. This optimization problem is usually known as the maximum edge-disjoint paths problem. This NP-hard optimization problem has applications in real-time communications, very large scale integration design, scheduling, bin packing, or load balancing. The proposed approach hybridizes an integer linear programming formulation of the problem with an evolutionary algorithm. Empirical results using 174 previously reported instances show that the proposed procedure compares favorably to previous metaheuristics for this problem. We confirm the significance of the results by conducting nonparametric statistical tests.

Keyword:

matheuristics

edge-disjoint paths

integer linear programming

evolutionary algorithms