GRASP with path-relinking for facility layout
From MaRDI portal
Publication:2820115
DOI10.1007/978-1-4614-8588-9_11zbMATH Open1344.90028OpenAlexW17770568MaRDI QIDQ2820115FDOQ2820115
Authors: Ricardo Silva, G. De Tomi, Mauricio G. C. Resende, Panos M. Pardalos, Geraldo Robson Mateus
Publication date: 13 September 2016
Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-8588-9_11
Recommendations
- GRASP with path-relinking for the generalized quadratic assignment problem
- A GRASP algorithm for solving large-scale single row facility layout problems
- Two-level modified simulated annealing based approach for solving facility layout problem
- The facility layout problem
- A memetic heuristic for the generalized quadratic assignment problem
Cites Work
- Assignment Problems and the Location of Economic Activities
- A probabilistic heuristic for a computationally difficult set covering problem
- Greedy randomized adaptive search procedures
- The facility layout problem
- The quadratic assignment problem
- GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
- GRASP with path-relinking for the generalized quadratic assignment problem
- An algorithm for the quadratic assignment problem using Benders' decomposition
- A Strategy for Solving the Plant Layout Problem
Cited In (1)
This page was built for publication: GRASP with path-relinking for facility layout
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2820115)