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

Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning

Citations

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


Cited by:

  1. M Plumettaz & D Schindl & N Zufferey, 2010. "Ant Local Search and its efficient adaptation to graph colouring," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(5), pages 819-826, May.
  2. 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.
  3. Olawale Titiloye & Alan Crispin, 2012. "Parameter Tuning Patterns for Random Graph Coloring with Quantum Annealing," PLOS ONE, Public Library of Science, vol. 7(11), pages 1-9, November.
  4. Pedroso, João Pedro & Kubo, Mikio, 2010. "Heuristics and exact methods for number partitioning," European Journal of Operational Research, Elsevier, vol. 202(1), pages 73-81, April.
  5. Iztok Fister & Marjan Mernik & Bogdan Filipič, 2013. "Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm," Computational Optimization and Applications, Springer, vol. 54(3), pages 741-770, April.
  6. Laurent Moalic & Alexandre Gondran, 2018. "Variations on memetic algorithms for graph coloring problems," Journal of Heuristics, Springer, vol. 24(1), pages 1-24, February.
  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. Noronha, Thiago F. & Ribeiro, Celso C., 2006. "Routing and wavelength assignment by partition colouring," European Journal of Operational Research, Elsevier, vol. 171(3), pages 797-810, June.
  9. 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.
  10. 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.
  11. Daniel Kowalczyk & Roel Leus, 2017. "An exact algorithm for parallel machine scheduling with conflicts," Journal of Scheduling, Springer, vol. 20(4), pages 355-372, August.
  12. 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.
  13. Severino F. Galán, 2017. "Simple decentralized graph coloring," Computational Optimization and Applications, Springer, vol. 66(1), pages 163-185, January.
  14. Russell Bent & Pascal Van Hentenryck, 2004. "A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 38(4), pages 515-530, November.
  15. Bradley Hardy & Rhyd Lewis & Jonathan Thompson, 2018. "Tackling the edge dynamic graph colouring problem with and without future adjacency information," Journal of Heuristics, Springer, vol. 24(3), pages 321-343, June.
  16. Celia A. Glass & Adam Prügel-Bennett, 2003. "Genetic Algorithm for Graph Coloring: Exploration of Galinier and Hao's Algorithm," Journal of Combinatorial Optimization, Springer, vol. 7(3), pages 229-236, September.
  17. Jagota, Arun, 1996. "An adaptive, multiple restarts neural network algorithm for graph coloring," European Journal of Operational Research, Elsevier, vol. 93(2), pages 257-270, September.
  18. C A Glass & A Prügel-Bennett, 2005. "A polynomially searchable exponential neighbourhood for graph colouring," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(3), pages 324-330, March.
  19. Burke, Edmund K. & Bykov, Yuri, 2017. "The late acceptance Hill-Climbing heuristic," European Journal of Operational Research, Elsevier, vol. 258(1), pages 70-78.
  20. repec:dgr:rugsom:00a47 is not listed on IDEAS
  21. Nicolas Zufferey & Olivier Labarthe & David Schindl, 2012. "Heuristics for a project management problem with incompatibility and assignment costs," Computational Optimization and Applications, Springer, vol. 51(3), pages 1231-1252, April.
  22. Caramia, Massimiliano & Dell'Olmo, Paolo, 2008. "Embedding a novel objective function in a two-phased local search for robust vertex coloring," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1358-1380, September.
  23. 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.
  24. 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.
  25. 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.
  26. 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.
  27. Lü, Zhipeng & Hao, Jin-Kao, 2010. "A memetic algorithm for graph coloring," European Journal of Operational Research, Elsevier, vol. 203(1), pages 241-250, May.
  28. 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.
  29. 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.
  30. 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.
  31. 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.
  32. 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.
  33. 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.
  34. Massimiliano Caramia & Paolo Dell'Olmo, 2001. "Iterative coloring extension of a maximum clique," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(6), pages 518-550, September.
  35. Valmir C. Barbosa & Carlos A.G. Assis & Josina O. Do Nascimento, 2004. "Two Novel Evolutionary Formulations of the Graph Coloring Problem," Journal of Combinatorial Optimization, Springer, vol. 8(1), pages 41-63, March.
  36. George Henrique Godim Fonseca & Haroldo Gambini Santos & Túlio Ângelo Machado Toffolo & Samuel Souza Brito & Marcone Jamilson Freitas Souza, 2016. "GOAL solver: a hybrid local search based solver for high school timetabling," Annals of Operations Research, Springer, vol. 239(1), pages 77-97, April.
  37. 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.
  38. 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.
  39. Philippe Galinier & Zied Boujbel & Michael Coutinho Fernandes, 2011. "An efficient memetic algorithm for the graph partitioning problem," Annals of Operations Research, Springer, vol. 191(1), pages 1-22, November.
  40. Avanthay, Cedric & Hertz, Alain & Zufferey, Nicolas, 2003. "A variable neighborhood search for graph coloring," European Journal of Operational Research, Elsevier, vol. 151(2), pages 379-388, December.
  41. Vincenzo Cutello & Giuseppe Nicosia & Mario Pavone, 2007. "An immune algorithm with stochastic aging and kullback entropy for the chromatic number problem," Journal of Combinatorial Optimization, Springer, vol. 14(1), pages 9-33, July.
  42. 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.
  43. Xiao-Feng Xie & Jiming Liu, 2009. "Graph coloring by multiagent fusion search," Journal of Combinatorial Optimization, Springer, vol. 18(2), pages 99-123, August.
  44. Ç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.
  45. 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.
  46. Enrico Malaguti & Michele Monaci & Paolo Toth, 2008. "A Metaheuristic Approach for the Vertex Coloring Problem," INFORMS Journal on Computing, INFORMS, vol. 20(2), pages 302-316, May.
  47. 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.
  48. Souilah, Abdelghani, 1995. "Simulated annealing for manufacturing systems layout design," European Journal of Operational Research, Elsevier, vol. 82(3), pages 592-614, May.
  49. 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.
  50. Brailsford, Sally C. & Potts, Chris N. & Smith, Barbara M., 1999. "Constraint satisfaction problems: Algorithms and applications," European Journal of Operational Research, Elsevier, vol. 119(3), pages 557-581, December.
  51. Malaguti, Enrico & Toth, Paolo, 2008. "An evolutionary approach for bandwidth multicoloring problems," European Journal of Operational Research, Elsevier, vol. 189(3), pages 638-651, September.
  52. 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.
  53. Pirlot, Marc, 1996. "General local search methods," European Journal of Operational Research, Elsevier, vol. 92(3), pages 493-511, August.
  54. 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.
  55. Sierksma, G. & Ghosh, D., 2000. "Complete local search with memory," Research Report 00A47, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
  56. S. Butenko & P. Festa & P. M. Pardalos, 2001. "On the Chromatic Number of Graphs," Journal of Optimization Theory and Applications, Springer, vol. 109(1), pages 69-83, April.
  57. 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.
  58. Charon, Irene & Hudry, Olivier, 2001. "The noising methods: A generalization of some metaheuristics," European Journal of Operational Research, Elsevier, vol. 135(1), pages 86-101, November.
  59. S. Acharyya & A. K. Datta, 2020. "Matching formulation of the Staff Transfer Problem: meta-heuristic approaches," OPSEARCH, Springer;Operational Research Society of India, vol. 57(3), pages 629-668, September.
  60. 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.
  61. Vincent F. Yu & Hadi Susanto & Yu-Hsuan Yeh & Shih-Wei Lin & Yu-Tsung Huang, 2022. "The Vehicle Routing Problem with Simultaneous Pickup and Delivery and Parcel Lockers," Mathematics, MDPI, vol. 10(6), pages 1-22, March.
  62. Chiang, Wen-Chyuan & Chiang, Chi, 1998. "Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 457-488, April.
  63. Philippe Galinier & Jin-Kao Hao, 1999. "Hybrid Evolutionary Algorithms for Graph Coloring," Journal of Combinatorial Optimization, Springer, vol. 3(4), pages 379-397, December.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.