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 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 identity specific combinations of such strategies at both levels, based on Lagrangean and surrogate constraint relaxation on the dual side and on scatter search and path relinking on the primal side, in each instance joined with appropriate guidance from adaptive memory processes. The framework invites the use of alternative procedures for both its primal and dual components, including other forms of relaxations and evolutionary approaches such as genetic algorithms and other procedures based on metaphors of nature.
Keywords for this software
References in zbMATH (referenced in 7 articles , 1 standard article )
Showing results 1 to 7 of 7.
- Duarte, Abraham; Martí, Rafael; Glover, Fred; Gortazar, Francisco: Hybrid scatter tabu search for unconstrained global optimization (2011)
- Glover, Fred; Hao, Jin-Kao: The case for strategic oscillation (2011)
- Ablanedo-Rosas, José H.; Rego, César: Surrogate constraint normalization for the set covering problem (2010)
- Rego, Cesar; Mathew, Frank; Glover, Fred: RAMP for the capacitated minimum spanning tree problem (2010)
- Agarwal, Anurag: Theoretical insights into the augmented-neural-network approach for combinatorial optimization (2009)
- Charon, Irène; Hudry, Olivier: A survey on the linear ordering problem for weighted or unweighted tournaments (2007)
- Rego, César: RAMP: a new metaheuristic framework for combinatorial optimization (2005)