Wyniki wyszukiwania - BazTech

Ograniczanie wyników

1 International Journal of Electronics and Telecommunications

1 2025

Powiadomienia systemowe

Sesja wygasła!

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: flow optimization

Sortuj według:

Ogranicz wyniki do:

Generalized Benders Decomposition to solve a nonlinear routing problem with queueing delay goal function

Kozerski Kacper, Karbowski Andrzej

International Journal of Electronics and Telecommunications

2025

Vol. 71, No. 4

We address the multicommodity flow problem with a nonlinear goal function modeling queueing delay. It is well-known that linear programming solvers perform better than those used for nonlinear programming. We can leverage their performance by employing the Generalized Benders Decomposition (GBD) to partition the problem into master and primal subproblems. We prove that in the case of multiple subproblems, which is true in our case, we can split both the optimality and feasibility cuts and add them independently. Moreover, we extended a known proof of convergence to enable a wider range of problems to be solved using GBD. We use the split cuts technique to precompute feasibility cuts and analytically solve the subproblems to omit the use of nonlinear optimization software. Furthermore, we explore the possibilities of starting point selection through linear and quadratic approximation. We carry out tests on a classical network example to show that GBD can sometimes outperform nonlinear solvers, and also that quadratic approximation for starting point selection can provide strictly better solution times, dominating commercial solvers.