Řešení problému celočíselného maximálního víceproduktového toku v síti pomocí simulovaného žíhání

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F04%3APU46995" target="_blank" >RIV/00216305:26210/04:PU46995 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Solving the Integer Maximal Multicommodity Flow Problem Using Simulated Annealing

Popis výsledku v původním jazyce

In this paper the Integer Maximal Multicommodity Flow Problem is discussed. Multicommodity flow problems have many specific formulations depending on the constraints defined resulting in various applications in transportation, distribution and telecommunications. Since its integer version belongs to the class of NP-hard combinatorial problems, for large scale instances, it must be solved by approximation or heuristic techniques. We present a stochastic heuristic approach based on a simulated annealing aalgorithm. All evaluations of the objective function in this algorithm are provided by an allocation procedure. Since the allocation of the edge capacities among the commodities and the corresponding combined maximal flow depend on the order in which thecommodities are selected, the neighbouring mechanism in simulated annealing is set to generate permutations of commodities. Computational results show that, for suitable parameter settings presented in the paper, this approach is able to

Název v anglickém jazyce

Solving the Integer Maximal Multicommodity Flow Problem Using Simulated Annealing

Popis výsledku anglicky

In this paper the Integer Maximal Multicommodity Flow Problem is discussed. Multicommodity flow problems have many specific formulations depending on the constraints defined resulting in various applications in transportation, distribution and telecommunications. Since its integer version belongs to the class of NP-hard combinatorial problems, for large scale instances, it must be solved by approximation or heuristic techniques. We present a stochastic heuristic approach based on a simulated annealing aalgorithm. All evaluations of the objective function in this algorithm are provided by an allocation procedure. Since the allocation of the edge capacities among the commodities and the corresponding combined maximal flow depend on the order in which thecommodities are selected, the neighbouring mechanism in simulated annealing is set to generate permutations of commodities. Computational results show that, for suitable parameter settings presented in the paper, this approach is able to

Druh

C - Kapitola v odborné knize

CEP obor

BB - Aplikovaná statistika, operační výzkum

OECD FORD obor

—

Projekt

—

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2004

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název knihy nebo sborníku

DAAAM International Scientific Book 2004

ISBN

3-901509-38-0

Počet stran výsledku

10

Strana od-do

553-562

Počet stran knihy

—

Název nakladatele

DAAAM International Wien

Místo vydání

Wien

Kód UT WoS kapitoly

—