The Burst Assembly process in Optical Burst Switching networks is a NP-complete, Non deterministic Polynomial Time problem because it prevents a trivial solution being found by deterministic algorithms, but allows approximate to optimal solutions to be found. In this paper, we put forward a cognitive method based on a hybrid metaheuristic for burst assembly problems in Optical Burst Switching/Dense Wavelength Division Multiplexing networks and analyze its performance in terms of blocking probability and end-to-end delay by carrying out a comparison with a network that uses only burst assembly algorithms defined by Optical Burst Switching network theory.