IDEAS home Printed from https://ideas.repec.org/r/eee/ejores/v46y1990i1p93-100.html
   My bibliography  Save this item

An improved annealing scheme for the QAP

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. Jayaswal, Sachin & Agarwal, Prashant, 2013. "Balancing U-Shaped Assembly Lines with Resource Dependent Task Times: A Simulated Annealing Approach," IIMA Working Papers WP2013-11-06, Indian Institute of Management Ahmedabad, Research and Publication Department.
  3. Matai, Rajesh, 2015. "Solving multi objective facility layout problem by modified simulated annealing," Applied Mathematics and Computation, Elsevier, vol. 261(C), pages 302-311.
  4. Zaidi, I. & Oulamara, A. & Idoumghar, L. & Basset, M., 2024. "Minimizing grid capacity in preemptive electric vehicle charging orchestration: Complexity, exact and heuristic approaches," European Journal of Operational Research, Elsevier, vol. 312(1), pages 22-37.
  5. Franzin, Alberto & Stützle, Thomas, 2023. "A landscape-based analysis of fixed temperature and simulated annealing," European Journal of Operational Research, Elsevier, vol. 304(2), pages 395-410.
  6. 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.
  7. 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.
  8. John J. Bartholdi & Kevin R. Gue, 2000. "Reducing Labor Costs in an LTL Crossdocking Terminal," Operations Research, INFORMS, vol. 48(6), pages 823-832, December.
  9. Vittorio Maniezzo, 1999. "Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 11(4), pages 358-369, November.
  10. Marcus Randall & Graham McMahon & Stephen Sugden, 2002. "A Simulated Annealing Approach to Communication Network Design," Journal of Combinatorial Optimization, Springer, vol. 6(1), pages 55-65, March.
  11. Dimitris Fouskakis & David Draper, 2002. "Stochastic Optimization: a Review," International Statistical Review, International Statistical Institute, vol. 70(3), pages 315-349, December.
  12. Ravi Kumar & Surya Prakash Singh, 2018. "Simulated Annealing-Based Embedded Meta-Heuristic Approach to Solve Bi-objective Robust Stochastic Sustainable Cellular Layout," Global Journal of Flexible Systems Management, Springer;Global Institute of Flexible Systems Management, vol. 19(1), pages 69-93, March.
  13. Zeinal Hamadani, Ali & Abouei Ardakan, Mostafa & Rezvan, Taghi & Honarmandian, Mohammad Mehran, 2013. "Location-allocation problem for intra-transportation system in a big company by using meta-heuristic algorithm," Socio-Economic Planning Sciences, Elsevier, vol. 47(4), pages 309-317.
  14. Ulrich W. Thonemann & Margaret L. Brandeau, 2000. "Optimal Commonality in Component Design," Operations Research, INFORMS, vol. 48(1), pages 1-19, February.
  15. Moriguchi, Kai & Ueki, Tatsuhito & Saito, Masashi, 2017. "Identification of effective implementations of simulated annealing for optimizing thinning schedules for single forest stands," European Journal of Operational Research, Elsevier, vol. 262(3), pages 1094-1108.
  16. Eduardo G. Pardo & Mauricio Soto & Christopher Thraves, 2015. "Embedding signed graphs in the line," Journal of Combinatorial Optimization, Springer, vol. 29(2), pages 451-471, February.
  17. T. G. Pradeepmon & Vinay V. Panicker & R. Sridharan, 2021. "A variable neighbourhood search enhanced estimation of distribution algorithm for quadratic assignment problems," OPSEARCH, Springer;Operational Research Society of India, vol. 58(1), pages 203-233, March.
  18. Zegordi, Seyed Hessameddin & Itoh, Kenji & Enkawa, Takao, 1995. "Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge," European Journal of Operational Research, Elsevier, vol. 85(3), pages 515-531, September.
  19. Maniezzo, Vittorio & Dorigo, Marco & Colorni, Alberto, 1995. "Algodesk: An experimental comparison of eight evolutionary heuristics applied to the Quadratic Assignment Problem," European Journal of Operational Research, Elsevier, vol. 81(1), pages 188-204, February.
  20. LeBlanc, Larry J. & Shtub, Avraham & Anandalingam, G., 1999. "Formulating and solving production planning problems," European Journal of Operational Research, Elsevier, vol. 112(1), pages 54-80, January.
  21. 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.
  22. 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.
  23. Hahn, Peter M. & Kim, Bum-Jin & Stutzle, Thomas & Kanthak, Sebastian & Hightower, William L. & Samra, Harvind & Ding, Zhi & Guignard, Monique, 2008. "The quadratic three-dimensional assignment problem: Exact and approximate solution methods," European Journal of Operational Research, Elsevier, vol. 184(2), pages 416-428, January.
  24. Çetin, Gürcan & Keçebaş, Ali, 2021. "Optimization of thermodynamic performance with simulated annealing algorithm: A geothermal power plant," Renewable Energy, Elsevier, vol. 172(C), pages 968-982.
  25. Luca Maria Gambardella & Marco Dorigo, 2000. "An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem," INFORMS Journal on Computing, INFORMS, vol. 12(3), pages 237-255, August.
  26. Peter Hahn & J. MacGregor Smith & Yi-Rong Zhu, 2010. "The Multi-Story Space Assignment Problem," Annals of Operations Research, Springer, vol. 179(1), pages 77-103, September.
  27. Burkard, Rainer E. & Cela, Eranda, 1995. "Heuristics for biquadratic assignment problems and their computational comparison," European Journal of Operational Research, Elsevier, vol. 83(2), pages 283-300, June.
  28. Stutzle, Thomas, 2006. "Iterated local search for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1519-1539, November.
  29. Solimanpur, M. & Vrat, P. & Shankar, R., 2004. "Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing," European Journal of Operational Research, Elsevier, vol. 157(3), pages 592-606, September.
  30. Lobo, Fernando G. & Bazargani, Mosab & Burke, Edmund K., 2020. "A cutoff time strategy based on the coupon collector’s problem," European Journal of Operational Research, Elsevier, vol. 286(1), pages 101-114.
  31. Taillard, Eric D. & Gambardella, Luca M. & Gendreau, Michel & Potvin, Jean-Yves, 2001. "Adaptive memory programming: A unified view of metaheuristics," European Journal of Operational Research, Elsevier, vol. 135(1), pages 1-16, November.
  32. Moriguchi, Kai & Ueki, Tatsuhito & Saito, Masashi, 2020. "Establishing optimal forest harvesting regulation with continuous approximation," Operations Research Perspectives, Elsevier, vol. 7(C).
  33. Wael Korani & Malek Mouhoub, 2021. "Review on Nature-Inspired Algorithms," SN Operations Research Forum, Springer, vol. 2(3), pages 1-26, September.
  34. Arjang Assad & Weixuan Xu, 1992. "The quadratic minimum spanning tree problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(3), pages 399-417, April.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.