Local Search Algorithms for the Maximal Planar Layout Problem

DOI10.1111/j.1475-3995.1995.tb00007.xzbMath0868.90072OpenAlexW4242583213MaRDI QIDQ5689972

Merza H. Hasan, Ibrahim. H Osman

Publication date: 18 August 1997

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/j.1475-3995.1995.tb00007.x

zbMATH Keywords

manufacturingtabu searchlocal search algorithmsfacility layouthybrid simulated annealingsteepest ascentweighted maximal planar graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Discrete location and assignment (90B80)

Related Items (7)

Location and layout planning. A survey ⋮ A simulated annealing algorithm for the maximum planar subgraph problem ⋮ Two new heuristic algorithms for the maximal planar layout problem ⋮ A tabu thresholding algorithm for arc crossing minimization in bipartite graphs ⋮ Metaheuristics: A bibliography ⋮ A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem ⋮ Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient models for the facility layout problem
• Simulated annealing: A tool for operational research
• The facility layout problem
• Genetic algorithms, function optimization, and facility layout design
• Future paths for integer programming and links to artificial intelligence
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• Assignment Problems and the Location of Economic Activities
• Convergence of an annealing algorithm
• A New Graph-Theoretic Heuristic for Facility Layout
• Tabu Search—Part I
• Tabu Search—Part II
• P-Complete Approximation Problems
• Capacitated clustering problems by hybrid simulated annealing and tabu search

This page was built for publication: Local Search Algorithms for the Maximal Planar Layout Problem