Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning

Citations

Cited by:

1. Maria da Conceição Cunha, 1999. "On Solving Aquifer Management Problems with Simulated Annealing Algorithms," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 13(3), pages 153-170, June.
2. Ciancio, Claudio & Laganà, Demetrio & Musmanno, Roberto & Santoro, Francesco, 2018. "An integrated algorithm for shift scheduling problems for local public transport companies," Omega, Elsevier, vol. 75(C), pages 139-153.
3. Larry W. Jacobs & Michael J. Brusco, 1995. "Note: A local‐search heuristic for large set‐covering problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(7), pages 1129-1140, October.
4. Yang, Taho & Peters, Brett A. & Tu, Mingan, 2005. "Layout design for flexible manufacturing systems considering single-loop directional flow patterns," European Journal of Operational Research, Elsevier, vol. 164(2), pages 440-455, July.
5. Juana Enríquez-Urbano & Marco Antonio Cruz-Chávez & Rafael Rivera-López & Martín H. Cruz-Rosales & Yainier Labrada-Nueva & Marta Lilia Eraña-Díaz, 2021. "Metaheuristic to Optimize Computational Convergence in Convection-Diffusion and Driven-Cavity Problems," Mathematics, MDPI, vol. 9(7), pages 1-19, March.
6. Healy, Patrick & Moll, Robert, 1995. "A new extension of local search applied to the Dial-A-Ride Problem," European Journal of Operational Research, Elsevier, vol. 83(1), pages 83-104, May.
7. Voudouris, Christos & Tsang, Edward, 1999. "Guided local search and its application to the traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 113(2), pages 469-499, March.
8. Saul Amorim & Jean-Pierre Barthélemy & Celso Ribeiro, 1992. "Clustering and clique partitioning: Simulated annealing and tabu search approaches," Journal of Classification, Springer;The Classification Society, vol. 9(1), pages 17-41, January.
9. Gabriel M. Portal & Marcus Ritt & Leonardo M. Borba & Luciana S. Buriol, 2016. "Simulated annealing for the machine reassignment problem," Annals of Operations Research, Springer, vol. 242(1), pages 93-114, July.
10. Angelika Wiegele & Shudian Zhao, 2022. "SDP-based bounds for graph partition via extended ADMM," Computational Optimization and Applications, Springer, vol. 82(1), pages 251-291, May.
11. Chang-Yong Lee & Dongju Lee, 2014. "Determination of initial temperature in fast simulated annealing," Computational Optimization and Applications, Springer, vol. 58(2), pages 503-522, June.
12. Khan, W. A. & Hayhurst, D. R. & Cannings, C., 1999. "Determination of optimal path under approach and exit constraints," European Journal of Operational Research, Elsevier, vol. 117(2), pages 310-325, September.
13. Marc Robini & Pierre-Jean Reissman, 2013. "From simulated annealing to stochastic continuation: a new trend in combinatorial optimization," Journal of Global Optimization, Springer, vol. 56(1), pages 185-215, May.
14. Helena Ramalhinho-Lourenço & Daniel Serra, 1998. "Adaptive approach heuristics for the generalized assignment problem," Economics Working Papers 288, Department of Economics and Business, Universitat Pompeu Fabra.
15. Goodson, Justin C. & Ohlmann, Jeffrey W. & Thomas, Barrett W., 2012. "Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand," European Journal of Operational Research, Elsevier, vol. 217(2), pages 312-323.
16. Lim, A. & Rodrigues, B. & Zhang, X., 2006. "Scheduling sports competitions at multiple venues--Revisited," European Journal of Operational Research, Elsevier, vol. 175(1), pages 171-186, November.
17. Burke, Edmund K. & Bykov, Yuri, 2017. "The late acceptance Hill-Climbing heuristic," European Journal of Operational Research, Elsevier, vol. 258(1), pages 70-78.
18. Roberto Maria Rosati & Matteo Petris & Luca Di Gaspero & Andrea Schaerf, 2022. "Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021," Journal of Scheduling, Springer, vol. 25(3), pages 301-319, June.
19. Wen Sun & Jin-Kao Hao & Alexandre Caminada, 2019. "Iterated backtrack removal search for finding k-vertex-critical subgraphs," Journal of Heuristics, Springer, vol. 25(4), pages 565-590, October.
20. S Küçükpetek & F Polat & H Oğuztüzün, 2005. "Multilevel graph partitioning: an evolutionary approach," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(5), pages 549-562, May.
21. Lourenco, Helena Ramalhinho, 1995. "Job-shop scheduling: Computational study of local search and large-step optimization methods," European Journal of Operational Research, Elsevier, vol. 83(2), pages 347-364, June.
22. Dimitris Fouskakis & David Draper, 2002. "Stochastic Optimization: a Review," International Statistical Review, International Statistical Institute, vol. 70(3), pages 315-349, December.
23. Dell'Amico, Mauro & Trubian, Marco, 1998. "Solution of large weighted equicut problems," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 500-521, April.
24. Lee, Young Hoon & Pinedo, Michael, 1997. "Scheduling jobs on parallel machines with sequence-dependent setup times," European Journal of Operational Research, Elsevier, vol. 100(3), pages 464-474, August.
25. Chengcheng Xu & Jinshu Su & Shuhui Chen, 2018. "Exploring efficient grouping algorithms in regular expression matching," PLOS ONE, Public Library of Science, vol. 13(10), pages 1-14, October.
26. Graeme J. Doole & David J. Pannell, 2008. "Optimisation of a Large, Constrained Simulation Model using Compressed Annealing," Journal of Agricultural Economics, Wiley Blackwell, vol. 59(1), pages 188-206, February.
27. Laurent Michel & Pascal Van Hentenryck, 1999. "Localizer: A Modeling Language for Local Search," INFORMS Journal on Computing, INFORMS, vol. 11(1), pages 1-14, February.
28. Doole, Graeme J., 2007. "A primer on implementing compressed simulated annealing for the optimisation of a constrained simulation model in Microsoft Excel," Working Papers 7420, University of Western Australia, School of Agricultural and Resource Economics.
29. Schlereth, Christian & Stepanchuk, Tanja & Skiera, Bernd, 2010. "Optimization and analysis of the profitability of tariff structures with two-part tariffs," European Journal of Operational Research, Elsevier, vol. 206(3), pages 691-701, November.
30. Serigne Gueye & Philippe Michelon, 2005. "“Miniaturized” Linearizations for Quadratic 0/1 Problems," Annals of Operations Research, Springer, vol. 140(1), pages 235-261, November.
31. Robin C. Ball & Juergen Branke & Stephan Meisel, 2018. "Optimal Sampling for Simulated Annealing Under Noise," INFORMS Journal on Computing, INFORMS, vol. 30(1), pages 200-215, February.
32. Goodson, Justin C., 2015. "A priori policy evaluation and cyclic-order-based simulated annealing for the multi-compartment vehicle routing problem with stochastic demands," European Journal of Operational Research, Elsevier, vol. 241(2), pages 361-369.
33. Stefan E. Karisch & Franz Rendl & Jens Clausen, 2000. "Solving Graph Bisection Problems with Semidefinite Programming," INFORMS Journal on Computing, INFORMS, vol. 12(3), pages 177-191, August.
34. Drexl, Andreas & Haase, Knut, 1993. "Sequential-analysis-based randomized-regret-methods for lotsizing and scheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 323, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
35. Zvia Agur & Refael Hassin & Sigal Levy, 2006. "Optimizing Chemotherapy Scheduling Using Local Search Heuristics," Operations Research, INFORMS, vol. 54(5), pages 829-846, October.
36. Jörn Grahl & Stefan Minner & Daniel Dittmar, 2016. "Meta-heuristics for placing strategic safety stock in multi-echelon inventory with differentiated service times," Annals of Operations Research, Springer, vol. 242(2), pages 489-504, July.
37. Van Breedam, Alex, 1995. "Improvement heuristics for the Vehicle Routing Problem based on simulated annealing," European Journal of Operational Research, Elsevier, vol. 86(3), pages 480-490, November.
38. Ahern, Zeke & Paz, Alexander & Corry, Paul, 2022. "Approximate multi-objective optimization for integrated bus route design and service frequency setting," Transportation Research Part B: Methodological, Elsevier, vol. 155(C), pages 1-25.
39. Zachariasen, Martin, 1999. "Local search for the Steiner tree problem in the Euclidean plane," European Journal of Operational Research, Elsevier, vol. 119(2), pages 282-300, December.
40. Genetha Anne Gray & Tamara G. Kolda & Ken Sale & Malin M. Young, 2004. "Optimizing an Empirical Scoring Function for Transmembrane Protein Structure Determination," INFORMS Journal on Computing, INFORMS, vol. 16(4), pages 406-418, November.
41. 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.
42. A. Apte & A. Jayasuriya & J. Kennington & I. Krass & R. Mohamed & S. Sorensen & J. Whitler, 1998. "Class scheduling algorithms for Navy training schools," Naval Research Logistics (NRL), John Wiley & Sons, vol. 45(6), pages 533-551, September.
43. B Suman & P Kumar, 2006. "A survey of simulated annealing as a tool for single and multiobjective optimization," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(10), pages 1143-1160, October.
44. Crama, Y. & Schyns, M., 2003. "Simulated annealing for complex portfolio selection problems," European Journal of Operational Research, Elsevier, vol. 150(3), pages 546-571, November.
45. Jeffrey W. Ohlmann & Barrett W. Thomas, 2007. "A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 19(1), pages 80-90, February.
46. Drexl, Andreas & Juretzka, Jan & Salewski, Frank, 1993. "Academic course scheduling under workload and changeover constraints," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 337, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
47. Bozer, Yavuz A. & Wang, Chi-Tai, 2012. "A graph-pair representation and MIP-model-based heuristic for the unequal-area facility layout problem," European Journal of Operational Research, Elsevier, vol. 218(2), pages 382-391.
48. Orlin, James & Sharma, Dushyant, 2003. "The Extended Neighborhood: Definition And Characterization," Working papers 4392-02, Massachusetts Institute of Technology (MIT), Sloan School of Management.
49. Noureddine Bouhmala, 2019. "Combining simulated annealing with local search heuristic for MAX-SAT," Journal of Heuristics, Springer, vol. 25(1), pages 47-69, February.
50. Anderson, E. J., 1996. "Mechanisms for local search," European Journal of Operational Research, Elsevier, vol. 88(1), pages 139-151, January.
51. Kaji, Taichi & Ohuchi, Azuma, 1999. "A simulated annealing algorithm with the random compound move for the sequential partitioning problem of directed acyclic graphs," European Journal of Operational Research, Elsevier, vol. 112(1), pages 147-157, January.
52. Parthasarathy, Srinivasaraghavan & Rajendran, Chandrasekharan, 1997. "An experimental evaluation of heuristics for scheduling in a real-life flowshop with sequence-dependent setup times of jobs," International Journal of Production Economics, Elsevier, vol. 49(3), pages 255-263, May.
53. Alrefaei, Mahmoud H. & Alawneh, Ameen J., 2005. "Solution quality of random search methods for discrete stochastic optimization," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 68(2), pages 115-125.
54. Kevin Tierney & Björg Áskelsdóttir & Rune Møller Jensen & David Pisinger, 2015. "Solving the Liner Shipping Fleet Repositioning Problem with Cargo Flows," Transportation Science, INFORMS, vol. 49(3), pages 652-674, August.
55. Melissa Gama & Bruno Filipe Santos & Maria Paola Scaparra, 2016. "A multi-period shelter location-allocation model with evacuation orders for flood disasters," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 4(3), pages 299-323, September.
56. Sabuncuoglu, Ihsan & Erel, Erdal & Alp, Arda, 2009. "Ant colony optimization for the single model U-type assembly line balancing problem," International Journal of Production Economics, Elsevier, vol. 120(2), pages 287-300, August.
57. Gajpal, Yuvraj & Abad, P.L., 2009. "Multi-ant colony system (MACS) for a vehicle routing problem with backhauls," European Journal of Operational Research, Elsevier, vol. 196(1), pages 102-117, July.
58. Painton, Laura & Diwekar, Urmila, 1995. "Stochastic annealing for synthesis under uncertainty," European Journal of Operational Research, Elsevier, vol. 83(3), pages 489-502, June.
59. Dudek, Gregor & Stadtler, Hartmut, 2005. "Negotiation-based collaborative planning between supply chains partners," European Journal of Operational Research, Elsevier, vol. 163(3), pages 668-687, June.
60. Alex Bonutti & Sara Ceschia & Fabio De Cesco & Nysret Musliu & Andrea Schaerf, 2017. "Modeling and solving a real-life multi-skill shift design problem," Annals of Operations Research, Springer, vol. 252(2), pages 365-382, May.
61. Michael J. Brusco & Larry W. Jacobs, 1993. "A simulated annealing approach to the cyclic staff‐scheduling problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(1), pages 69-84, February.
62. Van Buer, Michael G. & Woodruff, David L. & Olson, Rick T., 1999. "Solving the medium newspaper production/distribution problem," European Journal of Operational Research, Elsevier, vol. 115(2), pages 237-253, June.
63. Fink, Andreas & Vo[ss], Stefan, 2003. "Solving the continuous flow-shop scheduling problem by metaheuristics," European Journal of Operational Research, Elsevier, vol. 151(2), pages 400-414, December.
64. Gang Yu & Panagiotis Kouvelis & Songjun Luo, 1995. "Weighted vertex packing problem for specially structured geometric graphs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(1), pages 81-102, February.
65. Antunes, Antonio & Peeters, Dominique, 2001. "On solving complex multi-period location models using simulated annealing," European Journal of Operational Research, Elsevier, vol. 130(1), pages 190-201, April.
    • ANTUNES, Antonio & PEETERS, Dominique, 2001. "On solving complex multi-period location models using simulated annealing," LIDAM Reprints CORE 1526, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
