A cutting plane algorithm for the site layout planning problem with travel barriers
DOI10.1016/j.cor.2017.01.005zbMath1391.90381OpenAlexW2572737251WikidataQ56476026 ScholiaQ56476026MaRDI QIDQ1652264
Ali Akbarnezhad, Ahmed W. A. Hammad, David Rey
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
decomposition methodsglobal optimisationmixed integer programmingcutting plane algorithms\(d\)-visibilitysite layout planning
Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Discrete location and assignment (90B80)
Related Items (3)
Uses Software
Cites Work
- Unnamed Item
- Planar expropriation problem with non-rigid rectangular facilities
- Planar location problems with block distance and barriers
- The multi-facility location-allocation problem with polyhedral barriers
- The rectilinear distance Weber problem in the presence of a probabilistic line barrier
- Heuristics for the dynamic facility layout problem with unequal-area departments
- The facility layout problem
- An efficient algorithm for facility location in the presence of forbidden regions
- Rectilinear distance to a facility in the presence of a square barrier
- Measuring instance difficulty for combinatorial optimization problems
- Extensions to STaTS for practical applications of the facility layout problem
- Simulated annealing heuristics for the dynamic facility layout problem
- Finite-Size Facility Placement in the Presence of Barriers to Rectilinear Travel
- Facility Locations with the Manhattan Metric in the Presence of Barriers to Travel
- A Theorem on Boolean Matrices
- A reduction result for location problems with polyhedral barriers
This page was built for publication: A cutting plane algorithm for the site layout planning problem with travel barriers
