A fast heuristic for genetic algorithms in link weight optimization

Abstract

Genetic algorithms are a useful tool for link weight optimization in intra-domain traffic engineering where the maximum link load is to be minimized. As a local heuristic, the weight of the maximum loaded link is increased to speed up the search for a near-optimal solution. We show that implementing this heuristic as directed mutation outperforms an implementation as an inner loop in both quality of the result and number of calls to the objective function when used together with caching. Optimal mutation rates result in surprisingly high cache hit ratios.

Original document

The different versions of the original document can be found in:

• http://publica.fraunhofer.de/documents/2004965966.html

• http://link.springer.com/content/pdf/10.1007/978-3-540-30193-6_15,

http://dx.doi.org/10.1007/978-3-540-30193-6_15

• https://link.springer.com/chapter/10.1007/978-3-540-30193-6_15,

https://core.ac.uk/display/57008453,

https://dblp.uni-trier.de/db/conf/qofis/qofis2004.html#ReichertM04,

https://rd.springer.com/chapter/10.1007/978-3-540-30193-6_15,

http://qofis.ccaba.upc.edu/pdf/fast-heuristic.pdf,

https://academic.microsoft.com/#/detail/1601742074