Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 20 for “"2-Opt"”.

  1. The anteater analysis: a comparison of traveling salesman tour construction methods and their global frequencies

    … such as nearest neighbors and ant colony optimization algorithms. In this work, the ATT48 and EIL101 instances are examined to better understand the difference between biased and unbiased methods of tour construction algorithms when combined with the 2-opt local search operator. First, a …

    colostate Repository record for The anteater analysis: a comparison of traveling salesman tour construction methods and their global frequencies (opens in a new tab)

  2. Greedy randomized adaptive search procedure for traveling salesman problem

    … construct the initial TSP tour, we apply the 2-opt and the path-relinking method for the initial tour improvement. To increase 2-opt search speed, fixed-radius near neighbor search and don0t − look bit techniques are introduced. For the same reason a new efficient data structure, the reverse …

    tamu Repository record for Greedy randomized adaptive search procedure for traveling salesman problem (opens in a new tab)

  3. Multiple Vehicle Routing Problem with Fuel Constraints

    … Four neighborhoods were investigated (2-opt, 3-opt, Target Vehicle Exchange, Depot Exchange), using the Variable Neighborhood Descent and Variable Neighborhood Search schemes, with APD and Voronoi partition methods. These neighborhoods were compared to investigate their performance for …

    tamu Repository record for Multiple Vehicle Routing Problem with Fuel Constraints (opens in a new tab)

  4. A Hybrid Lehmer Code Genetic Algorithm and Its Application on Traveling Salesman Problems

    … Problems (TSP) is a widely studied combinatorial optimization problem. The goal of the TSP is to find a tour which begins in a specific city, visits each of the remaining cities once and returns to the initial cities such that the objective functions are optimized, typically involving minimizing …

    odu Repository record for A Hybrid Lehmer Code Genetic Algorithm and Its Application on Traveling Salesman Problems (opens in a new tab)

  5. Algorithm mapping to reconfigurable systems and systems with multiple embedded processors

    … (TSP) is probably the most-studied combinatorial optimization problem of all time. TSP applications range from logistics, and job scheduling, to computing DNA sequences, designing and testing VLSI circuits, x-ray crystallography, and many others. Many researchers, both mathematicians and computer …

    greece Repository record for Algorithm mapping to reconfigurable systems and systems with multiple embedded processors (opens in a new tab)

  6. Euristiniai algoritmai keliaujančio pirklio maršruto tobulinimui /

    … improving traveling salesman algorithms: “2 - opt”, “Simulated Annealing” and “taboo” were analyzed and compared. Also, the environments, used for those algorithms analysis and test data generation, were created. Detailed descriptions about done experiments and used data is provided in this …

    vilnius Repository record for Euristiniai algoritmai keliaujančio pirklio maršruto tobulinimui / (opens in a new tab)

  7. LEARNING-TO-SEARCH APPROACHES FOR VEHICLE ROUTING PROBLEMS USING DEEP REINFORCEMENT LEARNING

    … Transformer (DACT) approach for neural 2-opt search, addressing fundamental design limitations in feature encoding and DRL training. Next, it proposes the Neural Neighborhood Search (N2S) approach for neural ruin-repair search, extending the L2S solvers to efficiently tackle pickup and …

    nus Repository record for LEARNING-TO-SEARCH APPROACHES FOR VEHICLE ROUTING PROBLEMS USING DEEP REINFORCEMENT LEARNING (opens in a new tab) Download file for LEARNING-TO-SEARCH APPROACHES FOR VEHICLE ROUTING PROBLEMS USING DEEP REINFORCEMENT LEARNING (opens in a new tab)

  8. Combinatorial Ant Optimization and the Flowshop Problem

    … meta-heuristics to solve many Combinatorial Optimization (CO) problems, e.g., Flow shop Scheduling Problem, Travelling Salesman Problem (TSP) since the early 60s of the last century. Ant Colony Optimization (ACO) and its variants were introduced by Dorigo et al. [DBS06] in the early 1990s …

    unlv Repository record for Combinatorial Ant Optimization and the Flowshop Problem (opens in a new tab) Download PDF for Combinatorial Ant Optimization and the Flowshop Problem (opens in a new tab)

  9. PRACTICAL AND THEORETICAL ADVANCES IN CONSTRAINED BAYESIAN OPTIMIZATION AND BAYESIAN OPTIMIZATION FOR MACHINE LEARNING SYSTEMS

    … in computationally efficient non-myopic Bayesian optimization (BO) improve query efficiency over traditional myopic methods like expected improvement while only modestly increasing computational cost. These advances have been largely limited, however, to unconstrained optimization. For constrained …

    cornell Repository record for PRACTICAL AND THEORETICAL ADVANCES IN CONSTRAINED BAYESIAN OPTIMIZATION AND BAYESIAN OPTIMIZATION FOR MACHINE LEARNING SYSTEMS (opens in a new tab)

  10. Testing Silver Mobility: An investigation into supergene silver enrichment at the Rochester Mine in Pershing County, Nevada

    … and goethite-rich rocks. High grade zones (≥2 opt Ag) are controlled by high- and low-angle faults cutting the Weaver-Rochester contact. Acanthite is the dominant silver phase. Much of the acanthite formed by supergene enrichment based on its common occurrence with covellite as rims on hypogene …

    unr Repository record for Testing Silver Mobility: An investigation into supergene silver enrichment at the Rochester Mine in Pershing County, Nevada (opens in a new tab)

  11. Approaches for solving some scheduling and routing problems

    … lower bounds, for three difficult combinatorial optimisation problems.<br/>The supply ship travelling salesman problem is a simplification of a situation faced by a naval logistics coordinator who must direct a support vessel tasked with resupplying ships in a fleet. It is a generalisation of the …

    soton Download PDF for Approaches for solving some scheduling and routing problems (opens in a new tab)

  12. A Blueprint for Student-Athlete Success: Understanding the Conditions Implemented by University Coaches

    … create a team vision with clear objectives, (2) opt for athletes of best fit, (3) assemble team roles and expectations, (4) confirm and allocate necessary resources and support, and (5) have competent and prepared team coaching. Within each condition, I first provide support for their relevance …

    queens Repository record for A Blueprint for Student-Athlete Success: Understanding the Conditions Implemented by University Coaches (opens in a new tab)

  13. Tabu search for bus and train driver scheduling with time windows

    … two, discrete times within each time window. Optimality of solution is therefore compromised. The research presented in this thesis focuses on solving the driver scheduling problem with WROs using a constructive approach, which builds and refines a single schedule iteratively. Filtering rules …

    whiterose Download PDF for Tabu search for bus and train driver scheduling with time windows (opens in a new tab)

  14. Heurisic approaches for no-depot k-traveling salesmen problem with a minmax objective

    … As a local search method for a single tour, 2-opt search and Lin-Kernighan were used, and for a local search method between multiple tours, relocation and exchange (edge heuristics) were used. Furthermore, to prevent the drawback of trapping in the local minima, the simulated annealing method …

    tamu Repository record for Heurisic approaches for no-depot k-traveling salesmen problem with a minmax objective (opens in a new tab)

  15. Räumliche Optimierung der Bestandesstruktur unter Berücksichtigung von Einzelbaumeffekten

    … von Einzelbäumen mit Methoden der räumlichen Optimierung kombiniert, um ein Werkzeug zu schaffen, mit dem Empfehlungen für die Strukturierung von Beständen erarbeiten werden können. Dabei waren drei unterschiedliche waldbauliche Problemstellungen Ausgangspunkt der Arbeit. Die ausführliche …

    qucosa-diss

  16. Análisis comparados de sistemas de información en el estudio del impacto de la gripe en la atención hospitalaria

    … hospitalised with influenza. METHODS: Three options for universal influenza surveillance in hospitals were compared: 1) Maintain a case register with passive surveillance; 2) Opt for a real-time epidemiological surveillance system; and 3) Explore the use of a secondary data source, such as …

    valladolid Repository record for Análisis comparados de sistemas de información en el estudio del impacto de la gripe en la atención hospitalaria (opens in a new tab)

  17. On Routing Unmanned Aerial Vehicles for Surveillance and Reconnaissance Activities

    … interest for developing efficient algorithms to optimally route UAVs. However, most common developments on traditional models and algorithms for UAV routing problems are often insufficient to accommodate the needs of UAV routing tasks without introducing fundamental modifications, especially in …

    buffalo Repository record for On Routing Unmanned Aerial Vehicles for Surveillance and Reconnaissance Activities (opens in a new tab)

  18. Bulk segregant analysis for anther culture response and leptine content in backcross families of diploid potato

    … BSA using 214 RAPD primers. Three primers OPQ-2, OPT-16 and OPT-20 amplified bands segregating with high bulks in both populations. These markers were linked in coupling to leptine content in PBCp. Linkage was verified by ANOVAs for leptine content in the entire population.

    vt Repository record for Bulk segregant analysis for anther culture response and leptine content in backcross families of diploid potato (opens in a new tab)

  19. Pokročilá evoluční optimalizace úloh typu TSP

    Práce řeší problém obchodního cestujícího pomocí evolučního algoritmu, konktrétně pomocí genetického algoritmu. Jedná se o hybrid genetického algoritmu s využitím lokálního prohledávacího algoritmu a dalších vylepšení, které nám pomohou vylepšit výsledky. Problémy obchodního cestujícího budou …

    brno-tech Repository record for Pokročilá evoluční optimalizace úloh typu TSP (opens in a new tab)

  20. Problém obchodního cestujícího

    … mnou vymyšlený a implementovaný algoritmus. ACO optimalizace, které zlepšují výsledky, jako jsou nastavení počátečních feromonů pomocí algoritmu nejbližších sousedů. Můj algoritmus funguje na principu postupného vylepšování cesty.

    brno-tech Repository record for Problém obchodního cestujícího (opens in a new tab)