A connectivity graph generation approach for Manhattan path calculation in detailed facility layout

DOI10.1016/j.amc.2014.03.100zbMath1334.90068OpenAlexW2078206956MaRDI QIDQ274980

Xiao-Jun Zheng

Publication date: 25 April 2016

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2014.03.100

zbMATH Keywords

connectivity graphdetailed layoutfacilities planning and designManhattan pathplane sweep algorithm

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• An O(n log n) plane-sweep algorithm for \(L_ 1\) and \(L_{\infty}\) Delaunay triangulations
• Detailed layout planning for irregularly-shaped machines with transportation path design
• A fast algorithm for connectivity graph approximation using modified Manhattan distance in dynamic networks
• The transitive minimum Manhattan subnetwork problem in 3 dimensions
• \(L_ 1\) shortest paths among polygonal obstacles in the plane
• An improved genetic algorithm for facility layout problems having inner structure walls and passages
• A linear programming embedded probabilistic tabu search for the unequal-area facility layout problem with flexible bays
• Rectilinear paths with minimum segment lengths
• Rectilinear paths among rectilinear obstacles
• Shortest Path Algorithms: An Evaluation Using Real Road Networks
• ON BENDS AND LENGTHS OF RECTILINEAR PATHS: A GRAPH-THEORETIC APPROACH

This page was built for publication: A connectivity graph generation approach for Manhattan path calculation in detailed facility layout