Five key problems of kinship networks are boundedness, cohesion, size and cohesive relinking, types of relations and relinking, and groups or roles. Approaches to solving these problems include formats available for electronic storage of genealogical data and representations of genealogies using graphs. P-graphs represent couples and uncoupled children as vertices, whereas parent-child links ar...

In this paper we consider the problem of finding a global optimum of a multimodal function applying path relinking. In particular, we target unconstrained large scale problems and compare two variants of this methodology: the static and the evolutionary path relinking. Both are based on the strategy of creating trajectories of moves passing through high quality solutions in order to incorporate...

In this paper we consider a complex supply chain system where facilities produce intermediate-items or enditems that are shipped to other facilities or customers. We consider a complicated production process that can be convergent, divergent and circulatory. In order to facilitate modeling and solving the integrated production-distribution planning problem in the supply chain, extended state ta...

This paper introduces the Path Relinking Particle Filter (PRPF) algorithm for improving estimation problems in human motion capture. PRPF hybridizes both Particle Filter and Path Relinking frameworks. The proposed algorithm increases the performance of general Particle Filter by improving the quality of the estimate, adapting computational load to problem constraints and reducing the number of ...

A Path Relinking algorithm is proposed for the Bandwidth Coloring problem and the Bandwidth MultiColoring problem. It combines a population based relinking method and a tabu search based local search procedure. The proposed algorithm is assessed on two sets of 66 benchmark instances commonly used in the literature. Computational results demonstrate that the proposed algorithm is highly competit...

A Greedy Randomized Adaptive Search Procedure (GRASP) is a metaheuristic for combinatorial optimization. It usually consists of a construction procedure based on a greedy randomized algorithm and local search. Path-relinking is an intensification strategy that explores trajectories that connect high quality solutions. We analyze two parallel strategies for GRASP with path-relinking and propose ...

This paper presents a hypervolume-based multi-objective path relinking algorithm for approximating the Pareto optimal set of multi-objective combinatorial optimization problems. We focus on integrating path relinking techniques within a multi-objective local search as an initialization function. Then, we carry out a range of experiments on bi-objective flow shop problem and bi-objective quadrat...

We propose the use of scatter search with path relinking for the inference of phylogenetic trees. Solutions are here represented as trees whose leaves span the set of species under study. These trees are evaluated using a minimum weight criterion under the ultrametric model. The main features of this approach are the utilization of a crossover-based schema for diversification generation, the us...