Parallélisation de la méthode du "Branch and Cut" pour résoudre le problème du voyageur de commerce. (Parallel Branch and Cut for the Traveling Salesman Problem)
نویسنده
چکیده
The Branch and Cut method has been very successful in solving large SymmetricTraveling Salesman instances to optimality. The time needed to solve these instances isvery high, therefore one may want to consider the possibility of using parallel machinesto perform the computations.In the first part of this thesis, we present different components of Branch and Cut. Wegive a polyhedra study of the STSP. We then describe our implementation of the Branchand Cut method.In the second part of this document, we start with a presentation of some basicconcepts of parallelism and the state of the art of the parallelization of the branch-and-bound algorithm which is a related method. Next we propose several models to parallelizethe Branch and Cut. We present the choices we have made when we have implementedour parallel algorithm: control scheme, load balancing strategy... Finally, we give manycomputational results on a IBM-SP1 machine.
منابع مشابه
Contribution théorique et numérique à la résolution du problème du Voyageur de Commerce. (Theoretical and numerical contribution for solving traveling salesman problem)
This dissertation is divided into two part, a theoretical one deals with the trave-ling salesman polytope, the convex hull of hamiltonian cycles, and a more numericalone in which we try to improve the “Branch and Cut” method for traveling salesmanproblem.The theoretical contribution consists in proving that the class of domino in-equalities is facet inducing for the trav...
متن کاملLe voyageur de commerce et ses variations : un tour d’horizon de ses résolutions
Toute personne qui se confronte un jour à la recherche opérationnelle croise nécessairement sur son chemin le problème du voyageur de commerce (noté usuellement TSP). Ce qui donne ce caractère incontournable au TSP, c’est à la fois sa facilité d’appréhension et sa proximité conjointe avec des problèmes simples et complexes. Un problème parlant : on imagine aisément le représentant de commerce t...
متن کاملImplementation and Applications of Ant Colony Algorithms
Mémoire présenté en vue de l'obtention du grade de Licencié en Informatique Summary There are even increasing efforts in searching and developing algorithms that can find solutions to combinatorial optimization problems. In this way, the Ant Colony Optimization Metaheuristic takes inspiration from biology and proposes different versions of still more efficient algorithms. Like other methods , A...
متن کاملScheduling series-parallel task graphs to minimize peak memory
We consider a variant of the well-known, NP-complete problem of minimum cut linear arrangement for directed acyclic graphs. In this variant, we are given a directed acyclic graph and asked to find a topological ordering such that the maximum number of cut edges at any point in this ordering is minimum. In our main variant the vertices and edges have weights, and the aim is to minimize the maxim...
متن کاملApplication des techniques d'enchères dans les réseaux de radio cognitive
RESUME. La prolifération rapide de standards et services de radiocommunication ces dernières années provoquent le problème de la pénurie du spectre. Dans ce contexte, l'objectif principal de la Radio Cognitive (RC) est de faciliter l’accès au spectre radio. Notre contribution dans le cadre de ce papier est l’utilisation des enchères pour résoudre le problème de l’encombrement du spectre dans le...
متن کامل