Local Search Algorithms for the Maximal Planar Layout Problem

DOI10.1111/J.1475-3995.1995.TB00007.XMaRDI QIDQ5689972zbMATH OpenOpenAlexFDO

Authors 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

tabu searchmanufacturingfacility layoutlocal search algorithmshybrid simulated annealingsteepest ascentweighted maximal planar graph

Mathematics Subject Classification ID

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

Recommendations

• Efficient facility layout planning in a maximally planar graph model
• Two new heuristic algorithms for the maximal planar layout problem
• scientific article; zbMATH DE number 1206315
• Linear programming based meta-heuristics for the weighted maximal planar graph

Cites work

• scientific article; zbMATH DE number 3748431 (Why is no real title available?)
• scientific article; zbMATH DE number 1488569 (Why is no real title available?)
• A New Graph-Theoretic Heuristic for Facility Layout
• Assignment Problems and the Location of Economic Activities
• Capacitated clustering problems by hybrid simulated annealing and tabu search
• Convergence of an annealing algorithm
• Efficient models for the facility layout problem
• Future paths for integer programming and links to artificial intelligence
• Genetic algorithms, function optimization, and facility layout design
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• P-Complete Approximation Problems
• Simulated annealing: A tool for operational research
• Tabu Search—Part I
• Tabu Search—Part II
• The facility layout problem

Cited in

(11)

• An algorithm of global optimization for solving layout problems
• A Local Optimization-based Solution to the Rectangle Layout Problem
• A tabu thresholding algorithm for arc crossing minimization in bipartite graphs
• A simulated annealing algorithm for the maximum planar subgraph problem
• A global optimization algorithm for the layout problem of rectangular pieces based on the maximal planar graph
• Location and layout planning. A survey
• Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem
• A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem
• Metaheuristics: A bibliography
• scientific article; zbMATH DE number 1086894 (Why is no real title available?)
• Two new heuristic algorithms for the maximal planar layout problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5689972)