IDEAS home Printed from https://ideas.repec.org/r/inm/oropre/v16y1968i1p150-173.html
   My bibliography  Save this item

An Experimental Comparison of Techniques for the Assignment of Facilities to Locations

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as


Cited by:

  1. Loiola, Eliane Maria & de Abreu, Nair Maria Maia & Boaventura-Netto, Paulo Oswaldo & Hahn, Peter & Querido, Tania, 2007. "A survey for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 176(2), pages 657-690, January.
  2. Sarker, Bhaba R., 2003. "The effect of material flow and workload on the performance of machine location heuristics," European Journal of Operational Research, Elsevier, vol. 148(1), pages 166-191, July.
  3. Tian, Peng & Ma, Jian & Zhang, Dong-Mo, 1999. "Application of the simulated annealing algorithm to the combinatorial optimisation problem with permutation property: An investigation of generation mechanism," European Journal of Operational Research, Elsevier, vol. 118(1), pages 81-94, October.
  4. Warren Adams & Hanif Sherali, 2005. "A Hierarchy of Relaxations Leading to the Convex Hull Representation for General Discrete Optimization Problems," Annals of Operations Research, Springer, vol. 140(1), pages 21-47, November.
  5. Li, Wu-Ji & Smith, J. MacGregor, 1995. "An algorithm for Quadratic Assignment Problems," European Journal of Operational Research, Elsevier, vol. 81(1), pages 205-216, February.
  6. Ravi Kumar, K. & Hadjinicola, George C. & Lin, Ting-li, 1995. "A heuristic procedure for the single-row facility layout problem," European Journal of Operational Research, Elsevier, vol. 87(1), pages 65-73, November.
  7. Paul D. Dowling & R. F. Love, 1990. "Floor layouts using a multifacility location model," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(6), pages 945-952, December.
  8. Richárd Molnár-Szipai & Anita Varga, 2019. "Integrating combinatorial algorithms into a linear programming solver," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 27(2), pages 475-482, June.
  9. Jerzy Grobelny & Rafał Michalski, 2020. "Effects of scatter plot initial solutions on regular grid facility layout algorithms in typical production models," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 28(2), pages 601-632, June.
  10. Miguel F. Anjos & Anthony Vannelli, 2008. "Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes," INFORMS Journal on Computing, INFORMS, vol. 20(4), pages 611-617, November.
  11. Asef-Vaziri, Ardavan & Goetschalckx, Marc, 2008. "Dual track and segmented single track bidirectional loop guidepath layout for AGV systems," European Journal of Operational Research, Elsevier, vol. 186(3), pages 972-989, May.
  12. Qing Zhao & Stefan E. Karisch & Franz Rendl & Henry Wolkowicz, 1998. "Semidefinite Programming Relaxations for the Quadratic Assignment Problem," Journal of Combinatorial Optimization, Springer, vol. 2(1), pages 71-109, March.
  13. A Diponegoro & B R Sarker, 2003. "Machine assignment in a nonlinear multi-product flowline," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(5), pages 472-489, May.
  14. Kazuhiro Tsuchiya & Sunil Bharitkar & Yoshiyasu Takefuji, 1996. "A neural network approach to facility layout problems," European Journal of Operational Research, Elsevier, vol. 89(3), pages 556-563, March.
  15. Mouhamadou A. M. T. Baldé & Serigne Gueye & Babacar M. Ndiaye, 2021. "A greedy evolutionary hybridization algorithm for the optimal network and quadratic assignment problem," Operational Research, Springer, vol. 21(3), pages 1663-1690, September.
  16. Asef-Vaziri, Ardavan & Kazemi, Morteza & Eshghi, Kourosh & Lahmar, Maher, 2010. "An ant colony system for enhanced loop-based aisle-network design," European Journal of Operational Research, Elsevier, vol. 207(1), pages 110-120, November.
  17. Jean-François Cordeau & Manlio Gaudioso & Gilbert Laporte & Luigi Moccia, 2006. "A Memetic Heuristic for the Generalized Quadratic Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 18(4), pages 433-443, November.
  18. A.J. Scott, 1969. "Combinatorial Programming and the Planning of Urban and Regional Systems," Environment and Planning A, , vol. 1(2), pages 125-142, December.
  19. Yu, Junfang & Sarker, Bhaba R., 2003. "Directional decomposition heuristic for a linear machine-cell location problem," European Journal of Operational Research, Elsevier, vol. 149(1), pages 142-184, August.
  20. Bolte, Andreas & Thonemann, Ulrich Wilhelm, 1996. "Optimizing simulated annealing schedules with genetic programming," European Journal of Operational Research, Elsevier, vol. 92(2), pages 402-416, July.
  21. André R. S. Amaral, 2008. "An Exact Approach to the One-Dimensional Facility Layout Problem," Operations Research, INFORMS, vol. 56(4), pages 1026-1033, August.
  22. Ball, Michael O. & Kaku, Bharat K. & Vakhutinsky, Andrew, 1998. "Network-based formulations of the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 104(1), pages 241-249, January.
  23. Zvi Drezner & Peter Hahn & Éeric Taillard, 2005. "Recent Advances for the Quadratic Assignment Problem with Special Emphasis on Instances that are Difficult for Meta-Heuristic Methods," Annals of Operations Research, Springer, vol. 139(1), pages 65-94, October.
  24. Asef-Vaziri, Ardavan & Laporte, Gilbert & Ortiz, Robert, 2007. "Exact and heuristic procedures for the material handling circular flow path design problem," European Journal of Operational Research, Elsevier, vol. 176(2), pages 707-726, January.
  25. Jerzy Grobelny & Rafal Michalski, 2017. "A novel version of simulated annealing based on linguistic patterns for solving facility layout problems," WORking papers in Management Science (WORMS) WORMS/17/07, Department of Operations Research and Business Intelligence, Wroclaw University of Science and Technology.
  26. Yichuan Ding & Henry Wolkowicz, 2009. "A Low-Dimensional Semidefinite Relaxation for the Quadratic Assignment Problem," Mathematics of Operations Research, INFORMS, vol. 34(4), pages 1008-1022, November.
  27. Ignacio Castillo & Thaddeus Sim, 2004. "A spring-embedding approach for the facility layout problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(1), pages 73-81, January.
  28. Souilah, Abdelghani, 1995. "Simulated annealing for manufacturing systems layout design," European Journal of Operational Research, Elsevier, vol. 82(3), pages 592-614, May.
  29. Mans, Bernard & Mautor, Thierry & Roucairol, Catherine, 1995. "A parallel depth first search branch and bound algorithm for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 81(3), pages 617-628, March.
  30. R Sharpe & B S Marksjö, 1985. "Facility Layout Optimization Using the Metropolis Algorithm," Environment and Planning B, , vol. 12(4), pages 443-453, December.
  31. Alexandre Domingues Gonçalves & Artur Alves Pessoa & Cristiana Bentes & Ricardo Farias & Lúcia Maria de A. Drummond, 2017. "A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique," INFORMS Journal on Computing, INFORMS, vol. 29(4), pages 676-687, November.
  32. Kim, J. -Y. & Kim, Y. -D., 1995. "Graph theoretic heuristics for unequal-sized facility layout problems," Omega, Elsevier, vol. 23(4), pages 391-401, August.
  33. Zvi Drezner, 2003. "A New Genetic Algorithm for the Quadratic Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 15(3), pages 320-330, August.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.