A decomposition-based algorithm for the double row layout problem
From MaRDI portal
Publication:1988733
DOI10.1016/j.apm.2019.08.015zbMath1443.90240OpenAlexW2969371531WikidataQ127357629 ScholiaQ127357629MaRDI QIDQ1988733
Zhi-Qiang Ruan, Jian Guan, Hui-Bin Feng, Geng Lin
Publication date: 24 April 2020
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2019.08.015
decompositionlocal searchmixed integer programmingparticle swarm optimizationdouble row layout problem
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (2)
Decorous combinatorial lower bounds for row layout problems ⋮ Exact approaches for the combined cell layout problem
Cites Work
- Search performance improvement of particle swarm optimization by second best particle information
- Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem
- A parallel ordering problem in facilities layout
- The corridor allocation problem
- Efficiently solving the traveling thief problem using hill climbing and simulated annealing
- Enhancing PSO methods for global optimization
- A novel approach for considering layout problem in cellular manufacturing systems with alternative processing routings and subcontracting approach
- A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem
- An improved mixed-integer programming model for the double row layout of facilities
- A GRASP algorithm for solving large-scale single row facility layout problems
- Improved local search approaches to solve the post enrolment course timetabling problem
- Optimal solutions for the double row layout problem
- BNC-PSO: structure learning of Bayesian networks by particle swarm optimization
- Simulated annealing and tabu search approaches for the Corridor Allocation Problem
- A modeling framework and local search solution methodology for a production-distribution problem with supplier selection and time-aggregated quantity discounts
- A semidefinite optimization approach for the single-row layout problem with unequal dimensions
- Solution Approaches for the Double-Row Equidistant Facility Layout Problem
- The double row layout problem
- One-Dimensional Space Allocation: An Ordering Algorithm
This page was built for publication: A decomposition-based algorithm for the double row layout problem