Tabu search for the cyclic bandwidth problem. In this paper a new carefully devised Tabu Search algorithm, called TScb, for finding near-optimal solutions for the CB problem is proposed. Different possibilities for its key components and input parameter values were carefully analyzed and tuned, in order to find the combination of them offering the best quality solutions to the problem at a reasonable computational effort.
Keywords for this software
References in zbMATH (referenced in 2 articles , 1 standard article )
Showing results 1 to 2 of 2.
- Sinnl, Markus: Algorithmic expedients for the (S)-labeling problem (2019)
- Rodriguez-Tello, Eduardo; Romero-Monsivais, Hillel; Ramirez-Torres, Gabriel; Lardeux, Frédéric: Tabu search for the cyclic bandwidth problem (2015)