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 19 of 19 for “"path relinking"”.

  1. AN INVESTIGATION OF METAHEURISTICS USING PATH- RELINKING ON THE QUADRATIC ASSIGNMENT PROBLEM

    … A newly proposed hybrid metaheuristic is path relinking (PR), which is used to generate solutions by combining two or more reference solutions. In this dissertation, we investigated these diversification and intensification mechanisms using QAP. To satisfy the extensive demands of the …

    clemson Repository record for AN INVESTIGATION OF METAHEURISTICS USING PATH- RELINKING ON THE QUADRATIC ASSIGNMENT PROBLEM (opens in a new tab)

  2. Aplicaçaõ das técnicas Path-relinking e Vocabulary buiding na melhoria de performance do algoritmo memético para o problema do caixeiro viajante assimétrico

    … applied optimizing techniques known as Path-Relinking and Vocabulary Building. Furthermore, this last one has being used in two different ways, in order to evaluate the effects of the improvement on the evolutionary metaheuristic. These methods were implemented in C++ code and the …

    brazil-ufrn Repository record for Aplicaçaõ das técnicas Path-relinking e Vocabulary buiding na melhoria de performance do algoritmo memético para o problema do caixeiro viajante assimétrico (opens in a new tab)

  3. METAHEURISTICS FOR HUB LOCATION MODELS

    … performance of hybrid metaheuristics, formed by path-relinking augmentation of the three base algorithms (genetic algorithms, simulated annealing and tabu search). The results indicate that hybridrization with path-relinking improvees the performance of base algorithms except tabu search since a …

    clemson Repository record for METAHEURISTICS FOR HUB LOCATION MODELS (opens in a new tab)

  4. Improved Neighbourhood Search-Based Methods for Graph Layout

    … method that uses a tabu search coupled with path relinking in order to optimise such fitness functions for general graph layouts with undirected straight lines. None of these methods have been previously used in general multi-criteria graph drawing. Tabu search uses a memory list to speed up …

    kent Download PDF for Improved Neighbourhood Search-Based Methods for Graph Layout (opens in a new tab)

  5. Hybridizing metaheuristics for multi-and many-objective problems in a multi-agent architecture

    … space. The proposed velocity operator uses a path-relinking technique and decomposes the objective space without requiring aggregation functions. Another contribution of this thesis is an extensive survey of existing multi-objective path-relinking techniques. Due to a lack in the literature of …

    brazil-ufrn Repository record for Hybridizing metaheuristics for multi-and many-objective problems in a multi-agent architecture (opens in a new tab)

  6. Greedy randomized adaptive search procedure for traveling salesman problem

    … 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 array, is …

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

  7. Incorporating Memory and Learning Mechanisms Into Meta-RaPS

    … of actions. In the third Meta-RaPS version, Path Relinking (PR) was implemented as a post-optimization method in which the new algorithm learns the "good" attributes by memorizing best solutions, and follows them to reach better solutions. The fourth proposed version of Meta-RaPS presented …

    odu Repository record for Incorporating Memory and Learning Mechanisms Into Meta-RaPS (opens in a new tab)

  8. The vehicle routing problem with release and due dates: formulations, heuristics and lower bounds

    … only valid form-commodity flow formulations. A path-relinking algorithm (PRA) is proposed that exploits the efficiency and aggressive improvement of neighbourhood search, but relies on a new path-relinking procedure and advanced population management strategies to navigate the search space …

    soton Download PDF for The vehicle routing problem with release and due dates: formulations, heuristics and lower bounds (opens in a new tab)

  9. A study of the k-way graph partitioning problem

    … podem ser integradas para formar um GRASP com path-relinking. Reportamos experimentos computacionais que mostram que essa abordagem obtém soluções competitivas com particionadores no estado-da-arte. Em particular, o algoritmo híbrido é capaz de encontrar novos melhores valores conhecidos em …

    brazil-ufrgs Repository record for A study of the k-way graph partitioning problem (opens in a new tab)

  10. Heurísticas para a geração de arquiteturas reconfiguráveis em arranjos bidimensionais

    … (Algoritmos Genéticos, Simulated Annealing, Path Relinking) e algoritmos de escalonamento (ALAP e ASAP) visando as arquiteturas reconfiguráveis em arranjos com padrões regulares e escaláveis de interconexão. Para validar a ferramenta, um conjunto de aplicações multimídia, derivadas do …

    brazil-ufv Repository record for Heurísticas para a geração de arquiteturas reconfiguráveis em arranjos bidimensionais (opens in a new tab)

  11. Algorítmo evolucionário para a distribuição de produtos de petróleo por redes de polidutos

    … (PSO), with local search procedures and path-relinking proposed as velocity operators, the second and the third algorithms deal of two versions based on the Non-dominated Sorting Genetic Algorithm II (NSGA-II). The proposed algorithms are compared to other approaches for the same problem, …

    brazil-ufrn Repository record for Algorítmo evolucionário para a distribuição de produtos de petróleo por redes de polidutos (opens in a new tab)

  12. High-performance evolutionary computation for scalable spatial optimization

    … intelligent guided search heuristics such as path relinking and ejection chain to effectively explore SO decision space. As a result, novel spatial recombination operators are developed to handle strong spatial constraints effectively and are generic to incorporate problem-specific spatial …

    uiuc Repository record for High-performance evolutionary computation for scalable spatial optimization (opens in a new tab)

  13. Algoritmos Heurísticos para formação de clusters em redes de sensores sem fio

    … de intensificação baseada na técnica Path Relinking. Para avaliar o desempenho dos algoritmos, foi desenvolvido um simulador que ́ e executado em ciclos (ou rounds). A cada round determina-se uma configura ̧ c ̃ ao da rede e em seguida ́ e feita a transmissão de dados pela rede. Os …

    brazil-ufv Repository record for Algoritmos Heurísticos para formação de clusters em redes de sensores sem fio (opens in a new tab)

  14. Lot-sizing and inventory routing for a production-distribution supply chain

    … the full problem. After a solution is found, path relinking is applied to improve the results. A novel feature of the methodology is the use of an allocation model in the form of a mixed integer program to find good feasible solutions that serve as starting points for the tabu search. Lower …

    texas Repository record for Lot-sizing and inventory routing for a production-distribution supply chain (opens in a new tab)

  15. Algorithms for exact solutions to combinatorial optimization problems

    … that is already conquered, and paving the path for further development in the study of shortest superstrings.A Greedy Randomized Adaptive Search Procedure (GRASP) is an iterative meta-heuristic for combinatorial optimization. Path Relinking (PR) is an approach to integrate intensification …

    greece Repository record for Algorithms for exact solutions to combinatorial optimization problems (opens in a new tab)

  16. Εξελικτικοί αλγόριθμοι για στοχαστικά προβλήματα διαχείρισης της εφοδιαστικής αλυσίδας

    … namely Variable Neighborhood Search and Path Relinking, as well as with a Randomized NEH algorithm for the generation of the initial solution population. The nine resulting hybrid methods were compared in terms of their performance on the classical problem, and the best-performing method …

    greece Repository record for Εξελικτικοί αλγόριθμοι για στοχαστικά προβλήματα διαχείρισης της εφοδιαστικής αλυσίδας (opens in a new tab)

  17. Combining mathematical programming and enhanced GRASP metaheuristics : an application to semiconductor manufacturing

    … adaptive search procedure (GRASP) coupled with path relinking (PR) to solve the capacitated clustering problem. The model is generic and can be applied in many different situations. The objective is to maximize a similarity measure within each cluster such that the sum of the weights associated …

    texas Repository record for Combining mathematical programming and enhanced GRASP metaheuristics : an application to semiconductor manufacturing (opens in a new tab)

  18. Optimization methods for production scheduling: models, algorithms and applications in IoT driven flexible manufacturing systems

    … to solve the problem. This framework adopts a path relinking mechanism that is able to recombine more than two solutions during the evolution of the population. Search intensification is performed using a tabu search algorithm, that is equipped with efficient feasibility and makespan estimation …

    greece Repository record for Optimization methods for production scheduling: models, algorithms and applications in IoT driven flexible manufacturing systems (opens in a new tab)

  19. Metaheurísticas para a minimização do atraso total no problema de sequenciamento em máquinas paralelas com divisão de tarefas

    Este trabalho aborda o problema de escalonar n tarefas independentes em m máquinas paralelas idênticas com o objetivo de minimizar o atraso total das tarefas. Assume-se que uma tarefa possa ser dividida em sub-tarefas e estas possam ser processadas independentemente nas máquinas paralelas …

    brazil-ufv Repository record for Metaheurísticas para a minimização do atraso total no problema de sequenciamento em máquinas paralelas com divisão de tarefas (opens in a new tab)