Titlebook: Meta-Heuristics; Advances and Trends Stefan Vo?,Silvano Martello,Catherine Roucairol Book 1999 Springer Science+Business Media New York 19

climax

New Heuristic Algorithms for the Crew Scheduling Problem for an urban transport problem, formulated as the minimal number of duties necessary to cover a predefined timetable under contractual rules which excludes the possibility of resorting to extra-time. The initial solution is obtained with a run-cutting algorithm. Two algorithms are proposed to impro

Hdl348

Enhanced Continuous Tabu Search: An Algorithm for Optimizing Multiminima Functionsof combinatorial Tabu Search which aims to follow, as close as possible, Glover’s basic approach. In order to cover a wide domain of possible solutions, our algorithm first performs diversification: it locates the most promising areas, by fitting the size of the neighborhood structure to the objecti

EXUDE

Delectable

Tabu Search for Graph Coloring, T-Colorings and Set T-Coloringstes important features such as greedy initialization, solution re-generation, dynamic tabu tenure, incremental evaluation of solutions and constraint handling techniques. Empirical comparisons show that this algorithm approaches the best coloring algorithms and outperforms some hybrid algorithms on

flutter

Tabu Search with Critical Event Memory: An Enhanced Application for Binary Quadratic Programsknown difficult problems. Organized chiefly to employ strategic oscillation, based on critical event memory, the method has not only quickly found optimal solutions in those cases where they are known, but has also found high quality (perhaps optimal) solutions to new test problems that are larger t

農(nóng)學(xué)

豎琴

嘲笑

牲畜欄

Genteel