RAMP: A New Metaheuristic Framework for Combinatorial Optimization

摘要: 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 adaptive memory programming, as expressed tabu search. extended PD- second integrates approach other more advanced strategies. identify specific combinations such strategies both levels, based on Lagrangean surrogate constraint dual side scatter search path relinking primal side, each instance joined appropriate guidance from processes. invites use alternative procedures for components, including forms relaxations evolutionary approaches genetic algorithms metaphors nature.