A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf
.
RAMP: A New Metaheuristic Framework for Combinatorial Optimization
[chapter]
Operations Research/Computer Science Interfaces Series
We propose a new metaheuristic framework embodied in two approaches, Relaxation Adaptive Memory Programming (RAMP) and its primal-dual extension (PD-RAMP). The RAMP method, at the first level, operates by combining fundamental principles of mathematical relaxation with those of adaptive memory programming, as expressed in tabu search. The extended PD-RAMP method, at the second level, integrates the RAMP approach with other more advanced strategies. We identify specific combinations of such
doi:10.1007/0-387-23667-8_20
fatcat:de5jebzn3vhitmpoye37z5gtiq