Hybrid scatter search and path relinking for the capacitated p-median problem

2006 ◽  
Vol 169 (2) ◽  
pp. 570-585 ◽  
Author(s):  
Juan A. Díaz ◽  
Elena Fernández
Keyword(s):  
Scatter Search ◽  
Path Relinking ◽  
Median Problem

A Hybrid GRASP-Path Relinking Algorithm for the Capacitated p – hub Median Problem

2005 ◽  
pp. 142-153 ◽  
Author(s):  
Melquíades Pérez ◽  
Francisco Almeida ◽  
J. Marcos Moreno-Vega
Keyword(s):  
Path Relinking ◽  
Median Problem

scholarly journals A Complementary Cyber Swarm Algorithm

2015 ◽  
pp. 50-70 ◽  
Author(s):  
Peng-Yeng Yin ◽  
Fred Glover ◽  
Manuel Laguna ◽  
Jia-Xian Zhu
Keyword(s):  
Scatter Search ◽  
Path Relinking ◽  
Long Term Memory ◽  
Large Set ◽  
Swarm Optimization ◽  
Effective Form ◽  
History Of ◽  
Swarm Algorithm ◽  
Guidance Information

A recent study (Yin, et al., 2010) showed that combining Particle Swarm Optimization (PSO) with the strategies of Scatter Search (SS) and Path Relinking (PR) produces a Cyber Swarm Algorithm that creates a more effective form of PSO than methods that do not incorporate such mechanisms. In this chapter, the authors propose a Complementary Cyber Swarm Algorithm (C/CyberSA) that performs in the same league as the original Cyber Swarm Algorithm but adopts different sets of ideas from the Tabu Search (TS) and the SS/PR template. The C/CyberSA exploits the guidance information and restriction information produced in the history of swarm search and the manipulation of adaptive memory. Responsive strategies using long-term memory and path relinking implementations are proposed that make use of critical events encountered in the search. Experimental results with a large set of challenging test functions show that the C/CyberSA outperforms two recently proposed swarm-based methods by finding more optimal solutions while simultaneously using a smaller number of function evaluations. The C/CyberSA approach further produces improvements comparable to those obtained by the original CyberSA in relation to the Standard PSO 2007 method (Clerc, 2008). These findings motivate future investigations of Cyber Swarm methods that combine features of both the original and complementary variants and incorporate additional strategic notions from the SS/PR template as a basis for creating a still more effective form of swarm optimization.

Scatter Search and Path Relinking

2013 ◽  
pp. 1-21
Author(s):  
Rafael Martí ◽  
Juan-José Pantrigo ◽  
Abraham Duarte ◽  
Vicente Campos ◽  
Fred Glover
Keyword(s):  
Structural Engineering ◽  
Optimization Problems ◽  
Scatter Search ◽  
Decision Rules ◽  
Path Relinking ◽  
Linear Arrangement ◽  
Evolutionary Methods ◽  
Arrangement Problem ◽  
Improved Performance ◽  
The 1960S

Scatter search (SS) and path relinking (PR) are evolutionary methods that have been successfully applied to a wide range of hard optimization problems. The fundamental concepts and principles of the methods were first proposed in the 1970s and 1980s, and were based on formulations, dating back to the 1960s, for combining decision rules and problem constraints. The methods use strategies for search diversification and intensification that have proved effective in a variety of optimization problems and that have sometimes been embedded in other evolutionary methods to yield improved performance. This paper examines the scatter search and path relinking methodologies from both conceptual and practical points of view, and identifies certain connections between their strategies and those adopted more recently by particle swarm optimization. The authors describe key elements of the SS & PR approaches and apply them to a hard combinatorial optimization problem: the minimum linear arrangement problem, which has been used in applications of structural engineering, VLSI and software testing.

Scatter Search and Path Relinking

2011 ◽  
Vol 2 (2) ◽  
pp. 1-21 ◽  
Author(s):  
Rafael Martí ◽  
Juan-José Pantrigo ◽  
Abraham Duarte ◽  
Vicente Campos ◽  
Fred Glover
Keyword(s):  
Structural Engineering ◽  
Optimization Problems ◽  
Scatter Search ◽  
Decision Rules ◽  
Path Relinking ◽  
Linear Arrangement ◽  
Evolutionary Methods ◽  
Arrangement Problem ◽  
Wide Range ◽  
Improved Performance

Scatter search (SS) and path relinking (PR) are evolutionary methods that have been successfully applied to a wide range of hard optimization problems. The fundamental concepts and principles of the methods were first proposed in the 1970s and 1980s, and were based on formulations, dating back to the 1960s, for combining decision rules and problem constraints. The methods use strategies for search diversification and intensification that have proved effective in a variety of optimization problems and that have sometimes been embedded in other evolutionary methods to yield improved performance. This paper examines the scatter search and path relinking methodologies from both conceptual and practical points of view, and identifies certain connections between their strategies and those adopted more recently by particle swarm optimization. The authors describe key elements of the SS & PR approaches and apply them to a hard combinatorial optimization problem: the minimum linear arrangement problem, which has been used in applications of structural engineering, VLSI and software testing.

scholarly journals Scatter search for an uncapacitated p-hub median problem

2015 ◽  
Vol 58 ◽  
pp. 53-66 ◽  
Author(s):  
Rafael Martí ◽  
Ángel Corberán ◽  
Juanjo Peiró
Keyword(s):  
Scatter Search ◽  
Median Problem
Sign in / Sign up

Export Citation Format

Share Document