PARALLEL HYBRID OPTIMIZATION METHODS FOR PERMUTATION BASED PROBLEMS
type: Dataset
contact point: Organization
  fn: CCSD
keyword: grid-computing
keyword: infoinfo-rocomputer-science-csoperations-research-mathoc
keyword: theses
keyword: combinatorial-optimization
keyword: infoeu-reposemanticsdoctoralthesis
keyword: infoinfo-dccomputer-science-csdistributed-parallel-and-cluster-computing-csdc
keyword: paralle-computing
landing page: https://theses.hal.science/tel-00841962
description: Solving efficiently large benchmarks of NP-hard permutation-based problems requires the development of hybrid methods combining different classes of optimization methods. Indeed, it is now acknowledged that such methods perform better than traditional optimization methods when used separately. The key challenge is how to find connections between the divergent search strategies used in each class of methods in order to build efficient hybridization strategies. Genetic algorithms (GAs) are very popular population-based metaheuristics based on stochastic evolutionary operators. The hybridization of GAs with tree-based exact methods such as Branch-and-Bound is a promising research trend. B&B algorithms are based on an implicit enumeration of the solution space represented as a tree. Our hybridization approach consists in providing a common solution and search space coding and associated search operators enabling an efficient cooperation between the two methods. The tree-based representation of the solution space is traditionally used in B&B algorithms to enumerate the solutions of the problem at hand. In this thesis, this special representation is adapted to metaheuristics. The encoding of permutations as natural numbers, which refer to their lexicographic enumeration in the tree, is proposed as a new way to represent the solution space of permutation problems in metaheuristics. This encoding approach is based on the mathematical properties of permutations (Lehmer codes, inversion tables, etc.). Mapping functions between the two representations (permutations and numbers) and special search operators adapted to the encoding are defined for general permutation problems, with respect to the theory of representation. This common representation allows the design of efficient cooperation strategies between GAs and B&B algorithms. In this thesis, two hybridization schemes combining GAs with B&B based on this common representation are proposed. The two hybridization approaches …
issued: 2026-05-10T10:56:43.987072
language: en
modified: 2026-05-10T10:56:43.987077

test_moissonnage_selune
type: Agent

PARALLEL HYBRID OPTIMIZATION METHODS FOR PERMUTATION BASED PROBLEMS
type: Distribution
access URL: https://theses.hal.science/tel-00841962
format: HTML
issued: 2026-05-10T10:56:43.996032
modified: 2026-05-10T10:56:43.977654