Home // ICN 2012, The Eleventh International Conference on Networks // View article

Comparison of Heuristic Methods Applied to Optimization of Computer Networks

Authors:
Tomasz Miksa
Leszek Koszalka
Andrzej Kasprzak

Keywords: computer networks; heuristic algorithm; simulated annealing; flow assignment; simulation

Abstract:
This paper presents an attempt to solve Capacity and Flow Assignment (CFA) problem, which is NP-complete. Meta-heuristic and heuristic algorithms are invented in order to find not only feasible but also effective solution. A set of test network instances, with provided dual bounds as a reference, is used to: tune algorithms’ parameters, conduct experiments and assess results. Final results provide statistical measures derived from experiments and imply which of proposed algorithms provides better solutions. However, the two created algorithms seem to be promising.

Pages: 34 to 38

Copyright: Copyright (c) IARIA, 2012

Publication date: February 29, 2012

Published in: conference

ISSN: 2308-4413

ISBN: 978-1-61208-183-0

Location: Saint Gilles, Reunion

Dates: from February 29, 2012 to March 5, 2012