The minimum routing and wavelength assignment (min-RWA) problem is a classic and challenging NP-hard combinatorial optimization problem which aims to reduce the required wavelengths in wavelength-division multiplexing optical networks. In order to tackle this problem, we present a...

This paper presents two path relinking algorithms to solve the unconstrained binary quadratic programming (UBQP) problem. One is based on a greedy strategy to generate the relinking path from the initial solution to the guiding solution and the other operates in a random way. We show extensive...