A cutting plane algorithm for the site layout planning problem with travel barriers

DOI10.1016/J.COR.2017.01.005MaRDI QIDQ1652264zbMATH OpenOpenAlexWikidataFDO

Authors Ahmed W. A. Hammad, David Rey, Ali Akbarnezhad

Publication date 11 July 2018

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

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

zbMATH Keywords

\(d\)-visibilitycutting plane algorithmsdecomposition methodsglobal optimisationmixed integer programmingsite layout planning

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26)

Recommendations

• Enhanced Model Formulations for Optimal Facility Layout
• The multi-facility location-allocation problem with polyhedral barriers
• Mathematical optimization approach for facility layout on several rows
• Layout planning for facilities with fixed shapes and input and output points
• Novel integer linear programming models for the facility layout problem with fixed-size rectangular departments

Cites work

• A reduction result for location problems with polyhedral barriers
• A Theorem on Boolean Matrices
• An efficient algorithm for facility location in the presence of forbidden regions
• Extensions to STaTS for practical applications of the facility layout problem
• Facility Locations with the Manhattan Metric in the Presence of Barriers to Travel
• Finite-Size Facility Placement in the Presence of Barriers to Rectilinear Travel
• Heuristics for the dynamic facility layout problem with unequal-area departments
• scientific article; zbMATH DE number 1803754 (Why is no real title available?)
• Measuring instance difficulty for combinatorial optimization problems
• Planar expropriation problem with non-rigid rectangular facilities
• Planar location problems with block distance and barriers
• Rectilinear distance to a facility in the presence of a square barrier
• Simulated annealing heuristics for the dynamic facility layout problem
• The facility layout problem
• The multi-facility location-allocation problem with polyhedral barriers
• The rectilinear distance Weber problem in the presence of a probabilistic line barrier

Cited in

(3)

• Optimal facility layout and material handling network design
• Survey of quantitative methods in construction
• Collaborative optimization of workshop layout and scheduling

Describes a project that uses

Uses Software

• Algorithm 97

This page was built for publication: A cutting plane algorithm for the site layout planning problem with travel barriers

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