Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory
From MaRDI portal
Publication:4427376
DOI10.1287/ijoc.11.2.198zbMath1040.90541OpenAlexW2166210809MaRDI QIDQ4427376
Publication date: 1999
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.11.2.198
Related Items
Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach, A grasp-knapsack hybrid for a nurse-scheduling problem, Vehicle routing problems with time windows and multiple service workers: a systematic comparison between ACO and GRASP, Making a state-of-the-art heuristic faster with data mining, A survey for the quadratic assignment problem, Tabu search and GRASP for the maximum diversity problem, A hybrid data mining GRASP with path-relinking, A combined multistart random constructive heuristic and set partitioning based formulation for the vehicle routing problem with time dependent travel times, An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem, Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking, Metaheuristics: A Canadian Perspective, MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems, Seeking global edges for traveling salesman problem in multi-start search, Ant colony optimization combined with taboo search for the job shop scheduling problem, An experimental study of variable depth search algorithms for the quadratic assignment problem, Multi-start approach for an integer determinant maximization problem, Adaptive memory in multistart heuristics for multicommodity network design, An adaptive tabu search approach for buffer allocation problem in unreliable non-homogenous production lines, A GRASP-based approach for technicians and interventions scheduling for telecommunications, Greedy random adaptive memory programming search for the capacitated clustering problem, Randomized heuristics for the Max-Cut problem, An ejection chain algorithm for the quadratic assignment problem, Models and algorithms for optimising two-dimensional LEGO constructions, Optimisation and static equilibrium of three-dimensional LEGO constructions, A greedy randomized adaptive search procedure for the orienteering problem with hotel selection, A hybrid data mining metaheuristic for the p‐median problem, Un algorithme GRASP pour le problème de planification de techniciens et d'interventions pour les télécommunications, An interactive GRAMPS algorithm for the heterogeneous fixed fleet vehicle routing problem with and without backhauls, Memetic algorithms, Solution of large weighted equicut problems, Scatter search for network design problem, Metaheuristics in combinatorial optimization
Uses Software