66. Andreas Drexl & Martin Mundschenk, 2008. "Long-term staffing based on qualification profiles," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 68(1), pages 21-47, August.
67. Lim, A. & Rodrigues, B. & Zhang, X., 2006. "A simulated annealing and hill-climbing algorithm for the traveling tournament problem," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1459-1478, November.
68. Souilah, Abdelghani, 1995. "Simulated annealing for manufacturing systems layout design," European Journal of Operational Research, Elsevier, vol. 82(3), pages 592-614, May.
69. He, Zesheng & Yang, Taeyong & Tiger, Andy, 1996. "An exchange heuristic imbedded with simulated annealing for due-dates job-shop scheduling," European Journal of Operational Research, Elsevier, vol. 91(1), pages 99-117, May.
70. Kim, Yeong-Dae & Lim, Hyeong-Gyu & Park, Moon-Won, 1996. "Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process," European Journal of Operational Research, Elsevier, vol. 91(1), pages 124-143, May.
71. Yuri Bykov & Sanja Petrovic, 2016. "A Step Counting Hill Climbing Algorithm applied to University Examination Timetabling," Journal of Scheduling, Springer, vol. 19(4), pages 479-492, August.
72. Pirlot, Marc, 1996. "General local search methods," European Journal of Operational Research, Elsevier, vol. 92(3), pages 493-511, August.
73. Drexl, Andreas & Mundschenk, Martin, 2005. "Long-term staffing based on qualification profiles," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 592, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
74. Yiyo Kuo, 2014. "Design method using hybrid of line-type and circular-type routes for transit network system optimization," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(2), pages 600-613, July.
75. Herrmann, Jeffrey & Proth, Jean-Marie & Sauer, Nathalie, 1997. "Heuristics for unrelated machine scheduling with precedence constraints," European Journal of Operational Research, Elsevier, vol. 102(3), pages 528-537, November.
76. Li, Kunpeng & Sivakumar, Appa Iyer & Ganesan, Viswanath Kumar, 2008. "Analysis and algorithms for coordinated scheduling of parallel machine manufacturing and 3PL transportation," International Journal of Production Economics, Elsevier, vol. 115(2), pages 482-491, October.
77. Fathi, Yahya & Aksakalli, Vural, 2004. "Heuristic methods for gang-rip saw arbor design," European Journal of Operational Research, Elsevier, vol. 154(3), pages 626-640, May.
78. Kai Gutenschwager & Christian Niklaus & Stefan Voß, 2004. "Dispatching of an Electric Monorail System: Applying Metaheuristics to an Online Pickup and Delivery Problem," Transportation Science, INFORMS, vol. 38(4), pages 434-446, November.
79. Tan, K. C. & Narasimhan, R., 1997. "Minimizing tardiness on a single processor with sequence-dependent setup times: a simulated annealing approach," Omega, Elsevier, vol. 25(6), pages 619-634, December.
80. Srivastava, Bharatendu & Chen, Wun-Hwa, 1996. "Batching in production planning for flexible manufacturing systems," International Journal of Production Economics, Elsevier, vol. 43(2-3), pages 127-137, June.
81. Drexl, Andreas & Nikulin, Yury, 2005. "Multicriteria airport gate assignment and pareto simulated annealing," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 586, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
82. Yong, Luo & Bo, Zhu & Yong, Tang, 2013. "Dynamic optimal capital growth with risk constraints," Economic Modelling, Elsevier, vol. 30(C), pages 586-594.
83. Michele Battistutta & Andrea Schaerf & Tommaso Urli, 2017. "Feature-based tuning of single-stage simulated annealing for examination timetabling," Annals of Operations Research, Springer, vol. 252(2), pages 239-254, May.
84. Y Gajpal & P Abad, 2010. "Saving-based algorithms for vehicle routing problem with simultaneous pickup and delivery," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(10), pages 1498-1509, October.
85. Renzo Zamprogno & André R. S. Amaral, 2007. "An efficient approach for large scale graph partitioning," Journal of Combinatorial Optimization, Springer, vol. 13(4), pages 289-320, May.
86. Li, Kunpeng & Sivakumar, Appa Iyer & Ganesan, Viswanath Kumar, 2008. "Complexities and algorithms for synchronized scheduling of parallel machine assembly and air transportation in consumer electronics supply chain," European Journal of Operational Research, Elsevier, vol. 187(2), pages 442-455, June.
87. M Kumral & P A Dowd, 2005. "A simulated annealing approach to mine production scheduling," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(8), pages 922-930, August.
88. F. Martinelli, 1999. "Stochastic Comparison Algorithm for Discrete Optimization with Estimation of Time-Varying Objective Functions," Journal of Optimization Theory and Applications, Springer, vol. 103(1), pages 137-159, October.