A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem

DOI10.1016/j.cor.2005.07.027zbMath1086.90050OpenAlexW2030023753MaRDI QIDQ2489303

Ibrahim. H Osman

Publication date: 16 May 2006

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2005.07.027

zbMATH Keywords

Construction heuristicsTabu searchGraph theoryCombinatorial optimization problemMeta-heuristicsData structureFacility layoutDiversification strategyWeighted maximal planar graph

Mathematics Subject Classification ID

Continuous location (90B85) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

Extensions to STaTS for practical applications of the facility layout problem, Stats: A slicing tree and tabu search based heuristic for the unequal area facility layout problem

Uses Software

• Excel
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Using tabu search techniques for graph coloring
• Density based problem space search for the capacitated clustering \(p\)-median problem
• Greedy random adaptive memory programming search for the capacitated clustering problem
• Graph theory applications
• Planar graphs: Theory and algorithms
• Location and layout planning. A survey
• A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls
• Future paths for integer programming and links to artificial intelligence
• Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
• Diversification strategies in tabu search algorithms for the maximum clique problem
• Metaheuristics: A bibliography
• Maximum planar subgraphs and nice embeddings: Practical layout tools
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• Two graph-theoretic procedures for an improved solution to the facilities layout problem
• Facilities Layout Adjacency Determination: An Experimental Comparison of Three Graph Theoretic Heuristics
• A New Graph-Theoretic Heuristic for Facility Layout
• Tabu Search—Part I
• TESSA—A new greedy heuristic for facilities layout planning
• A Strategy for Solving the Plant Layout Problem
• A comparative evaluation of heuristics forthe adjacency problem in facility layout planning
• The Vertex Splitting Algorithm for facilities layout
• Efficient facility layout planning in a maximally planar graph model
• A new approach to the block layout problem
• A GRASP for graph planarization
• Tabu search variants for the mix fleet vehicle routing problem
• Linear programming based meta-heuristics for the weighted maximal planar graph
• A note on 'Efficient facility layout planning in a maximally planar graph model'
• Capacitated clustering problems by hybrid simulated annealing and tabu search
• Local Search Algorithms for the Maximal Planar Layout Problem
• Handbook of metaheuristics
• Essays and surveys in metaheuristics. Selected papers of the Third Metaheuristics International Conference held in Angra dos Reis, Brazil, July 1999